A comparison of sorting algorithms for the connection machine CM-2

No abstract is available for this paper.

• Publication year

  1991

• Venue

  ACM Symposium on Parallelism in Algorithms and Architectures

• Publication date

  1991-06-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/113379.113380
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters

  1992cited by this paper
• Supporting the hypercube programming model on mesh architectures: (a fast sorter for iWarp tori)

  1992cited by this paper
• Implementations of randomized sorting on large parallel machines

  1992cited by this paper
• Sorting with Linear Speedup on a Pipelined Hypercube

  1992cited by this paper
• An improved supercomputer sorting benchmark

  1992cited by this paper
• Radix sort for vector multiprocessors

  1991cited by this paper
• Practical sorting algorithms for hypercube computers

  1991cited by this paper
• A (fairly) simple circuit that (usually) sorts

  1990cited by this paper
• A Guided Tour of Chernoff Bounds

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

  1990cited by this paper
• Vector Models for Data-Parallel Computing

  1990cited by this paper
• Efficient computation on sparse interconnection networks

  1989cited by this paper
• Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge

  1989cited by this paper
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

  1989cited by this paper
• Binsorting on hypercubes with d-port communication

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

  1988cited by this paper
• Parallel merge sort

  1988cited by this paper
• Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

  1986cited by this paper
• Combining Parallel and Sequential Sorting on a Boolean n–cube

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

  1984cited by this paper
• Parallel Sorting Algorithms

  1984cited by this paper
• Sorting in c log n parallel sets

  1983cited by this paper
• Sorting inc logn parallel steps

  1983cited by this paper
• Parallel sorting and data partitioning by sampling

  1983influential reference
• Parallel permutation and sorting algorithms and a new generalized connection network

  1982cited by this paper
• A logarithmic time sort for linear size networks

  1982cited by this paper
• Optimal Sorting Algorithms for Parallel Computers

  1978cited by this paper
• Fast probabilistic algorithms for hamiltonian circuits and matchings

  1977cited by this paper
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

  1970cited by this paper
• Sorting networks and their applications

  1968cited by this paper
• On the Distribution of the Number of Successes in Independent Trials

  1964cited by this paper

• A Novel Diagnostic Measurement of Structural Faults in Multiprocessor Systems: Based on Component Quantity Analysis

  2026cites this paper
• Parallel Scan on Ascend AI Accelerators

  2025cites this paper
• Parallel Integer Sort: Theory and Practice

  2024cites this paper
• Compilation of Modular and General Sparse Workspaces

  2024cites this paper
• Data-centric workloads with MPI_Sort

  2024cites this paper
• On Higher-performance Sparse Tensor Transposition

  2023cites this paper
• Efficient Algorithms for Parallel Bi-core Decomposition

  2023cites this paper
• Comparison and proof of the fastest way of the sorting algorithm by functional programming in Erlang

  2022cites this paper
• Systematic review and exploration of new avenues for sorting algorithm

  2021cites this paper
• Origami: A High-Performance Mergesort Framework

  2021cites this paper
• Parallel In-Place Algorithms: Theory and Practice

  2021cites this paper
• Range partitioning within sublinear time: Algorithms and lower bounds

  2021cites this paper
• Bonsai: High-Performance Adaptive Merge Tree Sorting

  2020cites this paper
• Range Partitioning Within Sublinear Time in the External Memory Model

  2020cites this paper
• Sparse Tensor Transpositions

  2020cites this paper
• DASH: Distributed Data Structures and Parallel Algorithms in a Global Address Space

  2020cites this paper
• FPGA-Accelerated Samplesort for Large Data Sets

  2020cites this paper
• Engineering In-place (Shared-memory) Sorting Algorithms

  2020cites this paper
• Efficient Parallel Random Sampling – Vectorized, Cache-Efficient, and Online

  2019cites this paper
• Kmerind: A Flexible Parallel Library for K-mer Indexing of Biological Sequences on Distributed Memory Systems

  2019cites this paper
• Theoretically-Efficient and Practical Parallel In-Place Radix Sorting

  2019cites this paper
• MLν: A Distributed Real-Time Modal Logic

  2019cites this paper
• Engineering Algorithms for Scalability through Continuous Validation of Performance Expectations

  2019cites this paper
• Engineering a Distributed Histogram Sort

  2019cites this paper
• Engineering faster sorters for small sets of items

  2019cites this paper
• Implementation and performance of Barnes-hut n-body algorithm on extreme-scale heterogeneous many-core architectures

  2019cites this paper
• Distributed String Sorting Algorithms

  2019cites this paper
• On the E(cid:14)cient Implementation of Massively Parallel Quicksort

  2019cites this paper
• Histogram Sort with Sampling

  2018cites this paper
• Energy-efficient hybrid coherence protocol for multicore processors

  2018cites this paper
• Flexible all‐to‐all data redistribution methods for grid‐based particle codes

  2018cites this paper
• Towards the Design of Efficient and Consistent Index Structure with Minimal Write Activities for Non-Volatile Memory

  2018cites this paper
• Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools

  2018cites this paper
• A study of integer sorting on multicores

  2018influential citation
• An Study in Overview and Analysis of Remote Synchronization Algorithms

  2018cites this paper
• Minsky, Chomsky and Deep Nets

  2018cites this paper
• Survey of GPU Based Sorting Algorithms

  2018cites this paper
