Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system

DOI10.1016/0167-8191(94)90110-4zbMath0799.68032OpenAlexW2105509427MaRDI QIDQ1315909

Jacek Błażewicz, Maciej Drozdowski, Günter Schmidt, Dominique de Werra

Publication date: 24 March 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(94)90110-4

zbMATH Keywords

complexity analysisdeterministic schedulingpreemptive scheduleuniform processorsmultiprocessor task systemspolynomial-in-time algorithmsscheduling on hypercube

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Scheduling multiprocessor tasks on parallel processors with limited availability., Scheduling chained multiprocessor tasks onto large multiprocessor system, Scheduling multiprocessor tasks -- An overview, Scheduling multiprocessor tasks with chain constraints, Linear and quadratic algorithms for scheduling chains and opposite chains