Back to Results
First PageMeta Content
Computing / Lustre / Merge sort / Sorting / Bucket sort / Algorithm / Computer data storage / Binning / Cache / Sorting algorithms / Order theory / Mathematics


Algorithms for High-Throughput Disk-to-Disk Sorting Hari Sundar
Add to Reading List

Document Date: 2013-10-24 07:48:16

Open Document

File Size: 829,19 KB

Share Result on Facebook

City

Denver / Sorting / New York / /

Company

O’Reilly Media Inc. / GPU / Facebook / Dell / Google / Mellanox / Lustre / Oak Ridge National Laboratory / SIAM Journal / Cray User Group / Intel / /

Country

United States / /

Currency

USD / /

/

Event

M&A / /

Facility

store N / Texas Advanced Computing Center / Sandy Bridge / High-Throughput Disk-to-Disk Sorting Hari Sundar Dhairya Malhotra Karl W. Schulz The University of Texas / Oak Ridge National Laboratory / The University of Texas / Square Kilometer Array / Oak Ridge Leadership Computing Facility / /

IndustryTerm

distributed file systems / performance computing / widow file systems / parallel algorithms / simplified data processing / scratch file systems / distributed memory sort algorithms / file systems / asynchronous out-of-core sorting algorithm / data-centric systems / software revisions / hypercubic networks / memory algorithms / parallel select algorithm / out-of-core sorting algorithm / software frameworks / intensive algorithms / user applications / big-data applications / sorting algorithms / real-world big-data applications / data-intensive scientific computing / raid devices / computing / overall algorithm / software architectures / distributed sorting algorithms / sort algorithm / out-of-core sort algorithm / asynchronous processing / individual raid devices / overlapped out-of-core algorithm / overall algorithms / storage hardware / large-scale data-processing needs / parallel selection algorithm / parallel file systems / runtime software revisions / parallel sorting algorithm / search indices / binary search / speed file systems / read / selection algorithms / sort / file system software / using sort group / /

MusicGroup

Titan / Spider / Stampede / /

OperatingSystem

Linux / GNU / POSIX / /

Organization

University of Texas at Austin / National Science Foundation / Texas Advanced Computing Center / /

Person

A. Vahdat / M. Conley / Judith Hill / Addison Wesley / H. Madhyastha / G. Porter / A. Pucher / A. Nguyen / V / R. Mysore / N. Leischner / V / Object Storage / Hari Sundar Dhairya Malhotra Karl / Karl W. Schulz / /

/

Position

author / coordinator / Porter / /

Product

RAM / Titan system / Jaguar XT4 / Titan / /

ProgrammingLanguage

C++ / /

ProvinceOrState

New York / Texas / /

PublishedMedium

The Definitive Guide / Communications of the ACM / International Journal of Theoretical Physics / the Spider / /

Technology

RAM / overall algorithm / Linux / API / distributed memory algorithms / shared memory / overall algorithms / sort algorithm / in-RAM sort algorithm / 6200 series processor / parallel sorting algorithm / genomics / Sorting-based selection algorithms / parallel selection algorithm / in-RAM sorting algorithm / parallel select algorithm / TCP/IP / 3.1 Experimental Environment The algorithms / Parallel algorithms / relevant distributed sorting algorithms / distributed memory sort algorithms / load balancing / sorting algorithm / caching / Parallel Processing / /

URL

http /

SocialTag