Algorithms for high-throughput disk-to-disk sorting

No abstract is available for this paper.

• Publication year

  2013

• Venue

  2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC)

• Publication date

  2013-11-17

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1145/2503210.2503259
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• HykSort: a new variant of hypercube quicksort on distributed memory architectures

  2013cited by this paper
• ExaScale high performance computing in the square kilometer array

  2012cited by this paper
• CloudRAMSort: fast and efficient large-scale distributed RAM sort on shared-nothing cluster

  2012influential reference
• The case for RAMCloud

  2011cited by this paper
• TritonSort: A Balanced Large-Scale Sorting System

  2011cited by this paper
• From Microprocessors to Nanostores: Rethinking Data-Centric Systems

  2011cited by this paper
• Highly scalable parallel sorting

  2010influential reference
• Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort

  2010cited by this paper
• Lessons Learned in Deploying the World’s Largest Scale Lustre File System

  2010cited by this paper
• Fast Sort on CPUs , GPUs and Intel MIC Architectures

  2010cited by this paper
• Hadoop: The Definitive Guide

  2009cited by this paper
• A massively parallel adaptive fast-multipole method on heterogeneous architectures

  2009cited by this paper
• GPU sample sort

  2009cited by this paper
• Community cleverness required

  2008influential reference
• MapReduce: simplified data processing on large clusters

  2008cited by this paper
• Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel

  2008cited by this paper
• International Conference on Parallel Processing A COMPARISON BASED PARALLEL SORTING ALGORITHM *

  2006cited by this paper
• Lustre: Building a File System for 1,000-node Clusters

  2003cited by this paper
• The Google file system

  2003cited by this paper
• Zipf 's law and the effect of ranking on probability distributions

  1996influential reference
• Introduction to Parallel Computing

  1994cited by this paper
• Sorting-Based Selection Algorithms for Hypercubic Networks

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

  1991influential reference

• FT-iSort: Efficient Fault Tolerance for Introsort

  2019cites this paper
• Efficient parallel streaming algorithms for large-scale inverse problems

  2017cites this paper
• SDS-Sort: Scalable Dynamic Skew-aware Parallel Sorting

  2016cites this paper
• I/O chunking and latency hiding approach for out-of-core sorting acceleration using GPU and flash NVM

  2016cites this paper
• Efficient disk-to-disk sorting: a case study in the decoupled execution paradigm

  2015cites this paper
• High performance OpenSHMEM for Xeon Phi clusters: Extensions, runtime designs and application co-design

  2014cites this paper
• Designing High Performance and Scalable Unified Communication Runtime (UCR) for HPC and Big Data Middleware

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

  2014cites this paper