Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Non-cooperative, Semi-cooperative, and Cooperative Games-based Grid Resource Allocation
 

Summary: Non-cooperative, Semi-cooperative, and Cooperative Games-based Grid
Resource Allocation
Samee Ullah Khan and Ishfaq Ahmad
Department of Computer Science and Engineering
University of Texas at Arlington, TX-76019, U.S.A.
{sakhan, iahmad}@cse.uta.edu
Abstract
In this paper we consider, compare and analyze
three game theoretical Grid resource allocation
mechanisms. Namely, 1) the non-cooperative sealed-bid
method where tasks are auctioned off to the highest
bidder, 2) the semi-cooperative n-round sealed-bid
method in which each site delegate its work to others if it
cannot perform the work itself, and 3) the cooperative
method in which all of the sites deliberate with one
another to execute all the tasks as efficiently as possible.
To experimentally evaluate the above mentioned
techniques, we perform extensive simulation studies that
effectively encapsulate the task and machine
heterogeneity. The tasks are assumed to be independent

  

Source: Ahmad, Ishfaq - Department of Computer Science and Engineering, University of Texas at Arlington

 

Collections: Computer Technologies and Information Sciences