1257 search results - page 191 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
IPPS
1996
IEEE
15 years 2 months ago
1996
IEEE
Brewer and Kuszmaul [BK94] demonstrated how barriers and traffic interleaving can alleviate the problem of bulk-transfer performance degradation on the Thinking Machines CM-5, by ...
106
click to vote
CCGRID
2009
IEEE
14 years 11 months ago
2009
IEEE
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
SC
2003
ACM
15 years 3 months ago
2003
ACM
Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major ...
HPDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may furthermore be maintained in large numbers of relatively small fil...