1257 search results - page 108 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
135
click to vote
HCW
2000
IEEE
15 years 7 months ago
2000
IEEE
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
180
click to vote
OPODIS
2010
15 years 1 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
130
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper presents efficient all-to-all broadcast algorithms for arbitrary irregular networks with switch-based wormhole interconnection and unicast message passing. First, all-t...
123
click to vote
GCC
2004
Springer
15 years 8 months ago
2004
Springer
Distributed computing on heterogeneous nodes, or grid computing, provides a substantial increase in computational power available for many applications. This paper reports our expe...
118
click to vote
TPDS
1998
15 years 2 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...