Generalized Algorithm for Parallel Sorting on Product Networks

No abstract is available for this paper.

• Publication year

  1997

• Venue

  IEEE Trans. Parallel Distributed Syst.

• Publication date

  1997-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/71.640013
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• 1993 International Conference on Parallel Processing A GENERALIZED BITONIC SORTING NETWORK

  2006cited by this paper
• A Unified Approach to Algorithm Development forProduct Networks

  1997cited by this paper
• Efficient VLSI Layouts for Homogeneous Product Networks

  1997cited by this paper
• Work-preserving emulations of fixed-connection networks

  1997cited by this paper
• Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees

  1996influential reference
• A Multiway Merge Sorting Network

  1995influential reference
• Products of Networks with Logarithmic Diameter and Fixed Degree

  1995cited by this paper
• Homogeneous product networks for processor interconnection

  1994cited by this paper
• Folded Petersen cube networks: new competitors for the hypercubes

  1993cited by this paper
• A general framework for developing adaptive fault-tolerant routing algorithms

  1993cited by this paper
• Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies

  1992cited by this paper
• Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)

  1992cited by this paper
• A modulo merge sorting network

  1992influential reference
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• A comparison of sorting algorithms for the connection machine CM-2

  1991cited by this paper
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers

  1990cited by this paper
• On Bitonic Sorting Networks

  1990cited by this paper
• Constructing Sorting Networks from k-Sorters

  1989cited by this paper
• K-Way Bitonic Sort

  1989cited by this paper
• Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks

  1988cited by this paper
• Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers

  1987cited by this paper
• An optimal sorting algorithm for mesh connected computers

  1986cited by this paper
• Tight Bounds on the Complexity of Parallel Sorting

  1984cited by this paper
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees

  1983cited by this paper
• Bitonic Sort on a Mesh-Connected Parallel Computer

  1979cited by this paper
• The cube-connected-cycles: A versatile network for parallel computation

  1979cited by this paper
• Sorting on a mesh-connected parallel computer

  1976cited by this paper
• Improved Divide/Sort/Merge Sorting Networks

  1975cited by this paper
• An economical construction for sorting networks

  1974cited by this paper
• Parallel Processing with the Perfect Shuffle

  1971cited by this paper
• Sorting networks and their applications

  1968cited by this paper

• Resource placement in Cartesian product of networks

  2010cites this paper
• An Optimal Data Routing Scheme for Mesh Embedded Hypercube Interconnection Network with Multiple Faulty Nodes

  2009cites this paper
• Design and Analysis of a Backpressure Congestion Control Algorithm in Wireless Sensor Network

  2007cites this paper
• Distant-Based Resource Placement in Product Networks

  2007cites this paper
• Capturing an intruder in product networks

  2006cites this paper
• A generalized fault-tolerant sorting algorithm on a product network

  2005influential citation
• Constructing Edge-Disjoint Spanning Trees in Product Networks

  2003cites this paper
• Hypercube network fault tolerance: a probabilistic approach

  2002influential citation
• ADAPTATION OF MULTIWAY-MERGE SORTING ALGORITHM TO MIMD ARCHITECTURES WITH AN EXPERIMENTAL STUDY

  2002influential citation
• Overloaded array processing with spatially reduced search joint detection

  2001cites this paper
• PPS-a parallel partition sort algorithm for multiprocessor database systems

  2000cites this paper
• UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS

  2000cites this paper
• A Unified Approach to Algorithm Development forProduct Networks

  1997cites this paper
• Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees

  1996cites this paper