Optimal parallel scheduling for the 2-steps graph with constant task cost

DOI10.1016/0167-8191(92)90075-IzbMath0741.68021MaRDI QIDQ1186173

Mounir Marrakchi

Publication date: 28 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

triangular system2-steps precedence graphcritical path heuristic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Full factors, bicentralizer flow and approximately inner automorphisms

This page was built for publication: Optimal parallel scheduling for the 2-steps graph with constant task cost