Optimal scheduling for UET/UET-UCT generalized n-dimensional grid task graphs

DOI10.1006/JPDC.1999.1530MaRDI QIDQ1291010zbMATH OpenOpenAlexFDO

Authors Theodore Andronikos, Nectarios Koziris, George Papakonstantinou, Panayiotis Tsanakas

Publication date 6 October 1999

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

Full work available at URL https://doi.org/10.1006/jpdc.1999.1530

zbMATH Keywords

griddata flow in parallel computation

Mathematics Subject Classification ID

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

Recommendations

• Optimal schedules for d-D grid graphs with communication delays
• Scheduling UET-UCT series-parallel graphs on two processors
• UET scheduling with unit interprocessor communication delays
• scientific article; zbMATH DE number 784432
• Scheduling UET Trees with Communication Delays on two Processors

Cited in

(4)

• The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
• On parallelization of UET/UET-UCT loops
• scientific article; zbMATH DE number 5630154 (Why is no real title available?)
• A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays

This page was built for publication: Optimal scheduling for UET/UET-UCT generalized \(n\)-dimensional grid task graphs

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