Journal article
Models and algorithms for coscheduling compute-intensive taks on a network of workstations
Journal of parallel and distributed computing, Vol.16(4), pp.319-327
1992
DOI: 10.1016/0743-7315(92)90015-F
Abstract
The problem of using the idle cycles of a number of high performance workstations, interconnected by a high speed network, for solving computationally intensive tasks is discussed. The classes of distributed applications examined require some form of synchronization among the subtasks, hence the need for coscheduling to guarantee that subtasks start at the same time and execute at the same pace on a group of workstations. A model of the system is presented that allows the definition of an objective function to be maximized. Then a quadratic time and linear space algorithm is derived for computing the optimal coschedule, for the given model and class of applications addressed.
Details
- Title: Subtitle
- Models and algorithms for coscheduling compute-intensive taks on a network of workstations
- Creators
- Mikhail J AtallahChristina Lock BlackDan C MarinescuHoward Jay Siegel - Parallel Processing Laboratory, School of Electrical Engineering, Purdue University, West Lafayette, Indiana 47907, USAThomas L Casavant - Parallel Processing Laboratory, Department of Electrical and Computer Engineering, University of Iowa, Iowa City, Iowa 52242, USA
- Resource Type
- Journal article
- Publication Details
- Journal of parallel and distributed computing, Vol.16(4), pp.319-327
- Publisher
- Elsevier Inc
- DOI
- 10.1016/0743-7315(92)90015-F
- ISSN
- 0743-7315
- eISSN
- 1096-0848
- Language
- English
- Date published
- 1992
- Academic Unit
- Roy J. Carver Department of Biomedical Engineering; Electrical and Computer Engineering
- Record Identifier
- 9984064214102771
Metrics
8 Record Views