×

Parallel algorithms for solution of problems in scheduling theory. (English. Russian original) Zbl 0802.68058

Autom. Remote Control 53, No. 5, Pt. 2, 710-717 (1992); translation from Avtom. Telemekh. 1992, No. 5, 97-106 (1992).
Summary: The article surveys the literature on parallel algorithms for solution of problems in scheduling theory. Attention is focused on algorithms of polylogarithmic time complexity on a polynomial number of parallel processors (problems of the class NC).

MSC:

68W15 Distributed algorithms
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
68-00 General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science
PDFBibTeX XMLCite