Improved scheduling in rings

DOI10.1016/J.JPDC.2007.02.002MaRDI QIDQ882145zbMATH OpenOpenAlexFDO

Authors Dekel Tsur

Publication date 23 May 2007

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2007.02.002

zbMATH Keywords

approximation algorithmsscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Approximation algorithms (68W25)

Recommendations

• Complexity and approximation results for scheduling multiprocessor tasks on a ring.
• The load distribution problem in a processor ring
• scientific article; zbMATH DE number 1759466
• An On-Line Algorithm for Some Uniform Processor Scheduling
• scientific article; zbMATH DE number 1003243

Cited in

(1)

• An empirical study of dynamic scheduling on rings of processors

This page was built for publication: Improved scheduling in rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q882145)