Scheduling For Distributed Computing

Authors:
Sartaj Sahni;George Vairaktarakis
Affiliations:
-;-
Venue:
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
Year:
1997

Citing 0
Cited 1

A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A typical model for distributed computing is to have a main program thread that runs on one processor. This thread spawns a number of tasks from time-to-time. When tasks are spawned, they are sent to other processors for completion and the main thread waits till the results of all tasks are received from the remote processors. This is the typical fork-join paradigm. This paradigm results in an interesting scheduling problem that is studied in this paper. Several heuristics are proposed for various variants of this scheduling problem.