Logo image
Co-scheduling compute-intensive tasks on a network of workstations: model and algorithms
Conference proceeding

Co-scheduling compute-intensive tasks on a network of workstations: model and algorithms

Mikhail J Atallah, Christina Lock, Dan C Marinescu, Howard Jay Siegel and Thomas L Casavant
[1991] Proceedings. 11th International Conference on Distributed Computing Systems, pp.344-352
Conference on Distributed Computing Systems, 11 (Arlington, Texas, 05/20/1991–05/24/1991)
1991
DOI: 10.1109/ICDCS.1991.148687

View Online

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 sub-tasks, hence the need for coscheduling to guarantee that sub-tasks start at the same time and execute at the same pace on a group of workstations. A model of the system that allows the definition of an objective function to be maximized is presented. Then a quadratic time and linear space algorithm is derived for computing the optimal coscheduling.< >
High Performance Computing Parallel Processing Computer networks Concurrent computing High-speed networks Intelligent networks Laboratories Processor scheduling Resource management Workstations

Details

Metrics

Logo image