DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS

DOI10.1080/01495730108935273zbMath0981.68017OpenAlexW2050164062MaRDI QIDQ2755580

Avi Mendelson, Neeraj Suri

Publication date: 11 November 2001

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495730108935273

zbMATH Keywords

VLSIunion graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Cites Work

• A framework for solving VLSI graph layout problems
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Fast parallel algorithms for short-range molecular dynamics
• An asymptotically optimal layout for the shuffle-exchange graph
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Computational Structure of the N-Body Problem
• A Fault-Tolerant Communication Architecture for Distributed Systems
• Parallel Processing with the Perfect Shuffle
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS