A Multi-level Scheduler for the Grid Computing YML Framework

Noël, Sébastien; Delannoy, Olivier; Emad, Nahid; Manneback, Pierre; Petiton, Serge G.

doi:10.1007/978-3-540-72337-0_9

Cited by 5 publications

(2 citation statements)

References 6 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The YML, Nimrod-G and SORMA economic-based distributed grid resource management and scheduling systems are described respectively in [28][29][30]. YML framework integrates a multi-level scheduler and is focused on two major aspects: the development of parallel applications and their execution on grid environments.…”

Section: Related Workmentioning

confidence: 99%

A multi-level scheduler for batch jobs on grids

et al. 2011

View full text Add to dashboard Cite

This paper proposes a two-level scheduler for dynamically scheduling a continuous stream of sequential and multi-threaded batch jobs on grids, made up of interconnected clusters of heterogeneous single-processor and/or symmetric multiprocessor machines. The scheduler aims to schedule arriving jobs respecting their computational and deadline requirements, and optimizing the hardware and software resource usage. At the top of the hierarchy a lightweight meta-scheduler (MS) classifies incoming jobs according to their requirements, and schedules them among the underlying resources balancing the workload. At cluster level a Flexible Backfilling algorithm carries out the job machine associations by exploiting dynamic information about the environment. Scheduling decisions at both levels are based on job priorities computed by using different sets of heuristics. The different proposals have been compared through simulations. Performance figures show the feasibility of our approach.

show abstract

Section: Related Workmentioning

confidence: 99%

A multi-level scheduler for batch jobs on grids

et al. 2011

View full text Add to dashboard Cite

show abstract

“…Hence, the overhead for scheduling and job launching is reduced and resource utilization is increased. S´ebastien Noel et al [13], studied the use of a framework called YML for developing HPC applications on Grids, and proposed a multilevel scheduling architecture for it. K. Etminani and M. Naghibzadeh introduced a new scheduling algorithm based on two conventional scheduling algorithms, Min-Min and MaxMin, to use their cons and at the same time, cover their pros.…”

Section: Related Workmentioning

confidence: 99%

Multiphase Scalable Grid Scheduler Based on Multi-QoS Using Min-Min Heuristic

Mehdi¹,

Mamat²,

Ibrahim³

et al. 2010

IJACSA

View full text Add to dashboard Cite

Abstract-In scheduling, the main factor that affects searching speed and mapping performance is the number of resources or the size of search space. In grid computing, the scheduler performance plays an essential role in the overall performance. So, it is obvious the need for scalable scheduler that can manage the growing in resources (i.e. scalable). With the assumption that each resource has its own specifications and each job has its own requirements; then searching the whole search space (all the resources) can waste plenty of scheduling time. In this paper, we propose a two-phase scheduler that uses min-min algorithm to speed up the mapping time with almost the same efficiency. The scheduler is also based on the assumption that the resources in grid computing can be classified into clusters. The scheduler tries first to schedule the jobs to the suitable cluster (i.e. first phase) and then each cluster schedule the incoming jobs to the suitable resources (i.e. second phase). The scheduler is based on multidimensional QoS to enhance the mapping as much as it can. The simulation results show that the use of two-phase strategy can support the scalable scheduler.

show abstract