Scheduling task-trees with additive scales on parallel/distributed machines

DOI10.1016/S0304-3975(96)00280-0zbMath0901.68083MaRDI QIDQ1391320

Xiang-Dong Yu, Mordechai M. Yung

Publication date: 22 July 1998

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

zbMATH Keywords

divide-and-conquer algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding of Grids into Optimal Hypercubes
• Cost Trade-offs in Graph Embeddings, with Applications
• A Communication-Time Tradeoff
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Work-preserving emulations of fixed-connection networks
• Online load balancing and network flow

This page was built for publication: Scheduling task-trees with additive scales on parallel/distributed machines