Type of Document Master's Thesis Author Prabhakar, Sandeep Author's Email Address firstname.lastname@example.org URN etd-06272003-110759 Title Zone Based Scheduling: A Framework for Scalable Scheduling of SPMD parallel programs on the Grid Degree Master of Science Department Computer Science Advisory Committee
Advisor Name Title Ribbens, Calvin J. Committee Chair Santos, Eunice E. Committee Member Varadarajan, Srinidhi Committee Member Keywords
- Application Representation and Mapping
- Grid Scheduling
- Grid Computing
Date of Defense 2003-06-16 Availability unrestricted Abstract
Grid computing is a field of research that combines many computers from distant locations to form one large computing resource. In order to be able to make use of the full potential of such a system there is a need to effectively manage resources on the Grid. There are numerous scheduling systems to perform this management for clusters of computers and a few scheduling systems for the Grid. These systems try for optimality (or close to optimality) with the goals of obtaining good throughput and minimizing job completion time.
In this research, we examine issues that we believe have not been tackled in schedulers for the Grid. These issues revolve around the problem of coordinating resources belonging to separate administrative domains and scheduling in this context. In order for grid computing’s vision of virtual organizations to be realized to its fullest extent, there is a need to implement and test schedulers that find resources and schedule tasks on them in a manner that is transparent to the user. These resources might be on a different administrative domain altogether and obtaining either resource or user account information on those resources might be difficult. Also, each organization might require their own policies and mechanisms to be enforced. Hence having a centralized scheduler is not feasible due to the pragmatics of the Grid.
There are two basic aims to this thesis. The first aim is to design and implement a framework that takes administrative concerns into consideration during scheduling. The aim of the framework is to provide a lightweight, extensible, secure and scalable architecture under which multiple scheduling algorithms can be implemented. Second, we evaluate two prototypical of scheduling algorithms in the context of this framework. Scheduling algorithms are diverse and the applications are varied. Thus no single algorithm can obtain a good mapping for every application. We believe that different scheduling algorithms will be necessary to schedule different types of applications. In order to facilitate development of such algorithms, a framework in which it is easy to integrate other scheduling algorithms is necessary. The framework developed in this project is designed for such extensibility.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access SandeepPrabhakarThesis.pdf 711.03 Kb 00:03:17 00:01:41 00:01:28 00:00:44 00:00:03
If you have questions or technical problems, please Contact DLA.