|
The grid vision of a single computing utility has yet to materialize: 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 work 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, daily.
Presentation | Hand-outs ![Inter-Operating Grids through Delegated MatchMaking, PDF [350KB]](icos/icopdf.gif)
Assignments:
- Using GrenchMark, generate workloads with different job arrival patterns, and submit them to your grid. How many jobs finish in a given time? How does the jobs' response time vary with the job arrival pattern?
- Using GrenchMark, generate workloads with jobs that arrive at two grid clusters. The arrivals at one grid cluster can be either independent of the other's, or alternative with the arrivals of the other cluster. What is the time needed to complete all jobs in the workload in the two cases?
|