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

DOI10.1016/0304-3975(94)00267-MzbMATH Open0873.68156MaRDI QIDQ672453FDOQ672453

Authors: Evripidis Bampis, Jean-Claude König, Denis Trystram 

Publication date: 28 February 1997

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

Recommendations

• Optimal schedules for d-D grid graphs with communication delays
• Scheduling tree dags on parallel architectures
• On the power of the linear array architecture for performing tree- structured computations

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Communication-Time Tradeoff
• Title not available (Why is that?)

Cited In (3)

• Some models for scheduling parallel programs with communication delays
• Minimizing the overhead for some tree-scheduling problems
• Title not available (Why is that?)

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

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