✦ LIBER ✦

Sorting in a Memory Hierarchy with Flash Memory

✍ Scribed by Goetz Graefe

Book ID: 107690259
Publisher: Springer-Verlag
Year: 2011
Weight: 437 KB
Volume: 11
Category: Article
ISSN: 1618-2162
DOI: 10.1007/s13222-011-0062-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large-Scale Sorting in Uniform Memory Hi

Large-Scale Sorting in Uniform Memory Hierarchies

✍ J.S. Vitter; M.H. Nodine 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

We present several efficient algorithms for sorting on the uniform memory hierarchy (UMH), introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and nearly optimal algorithms for a wide range of bandwidth degradations, including a parsimonious algorithm for constant

Sorting algorithms with minimum memory

✍ V. E. Alekseev 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 403 KB

Parallel Sorting with Serial Memories

✍ Owens, Robert Michael; Ja'Ja', Joseph 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 1004 KB

Sorting in a “matrix catalog” memory

✍ V. P. Gladun 📂 Article 📅 1966 🏛 Springer US 🌐 English ⚖ 480 KB

Noisy sort, a memory-intensive sorting a

Noisy sort, a memory-intensive sorting algorithm

✍ Susumu Horiguchi; Williard L. Miranker 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Introduction to flash memory

✍ Bez, R.; Camerlenghi, E.; Modelli, A.; Visconti, A. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 1004 KB