Models and Algorithms for Coscheduling Compute-Intensive Tasks on a Network of Workstations
Mikhail J. Atallah, Christina Lock Black, Dan Cristian Marinescu, Howard Jay Siegel, Thomas L. Casavant · Purdue e-Pubs (Purdue University System) · 1992
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 Borne form of synchronization among the sub-tasks, hence the need for co-scheduling 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 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 co-schedule, given the model and the elaBS of problems addressed.