ACM Home Page
Please provide us with feedback. Feedback
Inter-operating grids through delegated matchmaking
Full text PdfPdf (357 KB)
Source
Conference on High Performance Networking and Computing archive
Proceedings of the 2007 ACM/IEEE conference on Supercomputing - Volume 00 table of contents
Reno, Nevada
SESSION: Grid scheduling table of contents
Article No. 13  
Year of Publication: 2007
ISBN:978-1-59593-764-3
Authors
Alexandru Iosup  Delft University of Technology, Delft, NL
Dick H. J. Epema  Delft University of Technology, Delft, NL
Todd Tannenbaum  University of Wisconsin, Madison, WI, US
Matthew Farrellee  University of Wisconsin, Madison, WI, US
Miron Livny  University of Wisconsin, Madison, WI, US
Sponsors
IEEE-CS\DATC : IEEE Computer Society
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 35,   Citation Count: 6
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1362622.1362640
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
The Grid Workloads Archive. {Online} http://gwa.ewi.tudelft.nl., Jul 2007.
 
2
The Parallel Workloads Archive. {Online} http://www.cs.huji.ac.il/labs/parallel/workload/., Jul 2007.
3
 
4
N. Andrade et al. OurGrid: An approach to easily assemble grids with equitable resource sharing. In JSSPP, volume 2862 of LNCS, pages 61--86, 2003.
 
5
 
6
 
7
 
8
Cluster Resources Inc. Moab workload manager administrator's guide. Tech. Doc. v.5.0, Jan 2007.
 
9
 
10
Dutch University Backbone. The distributed ASCI supercomputer 2 (DAS-2), 2006.
 
11
 
12
 
13
 
14
15
 
16
A. Iosup, C. Dumitrescu, D. H. Epema, H. Li, and L. Wolters. How are real grids used? The analysis of four grid traces and its implications. In GRID, pages 262--270. IEEE CS, 2006.
 
17
A. Iosup, M. Jan, O. Sonmez, and D. Epema. The characteristics and performance of groups of jobs in grids. In Euro-Par, LNCS, 2007.
 
18
 
19
 
20
 
21
 
22
A. Reinefeld et al. Managing clusters of geographically distributed high-performance computers. CP&E, 11(15):887--911, 1999.
 
23
P. Saiz, P. Buncic, and A. J. Peters. AliEn resource brokers. In Computing in High Energy and Nuclear Physics, 2003. Also available as CoRR, cs.DC/0306068.
 
24
25
 
26
 
27

Collaborative Colleagues:
Alexandru Iosup: colleagues
Dick H. J. Epema: colleagues
Todd Tannenbaum: colleagues
Matthew Farrellee: colleagues
Miron Livny: colleagues