DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling

Details DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling

2007-07-05

arxiv.org/abs/0707.0743v1

Computer Science

Distributed, Parallel, and Cluster Computing

8 pages, 9 figures. Presented at the 2nd IEEE Int Conference on eScience & Grid Computing. Amsterdam Netherlands, December 200

Scientific paper

The use of meta-schedulers for resource management in large-scale distributed systems often leads to a hierarchy of schedulers. In this paper, we discuss why existing meta-scheduling hierarchies are sometimes not sufficient for Grid systems due to their inability to re-organise jobs already scheduled locally. Such a job re-organisation is required to adapt to evolving loads which are common in heavily used Grid infrastructures. We propose a peer-to-peer scheduling model and evaluate it using case studies and mathematical modelling. We detail the DIANA (Data Intensive and Network Aware) scheduling algorithm and its queue management system for coping with the load distribution and for supporting bulk job scheduling. We demonstrate that such a system is beneficial for dynamic, distributed and self-organizing resource management and can assist in optimizing load or job distribution in complex Grid infrastructures.

Affiliated with

Also associated with

No associations

Rating

DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568906