2002 · 57 citations · 7 references
ComputingComputer EngineeringComputer ScienceCluster ComputingParallel ComputingSchedulingAssignment ProblemsCluster ManagementCompute Resource ManagementJob SchedulingPerformance OptimizationResource AllocationCluster PlacementCluster ReconfigurationCluster ScalabilityCluster SchedulingCost-aware PlacementScalable ComputingScalable Scheduling
. A new method is presented for job assignment to and reassignment between machines in a computing cluster. Our method is based on a theoretical framework that has been experimentally tested and shown to be useful in practice. This "opportunity cost" method converts the usage of several heterogeneous resources in a machine to a single homogeneous "cost." Assignment and reassignment is then performed based on that cost. This is in contrast to previous methods for job assignment and reassignment, which treat each resource as an independent entity with its own constraints. These previous methods were intrinsically ad hoc, as there was no clean way to balance one resource against another. 1. Introduction The more powerful a cluster of workstations is, the more important it is to use its resources wisely. A poor job assignment strategy can result in heavily unbalanced loads and thrashing machines, which cripples the cluster's computational power. Resources can be used more efficiently ...
7
On-line load balancing with applications to machine scheduling and virtual circuit routing
James Aspnes, Yossi Azar, Amos Fiat et al. · 1993 · 215 citations · Full text
New algorithms for an ancient scheduling problem
Yair Bartal, Amos Fiat, Howard Karloff et al. · 1992 · 208 citations