A Malleable-Job System for Timeshared Parallel Machines

Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of such jobs is that a job scheduler for malleable jobs can provide improved system utilization and average response time ov...

Full description

Saved in:
Bibliographic Details
Published inCluster Computing and the Grid (CCGrid 2002): 2nd IEEE International Symposium p. 230
Main Authors Kale, L.V., Kumar, S., DeSouza, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Adaptive scheduling
Computer science
Delay
Monitoring
Parallel machines
Processor scheduling
Runtime
Throughput
Time factors
Workstations
Online AccessGet full text
ISBN9780769515823
0769515827
DOI10.1109/CCGRID.2002.1017131

Cover

More Information
Summary:Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of such jobs is that a job scheduler for malleable jobs can provide improved system utilization and average response time over a scheduler for traditional jobs. In this paper, we present a programming system for creating malleable jobs that is more general than other current malleable systems. In particular, it is not limited to the master-worker paradigm or the Fortran SPMD programming model, but can also support general purpose parallel programs including those written in MPI and Charm++, and has built-in migration and load-balancing, among other features.
ISBN:9780769515823
0769515827
DOI:10.1109/CCGRID.2002.1017131