Scheduling tasks with communication delays on parallel processors

DOI10.1007/BF01111739zbMath0838.68010OpenAlexW2079953091MaRDI QIDQ1904382

Christian Chenier, Nejib Zaguia, Jorge Urrutia

Publication date: 27 May 1996

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01111739

zbMATH Keywords

treeparallel computationoptimal scheduling\(m\)-machine problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties ⋮ A very difficult scheduling problem with communication delays

Cites Work

• NP-complete scheduling problems
• Scheduling rooted forests with communication delays
• Optimal scheduling for two-processor systems
• Scheduling Interval-Ordered Tasks
• Scheduling Graphs on Two Processors

This page was built for publication: Scheduling tasks with communication delays on parallel processors