A malleable-job system for timeshared parallel machines

Laxmikant V. Kale, Sameer Kumar, Jayant Desouza

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2002
PublisherIEEE Computer Society
Pages230-237
Number of pages8
ISBN (Print)0769515827, 9780769515823
DOIs
StatePublished - 2002
Event2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2002 - Berlin, Germany
Duration: May 21 2002May 24 2002

Publication series

Name2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2002

Other

Other2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2002
CountryGermany
CityBerlin
Period5/21/025/24/02

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A malleable-job system for timeshared parallel machines'. Together they form a unique fingerprint.

Cite this