Scheduling tree dags on parallel architectures

DOI10.1007/BF01961545zbMath0843.68010OpenAlexW2009081567MaRDI QIDQ1911467

Yanyan Li

Publication date: 13 August 1996

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

tree decompositionbounded degree forest dags

Mathematics Subject Classification ID

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

Related Items (1)

Scheduling tree dags on parallel architectures

Cites Work

• Unnamed Item
• Unnamed Item
• Communication complexity of PRAMs
• On the power of the linear array architecture for performing tree- structured computations
• Scheduling tree dags on parallel architectures
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• A Communication-Time Tradeoff

This page was built for publication: Scheduling tree dags on parallel architectures