Sciweavers

355 search results - page 51 / 71
» Asynchronous distributed optimization with minimal communica...
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 8 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ITNG
2008
IEEE
14 years 2 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh
DAIS
2003
13 years 9 months ago
Planning for Network-Aware Paths
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...
Xiaodong Fu, Vijay Karamcheti
CNSR
2005
IEEE
191views Communications» more  CNSR 2005»
14 years 1 months ago
Understanding the Performance of Cooperative Web Caching Systems
Web caching has been recognized as an effective scheme to alleviate the service bottleneck and reduce the network traffic, thereby minimizing the user access latency on the Intern...
Xiaosong Hu, A. Nur Zincir-Heywood
ICPADS
1998
IEEE
14 years 1 days ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang