Location of Repository

An Opportunity Cost Approach for Job Assignment and Reassignment in a Scalable Computing Cluster

By Author Affiliations Yair, Arie Keren Are Affiliated, Yair Amir, Yair Amir, Baruch Awerbuch, Baruch Awerbuch, Amnon Barak, Amnon Barak, R. Sean Borgstrom and Arie Keren

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. Keywords. Networks, resource allocation, metacomputers. 1. INTRODUCTION The performance of any cluster of workstations improves when its resources are used wisely. A poor job assignment strategy can result in heavily unbalanced loads and ..

Topics: resource allocation, metacomputers
Year: 2000
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.7653
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cnds.jhu.edu/~yaira... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.