Performance of critical path type algorithms for scheduling on parallel processors
From MaRDI portal
Publication:5949904
DOI10.1016/S0167-6377(01)00077-3zbMath0980.68015MaRDI QIDQ5949904
Publication date: 5 December 2001
Published in: Operations Research Letters (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Scheduling with precedence constraints: Worst-case analysis of priority algorithms, Scheduling UET-UCT outforests to minimize maximum lateness
Cites Work
- Unnamed Item
- UET scheduling with unit interprocessor communication delays
- NP-complete scheduling problems
- Optimal scheduling for two-processor systems
- Concurrent Task Systems
- 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