Are there advantages to high-dimension architectures?: Analysis of k-ary n-cubes for the class of parallel divide-and-conquer algorithms

Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers

Introduction to algorithms

Introduction to algorithms

Performance of multicomputer networks under Pin-out constraints

Journal of Parallel and Distributed Computing

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Communication complexity for parallel divide-and-conquer

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science

Query evaluation techniques for large databases

ACM Computing Surveys (CSUR)

Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms

Communication optimizations for irregular scientific computations on distributed memory architectures

Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures

Scalable load balancing strategies for parallel A* algorithms

Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures

Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search

IEEE Transactions on Parallel and Distributed Systems

Studies in Computational Science: Parallel Programming Paradigms

Studies in Computational Science: Parallel Programming Paradigms

Limits on Interconnection Network Performance

IEEE Transactions on Parallel and Distributed Systems

The Scalability of FFT on Parallel Computers

IEEE Transactions on Parallel and Distributed Systems

The Impact of Pipelined Channels on k-ary n-Cube Networks

IEEE Transactions on Parallel and Distributed Systems