Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays

DOI10.1016/S0166-218X(99)00211-5zbMath0953.68021OpenAlexW2154319383MaRDI QIDQ1975378

Jacques Verriet

Publication date: 29 January 2001

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00211-5

zbMATH Keywords

inforestsoutforests

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays ⋮ Scheduling UET-UCT outforests to minimize maximum lateness

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• UET scheduling with unit interprocessor communication delays
• Scheduling UET-UCT series-parallel graphs on two processors
• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• The Complexity of Scheduling Trees with Communication Delays
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies