Performance analysis of parallel programs based on directed acyclic graphs

DOI10.1007/S002360050092MaRDI QIDQ1358615zbMATH OpenOpenAlexFDO

Authors Georg Trogemann, Matthias Gente

Publication date 3 July 1997

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360050092

zbMATH Keywords

task precedence graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 4187099
• Speed of parallel processing for random task graphs
• Publication:3201742
• Optimal parallel processing of random task graphs

Cited in

(4)

• scientific article; zbMATH DE number 1863258 (Why is no real title available?)
• Performance considerations on a random graph model for parallel processing
• scientific article; zbMATH DE number 969979 (Why is no real title available?)
• scientific article; zbMATH DE number 4178740 (Why is no real title available?)

This page was built for publication: Performance analysis of parallel programs based on directed acyclic graphs

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