• An Overview and Analysis External Equal Sorting algorithm

  2018cites this paper
• Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort

  2017cites this paper
• In-place Parallel Super Scalar Samplesort (IPSSSSo)

  2017cites this paper
• Integer sorting on multicores: some (experiments and) observations

  2017influential citation
• Sorting with GPUs: A Survey

  2017cites this paper
• Massively Parallel ’ Schizophrenic ’ Quicksort

  2017cites this paper
• Trusted Performance Analysis on Systems With a Shared Memory

  2017cites this paper
• Portable and productive high-performance computing

  2017cites this paper
• Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort

  2017cites this paper
• Reprint of "A parallel connectivity algorithm for de Bruijn graphs in metagenomic applications"

  2017cites this paper
• Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online

  2016cites this paper
• GPU-Accelerated Large-Scale Distributed Sorting Coping with Device Memory Capacity

  2016cites this paper
• Robust Massively Parallel Sorting

  2016cites this paper
• An Adaptive Parallel Algorithm for Computing Connectivity

  2016cites this paper
• Performance engineering of multicore software: developing a science of fast code for the post-Moore era

  2016cites this paper
• Parallel algorithms for scheduling data-graph computations

  2016cites this paper
• Using parallelism techniques to improve sequential and multi-core sorting performance

  2016cites this paper
• prediction Modeling for Design Space Exploration in Optical Network on Chip

  2016cites this paper
• Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling

  2016cites this paper
• Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online

  2016cites this paper
• Sorting with Asymmetric Read and Write Costs

  2015influential citation
• Cache-Oblivious Iterated Predecessor Queries via Range Coalescing

  2015cites this paper
• Parallel distributed memory construction of suffix and longest common prefix arrays

  2015cites this paper
• Analysis and Testing of Sorting Algorithms on a Standard Dataset

  2015cites this paper
• Recognition of activities of daily living in healthy subjects using two ad-hoc classifiers

  2015cites this paper
• Reduced-Complexity k-best Decoder for LTE Standard

  2015cites this paper
• A parallel connectivity algorithm for de Bruijn graphs in metagenomic applications

  2015cites this paper
• Extending the BSP model for multi-core and out-of-core computing: MBSP

  2015cites this paper
• Autotuning programs with algorithmic choice

  2014cites this paper
• Engineering Parallel String Sorting

  2014cites this paper
• Executing dynamic data-graph computations deterministically using chromatic scheduling

  2014cites this paper
• Comparison sorting on hybrid multicore architectures for fixed and variable length keys

  2014cites this paper
• A Comparative Study on Different Types of Sorting Algorithms (On the Basis of C and Java)

  2014cites this paper
• BSP Sorting: An experimental Study

  2014cites this paper
• Symbolic Resource Bound Inference for Functional Programs

  2014cites this paper
• Large-scale distributed sorting for GPU-based heterogeneous supercomputers

  2014cites this paper
• Practical Massively Parallel Sorting - Basic Algorithmic Ideas

  2014cites this paper
• On preprocessing large data sets by the use of triple merge sort algorithm

  2014cites this paper
• Teaching Parallel Programming for Time-Efficient Computer Applications

  2014cites this paper
• Bitonic sort on a chained-cubic tree interconnection network

  2014cites this paper
• Hybrid Multicore Algorithms for Some Semi-Numerical Applications and Graphs

  2014cites this paper
• A Web-Based Non-Intrusive Ambient System to Measure and Classify Activities of Daily Living

  2014influential citation
• Practical Massively Parallel Sorting

  2014cites this paper
• Java 7's Dual-Pivot Quicksort

  2014cites this paper
• Designing Scalable Out-of-core Sorting with Hybrid MPI+PGAS Programming Models

  2014cites this paper
• Using Traditional Data Analysis Algorithms to Detect Access Patterns for Big Data Processing

  2013cites this paper
• A Scalable Work-Efficient and Depth-Optimal Parallel Scan for the GPGPU Environment

  2013cites this paper
• D S ] 6 M ay 2 01 3 Parallel String Sample Sort

  2013cites this paper
• Parallel Sorting on the Heterogeneous AMD Fusion Accelerated Processing Unit

  2013cites this paper
• HykSort: a new variant of hypercube quicksort on distributed memory architectures

  2013cites this paper
• Parallel Radix Sort on the AMD Fusion Accelerated Processing Unit

  2013cites this paper
• Using Traditional Data Analysis Algorithms to Detect Access Patterns for Massive Data Processing

  2013cites this paper
• Algorithms for high-throughput disk-to-disk sorting

  2013influential citation
• Scheduling Local and Remote Memory in Cluster Computers

  2013cites this paper
• Modified Merge Sort Algorithm for Large Scale Data Sets

  2013cites this paper
• Optimal Network Topologies and Resource Mappings for Heterogeneous Networks-on-Chip

  2013cites this paper
• Parallel String Sample Sort

  2013cites this paper
• Non Linear Divisible Loads: There is No Free Lunch

  2013cites this paper
• Exploration of heuristic scheduling algorithms for 3D multicore processors

  2012cites this paper
• Hardware/Software Co-design for Multicore Architectures

  2012influential citation
• A Novel Parallel Approach of Radix Sort with Bucket Partition Preprocess

  2012cites this paper
• Balancing reducer skew in MapReduce workloads using progressive sampling

  2012cites this paper
• Studying the behavior of classical parallel algorithms with message passing

  2012cites this paper