CloudRAMSort: Fast and Efficient Large-Scale Distributed RAM Sort on Shared-Nothing Cluster

Summary: CloudRAMSort delivers fast large-scale in-memory sort on shared-nothing clusters by overlapping computation with inter-node communication. It uses dynamic multi-stage random sampling for load balancing, SIMD- and multi-core-aware execution, and provides an analytic model predicting performance within ~7%. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4608
Venue: SIGMOD
Year: 2012
Pagerank: 6.8718304e-05
Overall Rank: 3,655 | 74.58%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
404	Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited	2014	VLDB	0.00024143076
1,607	A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort	2014	SIGMOD	0.00011162682
2,526	Track Join: Distributed Joins with Minimal Network Traffic	2014	SIGMOD	8.5968612e-05
3,151	A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs	2017	SIGMOD	7.4720668e-05
4,042	PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort	2015	VLDB	6.5026989e-05
4,655	SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures	2015	VLDB	6.0221672e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
42	A Comparison of Approaches to Large-Scale Data Analysis	2009	SIGMOD	0.00073498298
145	Quickly Generating Billion-Record Synthetic Databases	1994	SIGMOD	0.0004138408
213	THE 5 MINUTE RULE FOR TRADING MEMORY FOR DISC ACCESSES and THE 10 BYTE RULE FOR TRADING MEMORY FOR CPU TIME	1987	SIGMOD	0.00033660051
236	High-Performance Sorting on Networks of Workstations	1997	SIGMOD	0.00031779642
305	SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units	2009	VLDB	0.00028248614
351	Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs	2009	VLDB	0.0002636504
381	FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs	2010	SIGMOD	0.00024873637
714	Adaptive Aggregation on Chip Multiprocessors	2007	VLDB	0.00017730584
883	Google Fusion Tables: Web-Centered Data Management and Collaboration	2010	SIGMOD	0.00015656548
930	Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort	2010	SIGMOD	0.00015238545
946	Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture	2008	VLDB	0.0001513324
6,174	Percentile Finding Algorithm for Multiple Sorted Runs	1989	VLDB	5.1696569e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
11,832	A Study of Sorting Algorithms on Approximate Memory	2016	SIGMOD	4.1945683e-05
585	Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems	2012	VLDB	0.00019706145
198	A Low Communication Sort Algorithm for a Parallel Database Machine	1989	VLDB	0.0003516098
4,655	SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures	2015	VLDB	6.0221672e-05
1,760	CellSort: High Performance Sorting on the Cell Processor	2007	VLDB	0.00010651836
930	Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort	2010	SIGMOD	0.00015238545
3,151	A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs	2017	SIGMOD	7.4720668e-05
946	Efficient Implementation of Sorting on Multi-Core SIMD CPU Architecture	2008	VLDB	0.0001513324
236	High-Performance Sorting on Networks of Workstations	1997	SIGMOD	0.00031779642
1,607	A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort	2014	SIGMOD	0.00011162682