Performance considerations on a random graph model for parallel processing

DOI10.1051/ita/1993270403671zbMath0778.68017MaRDI QIDQ3142270

Foto N. Afrati, Andreas N. 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

task graph; parallel processing model; random directed acyclic graph

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68R10: Graph theory (including graph drawing) in computer science

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

Related Items

Comments on the analysis of parameters in a Random Graph Model

Cites Work

• Unnamed Item
• Random graph orders
• Limitations of concurrency in transaction processing