STABLE DISTRIBUTED SCHEDULING ALGORITHM.

Raymond M. Bryant, Raphael A. Finkel

Research output: Contribution to conferencePaperpeer-review

59 Scopus citations

Abstract

A new scheduling algorithm is described for a multicomputer connected in a point-to-point fashion. The algorithm is both distributed (every processor runs the same algorithm) and stable (collective load balancing decisions will not cause unnecessary overloading of a processor in the network). It is assumed that process execution times are not known in advance and that inter-processor transfer times are non-trivial. Load is balanced by migrating suitable jobs after they have been run long enough to obtain an estimate of their required service time. The algorithm is suitable for job scheduling in a distributed time-sharing system implemented on a multicomputer. Performance of the algorithm is investigated through simulation.

Original languageEnglish
Pages314-323
Number of pages10
StatePublished - 1981
EventProc - Int Conf on Distrib Comput Syst, 2nd - Paris, Fr
Duration: Apr 8 1981Apr 10 1981

Conference

ConferenceProc - Int Conf on Distrib Comput Syst, 2nd
CityParis, Fr
Period4/8/814/10/81

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'STABLE DISTRIBUTED SCHEDULING ALGORITHM.'. Together they form a unique fingerprint.

Cite this