Clusters, Grids, and Peer-to-Peer (P2P) networks have emerged as popular paradigms for next generation parallel and distributed computing. They enable aggregation of distributed resources for solving large-scale problems in science, engineering, and commerce. In Grid and P2P computing environments, the resources are usually geographically distributed in multiple administrative domains, managed and owned by different organizations with different policies, and interconnected by wide-area networks or the Internet. This introduces a number of resource management and application scheduling challenges in the domain of security, resource and policy heterogeneity, fault tolerance, continuously changing resource conditions, and politics. The resource management and scheduling systems for Grid computing need to manage resources and application execution depending on either resource consumers’ or owners’ requirements, and continuously adapting to changes in resource availability. The management resources and scheduling of applications in such a large-scale distributed systems is complex undertaking. In order to prove the effectiveness of resource brokers and associated scheduling algorithms, their performance need to evaluated under different scenarios such as varying number of resources and users with different requirements. In Grid environment, it is hard and even impossible to perform scheduler performance evaluation in a repeatable and controllable manner as resources and users are distributed across multiple organizations with their own policies. To overcome this limitation, we have proposed and developed a Java-based discrete-event Grid simulation toolkit called GridSim. The toolkit supports modeling and simulation of heterogeneous Grid resources (both time and space-shared), users and application models. It provides primitives for creation of application tasks, mapping of tasks to resources and their management. To demonstrate suitability of the GridSim toolkit, we have simulated a Nimrod-G like grid resource broker and evaluated the performance of deadline and budget constrained costand timeminimization scheduling algorithms.
[1]
Ian T. Foster,et al.
Globus: a Metacomputing Infrastructure Toolkit
,
1997,
Int. J. High Perform. Comput. Appl..
[2]
Andrew A. Chien,et al.
The MicroGrid: a Scientific Tool for Modeling Computational Grids
,
2000,
ACM/IEEE SC 2000 Conference (SC'00).
[3]
Rajkumar Buyya,et al.
High Performance Cluster Computing: Architectures and Systems
,
1999
.
[4]
Mineo Takai,et al.
Parssec: A Parallel Simulation Environment for Complex Systems
,
1998,
Computer.
[5]
David Abramson,et al.
Economic models for management of resources in peer-to-peer and grid computing
,
2001,
SPIE ITCom.
[6]
Rajkumar Buyya,et al.
The Grid: International Efforts in Global Computing
,
2000
.
[7]
Jon B. Weissman.
Grids in the classroom
,
2000,
IEEE Concurr..
[8]
Rajkumar Buyya,et al.
High Performance Cluster Computing: Programming and Applications
,
1999
.
[9]
David Abramson,et al.
An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications
,
2000
.
[10]
Henri Casanova,et al.
Simgrid: a toolkit for the simulation of application scheduling
,
2001,
Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.
[11]
A. Varga,et al.
THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM
,
2003
.
[12]
David Abramson,et al.
Nimrod/G: an architecture for a resource management and scheduling system in a global computational grid
,
2000,
Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.
[13]
James F. Doyle,et al.
Peer-to-Peer: harnessing the power of disruptive technologies
,
2001,
UBIQ.
[14]
David Abramson,et al.
High performance parametric modeling with Nimrod/G: killer application for the global grid?
,
2000,
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.