Peer-to-peer discovery of computational resources for grid applications

Adeep S. Cheema, Moosa Muhammad, Indranil Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Grid applications need to discover computational resources quickly, efficiently and scalably, but most importantly in an expressive manner. An expressive query may specify a variety of required metrics for the job, e.g., the number of hosts required, the amount of free CPU required on these hosts, and the minimum amount of RAM required on these hosts, etc. We present a peer-to-peer (p 2p) solution to this problem, using structured naming to enable both (1) publishing of information about available computational resources, as well as (2) expressive and efficient querying of such resources. Extensive traces collected from hosts within the Computer Science department at UIUC are used to evaluate our proposed solution. Finally, our solutions are based upon a well known p 2p system called Pastry, albeit for Grid applications; this is another step towards the much-needed convergence of Grid and p 2p computing.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Pages179-185
Number of pages7
DOIs
StatePublished - 2005
Event6th IEEE/ACM International Workshop on Grid Computing - Seattle, WA, United States
Duration: Nov 13 2005Nov 14 2005

Publication series

NameProceedings - IEEE/ACM International Workshop on Grid Computing
Volume2005
ISSN (Print)1550-5510

Other

Other6th IEEE/ACM International Workshop on Grid Computing
Country/TerritoryUnited States
CitySeattle, WA
Period11/13/0511/14/05

Keywords

  • Application Scheduling
  • Grid Computing
  • Peer-to-peer
  • Range Queries

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Peer-to-peer discovery of computational resources for grid applications'. Together they form a unique fingerprint.

Cite this