1257 search results - page 134 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
JSSPP
1997
Springer
15 years 5 months ago
1997
Springer
In this paper we have characterized the inter-arrival time and service time distributions for jobs at a large MPP supercomputing center. Our findings show that the distributions ...
121
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Load balancing is a key concern when developing parallel and distributed computing applications. The emergence of computational grids extends this problem, where issues of cross-d...
110
click to vote
PDP
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
145
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
139
click to vote
ICS
2007
Tsinghua U.
15 years 7 months ago
2007
Tsinghua U.
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...