Scheduling loosely connected task graphs.

DOI10.1016/S0022-0000(03)00071-0zbMath1054.68021OpenAlexW2088332251MaRDI QIDQ1401986

Abhiram G. Ranade

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00071-0

zbMATH Keywords

Approximation algorithmPrecedence-constrained scheduling

Mathematics Subject Classification ID

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

Cites Work

• Optimal scheduling for two-processor systems
• Complexity of Scheduling under Precedence Constraints
• Worst Case Analysis of Two Scheduling Algorithms
• A New Insight into the Coffman–Graham Algorithm
• Optimal Sequencing of Two Equivalent Processors

This page was built for publication: Scheduling loosely connected task graphs.