Optimal All-to-All Personalized Exchange in Self-Routable Multistage Networks

No abstract is available for this paper.

• Publication year

  2000

• Venue

  IEEE Trans. Parallel Distributed Syst.

• Publication date

  2000-03-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/71.841742
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Interconnection Networks: An Engineering Approach

  2002cited by this paper
• Efficient all-to-all broadcast in all-port mesh and torus networks

  1999cited by this paper
• All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes

  1998cited by this paper
• Efficient all-to-all personalized exchange in multidimensional torus networks

  1998cited by this paper
• Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach

  1997cited by this paper
• Tree-based multicasting on wormhole routed multistage interconnection networks

  1997cited by this paper
• Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures

  1997cited by this paper
• Interconnection Networks

  1997cited by this paper
• All-to-All Personalized Communication in a Wormhole-Routed Torus

  1996cited by this paper
• A class of interconnection networks for multicasting

  1996cited by this paper
• Efficient broadcast and multicast on multistage interconnection networks using multiport encoding

  1996cited by this paper
• Issues in Designing Eecient and Practical Algorithms for Collective Communication on Wormhole-routed Systems

  1995cited by this paper
• All-to-all communication on meshes with wormhole routing

  1994cited by this paper
• Optimal software multicast in wormhole-routed multistage networks

  1994cited by this paper
• Efficient All-to-All Communication Patterns in Hypercube and Mesh Topologies

  1991cited by this paper
• Nonblocking Broadcast Switching Networks

  1991cited by this paper
• Data communication in parallel architectures

  1989cited by this paper
• Optimum Broadcasting and Personalized Communication in Hypercubes

  1989cited by this paper
• Book review: Computer Architecture and Organization, 2nd ed. by John P. Hayes (McGraw Hill, 1988)

  1988cited by this paper
• Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures

  1987cited by this paper
• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms

  1984cited by this paper
• A Self-Routing Benes Network and Parallel Permutation Algorithms

  1981cited by this paper
• On a Class of Multistage Interconnection Networks

  1980cited by this paper
• Introductory Combinatorics

  1977cited by this paper
• Banyan networks for partitioning multiprocessor systems

  1973cited by this paper
• Banyan networks for partitioning multiprocessor systems

  1973cited by this paper
• Heuristic remarks and mathematical problems regarding the theory of connecting systems

  1962influential reference
• A study of non-blocking switching networks

  1953cited by this paper

• MixGCN: Scalable GCN Training by Mixture of Parallelism and Mixture of Accelerators

  2025cites this paper
• Realizing Optimal All-to-All Personalized Communication Using Butterfly-Based Networks

  2023cites this paper
• All-to-All Personalized Communication on Fat-Trees Using Latin Squares

  2022cites this paper
• Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networks

  2021cites this paper
• Network simulation of a 40 MHz event building system for the LHCb experiment

  2020cites this paper
• Optimal all-to-all personalized communication on Butterfly networks through a reduced Latin square

  2020cites this paper
• Optimal Schedule for All-to-All Personalized Communication in Multiprocessor Systems

  2019cites this paper
• Unified theory on preservation of conditionally non-blocking switches by the two-stage interconnection network

  2018cites this paper
• VA-DE: Valuable ATAPE with dynamic embedding and super-pipeline scheduling on partitionable multistage interconnection

  2017cites this paper
• RCube: A Power Efficient and Highly Available Network for Data Centers

  2017cites this paper
• Efficient Route Optimization using Distance Matrices for Generation of Latin Square

  2017cites this paper
• An improved firefly algorithm for permutation routing in baseline multistage interconnection network

  2017cites this paper
• Embedding the optimal all-to-all personalized exchange on multistage interconnection networks+

  2016influential citation
• An all-to-all broadcasting protocol using directional antennas in multi-hop wireless networks

  2015cites this paper
• Augmenting data center networks with a fast reconfigurable optical multistage interconnect

  2014influential citation
• Optimal All-to-All Personalized Exchange by Regularly Changing Switch States in Packet Switched Synchronous Self-Routable Multistage Networks

  2013influential citation
• Switch adjusting on hierarchical shuffle-exchange networks for all-to-all personalized exchange

  2013influential citation
• Contention-Free Many-to-Many Communication Scheduling for High Performance Clusters

  2011influential citation
• All-to-All

  2011cites this paper
• All-to-all personalized exchange in generalized shuffle-exchange networks

  2010influential citation
• All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks

  2009influential citation
• Optimal All-to-All Personalized Exchange in General Shuffle-Exchange Networks

  2007influential citation
• Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks

  2007influential citation
• A universal performance factor for multi-criteria evaluation of multistage interconnection networks

  2006cites this paper
• Routing permutations on baseline networks with node-disjoint paths

  2005cites this paper
• Optimal all-to-all personalised exchange in a novel optical multistage interconnection network

  2005cites this paper
• Theory on Switch Preservation under 2-stage Interconnection

  2005cites this paper
• A class of multistage conference switching networks for group communication

  2004cites this paper
• Routing permutations on optical baseline networks with node-disjoint paths

  2004cites this paper
• On evil-twin routing in Clos networks

  2004influential citation
• Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects

  2003cites this paper
• An optical multistage interconnection network for optimal all-to-all personalized exchange

  2003cites this paper
• Contention-Aware Communication Schedule for High-Speed Communication

  2003cites this paper
• All-to-all Personalized Communication on Multistage Interconnection Networks

  2003influential citation
• The Hierarchical Factor Algorithm for All-to-All Communication (Research Note)

  2002cites this paper
• A class of multistage conference switching networks for group communication

  2002cites this paper
• Pipelined All-to-All Broadcast in All-Port Meshes and Tori

  2001cites this paper
• A new conference network for group communication

  2001cites this paper
• Performance studies of high-speed communication on commodity cluster

  2001cites this paper
• Near-optimal all-to-all broadcast in multidimensional all-port meshes and tori

  2001cites this paper
• Scheduling of Complete Exchange on Clusters

  2000cites this paper
• Optimal all-to-all personalized exchange in a class of optical multistage networks

  2000influential citation