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

DOI10.1016/0304-3975(94)00267-MMaRDI QIDQ672453zbMATH OpenFDO

Authors Evripidis Bampis, Jean-Claude König, 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)

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

Cites work

• scientific article; zbMATH DE number 3958731 (Why is no real title available?)
• scientific article; zbMATH DE number 4064466 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 278827 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A Communication-Time Tradeoff

Cited in

(3)

• Some models for scheduling parallel programs with communication delays
• Minimizing the overhead for some tree-scheduling problems
• scientific article; zbMATH DE number 3976322 (Why is no real title available?)

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)