Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
AN OPPORTUNITY COST APPROACH FOR JOB ASSIGNMENT IN A SCALABLE COMPUTING CLUSTER 1
 

Summary: AN OPPORTUNITY COST APPROACH FOR JOB ASSIGNMENT IN A
SCALABLE COMPUTING CLUSTER 1
Yair AMIR 2 , Baruch AWERBUCH 2 , Amnon BARAK 3 , R. Sean BORGSTROM 2 , and Arie KEREN 3
1 This research is supported, in part, by the Defense Advanced Research Projects Agency (DARPA) under grant
F306029610293 to Johns Hopkins University.
2 {yairamir, baruch, rsean} @cs.jhu.edu
Department of Computer Science, The Johns Hopkins University, Baltimore MD 21218.
3 {amnon, ariek} @cs.huji.ac.il
Institute of Computer Science, The Hebrew University of Jerusalem 91904, Israel.
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 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

  

Source: Amir, Yair - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences