Inter-operating grids through delegated matchmaking

  • Authors:

  • Alexandru Iosup;Dick H. J. Epema;Todd Tannenbaum;Matthew Farrellee;Miron Livny

  • Affiliations:

  • Delft University of Technology, Delft, NL;Delft University of Technology, Delft, NL;University of Wisconsin, Madison, WI, US;University of Wisconsin, Madison, WI, US;University of Wisconsin, Madison, WI, US

  • Venue:
  • Proceedings of the 2007 ACM/IEEE conference on Supercomputing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The grid vision of a single computing utility has yet to materíalize: while many grids with thousands of processors each exist, most work in isolation. An important obstacle for the effective and efficient inter-operation of grids is the problem of resource selection. In this paper we propose a solution to this problem that combines the hierarchical and decentralized approaches for interconnecting grids. In our solution, a hierarchy of grid sites is augmented with peer-to-peer connections between sites under the same administrative control. To operate this architecture, we employ the key concept of delegated matchmaking, which temporarily binds resources from remote sites to the local environment. With trace-based simulations we evaluate our solution under various infrastructural and load conditions, and we show that it outperforms other approaches to inter-operating grids. Specifically, we show that delegated matchmaking achieves up to 60% more goodput and completes 26% more jobs than its best alternative.