Scheduling UET Trees with Communication Delays on two Processors

DOI10.1051/RO:2000101zbMATH Open0961.90032OpenAlexW2015106054MaRDI QIDQ4497893FDOQ4497893

Authors: Frédéric Guinand, Denis Trystman 

Publication date: 24 August 2000

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2000__34_2_131_0/

Recommendations

• Scheduling trees with large communication delays on two identical processors
• Scheduling complete intrees on two uniform processors with communication delays
• Tree scheduling with communication delays
• UET scheduling with unit interprocessor communication delays
• The Complexity of Scheduling Trees with Communication Delays
• The complexity of scheduling problems with communication delays for trees
• Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
• Scheduling chains on uniform processors with communication delays
• scientific article; zbMATH DE number 2086776
• Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems

zbMATH Keywords

schedulingparallel processingcommunication delaysintreesUECT

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)

Cited In (3)

• Sensitivity bounds for machine scheduling with uncertain communication delays
• Tree scheduling with communication delays
• Parallel Machine Scheduling with Uncertain Communication Delays

This page was built for publication: Scheduling UET Trees with Communication Delays on two Processors

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