Models and algorithms for coscheduling compute-intensive taks on a network of workstations

Mikhail J. Atallah, Christina Lock Black, Dan C. Marinescu, Howard Jay Siegel, Thomas L. Casavant
1992 Journal of Parallel and Distributed Computing  
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
more » ... ive function to be maximized. Then a quadratic time and linear space algorithm is derived for computing the optima1 coschedule, for the given model and class of applications addressed. o Iwz Academic PKX. IN.
doi:10.1016/0743-7315(92)90015-f fatcat:3mdotvskzfgbdah4brx7j363iq