This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Bouteiller, A. Articles by Cappello, F. Search for Related Content Social Bookmarking                         What's this?

Hybrid Preemptive Scheduling of Message Passing Interface Applications on Grids

INRIA/LRI UNIVERSITÉ PARIS-SUD, ORSAY, FRANCE; BOUTEILL{at}LRI.FR

Hinde-Lilia Bouziane

Thomas Herault

Pierre Lemarinier

Franck Cappello

INRIA/LRI UNIVERSITÉ PARIS-SUD, ORSAY, FRANCE

Time sharing between cluster resources in a grid is a major issue in cluster and grid integration. Classical grid architecture involves a higher-level scheduler which submits non-overlapping jobs to the independent batch schedulers of each cluster of the grid. The sequentiality induced by this approach does not fit with the expected number of users and job heterogeneity of grids. Time sharing techniques address this issue by allowing simultaneous executions of many applications on the same resources.

Co-scheduling and gang scheduling are the two best known techniques for time sharing cluster resources. Coscheduling relies on the operating system of each node to schedule the processes of every application. Gang scheduling ensures that the same application is scheduled on all nodes simultaneously. Previous work has proven that coscheduling techniques outperform gang scheduling when physical memory is not exhausted.

In this paper, we introduce a new hybrid sharing technique providing checkpoint-based explicit memory management. It consists in co-scheduling parallel applications within a set, until the memory capacity of the node is reached, and using gang scheduling related techniques to switch from one set to another one. We compare experimentally the merits of the three solutions (co-scheduling, gang scheduling, and hybrid scheduling) in the context of out-of-core computing, which is likely to occur in the grid context, where many users share the same resources. Additionally, we address the problem of heterogeneous applications by comparing hybrid scheduling to an optimized version relying on paired scheduling. The experiments show that the hybrid solution is as efficient as the co-scheduling technique when the physical memory is not exhausted, can benefit from the paired scheduling optimization technique when applications are heterogeneous, and is more efficient than gang scheduling and coscheduling when physical memory is exhausted.

Key Words: Scheduling • performance • message passing interface • time sharing • grid • gang scheduling • co-scheduling

International Journal of High Performance Computing Applications, Vol. 20, No. 1, 77-90 (2006)
DOI: 10.1177/1094342006062526


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?