437 search results - page 26 / 88 » Quincy: fair scheduling for distributed computing clusters |
CLUSTER
2004
IEEE
15 years 3 months ago
2004
IEEE
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation ...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
We explore the creation of a metacomputer by the aggregation of independent sites. Joining a metacomputer is voluntary, and hence it has to be an endeavor that mutually benefits a...
105
click to vote
PDP
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
CLUSTER
2000
IEEE
14 years 11 months ago
2000
IEEE
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...