skip to main content
10.1145/1341811.1341839acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesmardi-grasConference Proceedingsconference-collections
poster

Distributed meta-scheduling for grids

Published: 29 January 2008 Publication History

Abstract

Grid computing stands for the effort undertaken mainly by computing centers to open up and combine their resources for an enhanced availability. There is a growing demand for an automatic balance of inter-infrastructure resource requests that existing middleware such as UNICORE and Globus Tool Kit is ill-suited to satisfy, as it it requires the user to provide the location of suitable resources and only facilitates the migration process. Other projects like Gridway or LSF Multicluster suffer (at least currently) from missing interoperability. We describe a distributed, failure-resilient meta-scheduling architecture that allows the automatic exchange of job requests between resource providers, aiming at improved resource utilization, automatic load-balancing, as well as reduced turn-around times. Additionally, the system tries to achieve grid-wide improvements while still preserving the autonomy of resource providers. This is accomplished by making all decisions locally.

References

[1]
J. Heilgeist, T. Soddemann, and H. Richter. Algorithms for job and resource discovery for the meta-scheduler of the DEISA grid. In International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP'07), 2007. And references therein.
[2]
T. Saaty. Math. Methods of Operations Research. Dover Publications Inc., 2004. And references therein.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
MG '08: Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities
January 2008
178 pages
ISBN:9781595938350
DOI:10.1145/1341811
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • National e-Science Institute (Edinburgh, UK)
  • Louisiana State University (USA)

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 January 2008

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Poster

Conference

Mardi Gras'08
Sponsor:
Mardi Gras'08: 15th Mardi Gras Conference on Distributed Applications
January 29 - February 3, 2008
Louisiana, Baton Rouge, USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media