Performance considerations on a random graph model for parallel processing

DOI10.1051/ITA/1993270403671MaRDI QIDQ3142270zbMATH OpenOpenAlexFDO

Authors Foto N. Afrati, Andreas Stafylopatis

Publication date 15 November 1993

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92457

zbMATH Keywords

parallel processing modelrandom directed acyclic graphtask graph

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Speed of parallel processing for random task graphs
• Average execution times of series-parallel networks
• Optimal parallel processing of random task graphs
• Performance analysis of parallel programs based on directed acyclic graphs
• Parallel execution of schedules with random dependency graph

Cites work

• scientific article; zbMATH DE number 3986679 (Why is no real title available?)
• Limitations of concurrency in transaction processing
• Random graph orders

Cited in

(3)

• Speed of parallel processing for random task graphs
• Comments on the analysis of parameters in a Random Graph Model
• scientific article; zbMATH DE number 969979 (Why is no real title available?)

This page was built for publication: Performance considerations on a random graph model for parallel processing

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