A Study of Sorting Algorithms on Approximate Memory
Summary: Study of sorting on hybrid precise/approximate memory; three sorts. Proposes approx-refine: offload to approximate storage, and refine to precise output; yields 95% sorted accuracy with up to 40% write-latency reduction and up to 11% mem-access-time savings. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Shuang Chen
- 2. Shunning Jiang
- 3. Bingsheng He
- 4. Xueyan Tang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next