On Graham's bound for cyclic scheduling

DOI10.1016/S0167-8191(00)00033-8zbMath0945.68012OpenAlexW1965934994MaRDI QIDQ1575599

Philippe Chrétienne

Publication date: 21 August 2000

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00033-8

zbMATH Keywords

approximation algorithmperformance ratiocyclic scheduling

Mathematics Subject Classification ID

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

Related Items (4)

Tree scheduling with communication delays ⋮ Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods ⋮ Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times ⋮ Handling flexibility in a ``generalised job shop with a fuzzy approach

This page was built for publication: On Graham's bound for cyclic scheduling