Approximating schedules for dynamic process graphs efficiently

DOI10.1016/J.JDA.2004.04.007zbMATH Open1118.68584OpenAlexW2006732289MaRDI QIDQ876729FDOQ876729

Rüdiger Reischuk, Andreas Jakoby, Maciej Liśkiewicz

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.007

Recommendations

• scientific article; zbMATH DE number 2081021
• scientific article; zbMATH DE number 1696537
• scientific article; zbMATH DE number 42110
• Dynamic scheduling of parallel computations
• Scheduling tree dags on parallel architectures

zbMATH Keywords

overlapapproximationschedulingparallel processingdynamic process graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Cites Work

• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• Succinct representations of graphs
• A note on succinct representations of graphs
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Title not available (Why is that?)

Cited In (6)

• Process flexibility revisited: the graph expander and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
• Title not available (Why is that?)

This page was built for publication: Approximating schedules for dynamic process graphs efficiently

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