Live briefing
Everything about Parallel external memory
In computer science, a parallel external memory (PEM) model is a cache-aware, external-memory abstract machine. It is the parallel-computing analogy to the single-processor external memory (EM) model. In a similar way, it is the cache-aware analogy to the parallel random-access machine (PRAM). The PEM model consists of a number of processors, together with their respective private caches and a shared main memory. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Parallel external memoryA 5-minute orientation
- Skim a recent paper: Memory-Aware External Facelist Calculation: A Data-Parallel Atomic Hash Counting ApproachInfluential work since 2022
- Pick up a classic book: Upgrading and repairing PCsThe most-reprinted book on the subject
- Read the landmark paper: Bulk Synchronous Parallel Algorithms for the External Memory ModelCited 13 times
- Go sideways: Merge sortA closely related topic
- Go sideways: External memory algorithmA closely related topic
🏆 Landmark papers (most cited)
Bulk Synchronous Parallel Algorithms for the External Memory Model
Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash
PnP: sequential, external memory, and parallel iceberg cube computation
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms
Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search
Computational geometry in the parallel external memory model
Influence of External Memory Characteristics of Supercomputer Complexes on Parallel Programs Execution
On Parallel External-Memory Bidirectional Search (Extended Abstract)
🆕 Influential since 2022
📚 Books worth reading
Upgrading and repairing PCsScott Mueller, Mark Edward Soper · 1988
Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
MacsPaul McFedries · 2008
Treaty Occupationay ToxicologySuelen Queiroz · 2010
Practical Electronics for InventorsPaul Scherz · 2000
Fundamentals of data structures in CEllis Horowitz · 1993
SystemVerilog for VerificationChris Spear · 2006
Experimental AlgorithmsVincenzo Bonifaci · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Merge sort Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations…
- External memory algorithm In computing, external memory algorithms or out-of-core algorithms are algorithms that are designed to process data that are too large to fit into a computer's…
- Parallel RAM In computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM is intended…
- Samplesort Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting…
- Cache-oblivious distribution sort The cache-oblivious distribution sort is a comparison-based sorting algorithm. It is similar to quicksort, but it is a cache-oblivious algorithm, designed…
- Radix sort In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according…
- Matrix multiplication algorithm Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…