The complexity of preemptive scheduling given interprocessor communication delays

Authors:
V. J. Rayward-Smith
Affiliations:
-
Venue:
Information Processing Letters
Year:
1987

Citing 0
Cited 3

Models of machines and computation for mapping in multicomputers

ACM Computing Surveys (CSUR)
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Scheduling on parallel machines with preemption and transportation delays

Computers and Operations Research

Quantified Score

Hi-index	0.90

Visualization

Abstract