Deadline scheduling of multiprocessor tasks

DOI10.1016/0166-218X(95)00020-RzbMath0854.68005WikidataQ57387865 ScholiaQ57387865MaRDI QIDQ1917262

Dominique de Werra, Maciej Drozdowski, Jacek Błażewicz, Jan Weglarz

Publication date: 13 January 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

scheduling theory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling multiprocessor tasks -- An overview, On optimal stochastic jumps in multi server queue with impatient customers via stochastic control

Cites Work

• Scheduling independent two processor tasks on a uniform duo-processor system
• Preemptive scheduling of independent jobs with release times and deadlines on a hypercube
• The complexity of scheduling independent two-processor tasks on dedicated processors
• The tabu search metaheuristic: How we used it
• Future paths for integer programming and links to artificial intelligence
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Complexity of Scheduling Parallel Task Systems
• Tabu Search—Part I