Name
Abstract | ||
|---|---|---|
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 are then performed based on that cost. This is in contrast to traditional, ad hoc methods for job assignment and reassignment. These treated each resource as an independent entity with its own constraints, as there was no clean way to balance one resource against another. Our method has been tested by simulations, as well as real executions, and was found to perform well. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/71.877834 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
job assignment,real execution,heterogeneous resource,theoretical framework,scalable computing cluster,opportunity cost,single homogeneous,independent entity,new method,opportunity cost approach,own constraint,computing cluster,resource management,testing,resource allocation,helium,bandwidth,workstations,networks,availability | Computer science,Homogeneous,Job assignment,Real-time computing,Resource allocation,Workstation clusters,Computer cluster,Distributed computing,Opportunity cost,Scalable computing | Journal |
Volume | Issue | ISSN |
11 | 7 | 1045-9219 |
Citations | PageRank | References |
88 | 8.02 | 6 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yair Amir | 1 | 1173 | 108.54 |
| Baruch Awerbuch | 2 | 4040 | 657.22 |
| Amnon Barak | 3 | 590 | 119.00 |
| R. Sean Borgstrom | 4 | 112 | 11.75 |
| Arie Keren | 5 | 204 | 17.85 |