Optimal parallel execution of complete binary trees and grids into most popular interconnection networks

DOI10.1016/0304-3975(94)00267-MzbMath0873.68156MaRDI QIDQ672453

Evripidis Bampis, Jean-Claude Konig, Denis Trystram

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

PRAM modelparallel distributed-memory computers

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)

Related Items (2)

Some models for scheduling parallel programs with communication delays ⋮ Minimizing the overhead for some tree-scheduling problems

Cites Work

• A Communication-Time Tradeoff
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal parallel execution of complete binary trees and grids into most popular interconnection networks