Autonomous Resource Selection for Decentralized Utility Computing

Abstract

Many large-scale utility computing infrastructures comprise heterogeneous hardware and software resources. This raises the need for scalable resource selection services, which identify resources that match application requirements, and can potentially be assigned to these applications. We present a fully decentralized resource selection algorithm by which resources autonomously select themselves when their attributes match a query. An application specifies what it expects from a resource by means of a conjunction of (attribute,value-range) pairs, which are matched against the attribute values of resources. We show that our solution scales in the number of resources as well as in the number of attributes, while being relatively insensitive to churn and other membership changes such as node failures.

Download

• The paper, in PDF (1,267,785 bytes). Note: we slightly edited the paper compared to the camera-ready version to increase the size of figures.
• See also: the XtreemOS Project.

Bibtex Entry

@InProceedings{,
  author =       {Paolo Costa and Jeff Napper and Guillaume Pierre 
                  and Maarten van Steen},
  title =        {Autonomous Resource Selection for Decentralized 
                  Utility Computing},
  booktitle =    {Proceedings of the 29th International Conference on
                  Distributed Computing Systems (ICDCS)},
  address =      {Montreal, Canada},
  month =        jun,
  year =         {2009},
  note =         {\url{http://www.globule.org/publi/ARAUC_icdcs2009.html}}
}