Approximation algorithms for scheduling with a limited number of communications

DOI10.1016/S0167-8191(00)00032-6zbMath0945.68010OpenAlexW1974010678MaRDI QIDQ1575597

C. Lahlou

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)00032-6

zbMATH Keywords

multiprocessor schedulingprecedence constraintsworst-case analysiscommunication contentionbus machine

Mathematics Subject Classification ID

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

This page was built for publication: Approximation algorithms for scheduling with a limited number of communications