Live briefing
Everything about External memory algorithm
Algorithms for processing data too large to fit into a computer's main memory at once
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 main memory at once. Such algorithms must be optimized to efficiently fetch and access data stored in slow bulk memory such as hard drives or tape drives, or when memory is on a computer network. External memory algorithms are analyzed in the external memory model. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: External memory algorithmA 5-minute orientation
- Skim a recent paper: HSE-KTruss: A Hybrid Semi-External Algorithm for Memory-Budgeted Max-Truss ComputationInfluential work since 2022
- Pick up a classic book: C How to ProgramThe most-reprinted book on the subject
- Read the landmark paper: External memory algorithms and data structuresCited 409 times
- Go sideways: Cache-oblivious algorithmA closely related topic
- Go sideways: External sortingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
External memory algorithms and data structures
Algorithms and Data Structures for External Memory
Selective Search Area Reuse Algorithm for Low External Memory Access Motion Estimation
Lossless image compression algorithm and hardware architecture for bandwidth reduction of external memory
An External-Memory Algorithm for String Graph Construction
Engineering a Lightweight External Memory Suffix Array Construction Algorithm
An external-memory depth-first search algorithm for general grid graphs
External-memory depth-first search algorithm for solid grid graphs
🆕 Influential since 2022
📚 Books worth reading
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
Neural Information ProcessingTingwen Huang · 2012
Digital planetGeorge Beekman, Ben Beekman · 2011
An introduction to data structures with applicationsJean-Paul Tremblay, Paul Gordon Sorenson · 1976
Fundamentals of data structures in CEllis Horowitz · 1993
Practical Electronics for InventorsPaul Scherz · 2000
Data structures & algorithms in JavaRobert Lafore · 2003
Algorithm designMichael T. Goodrich, Roberto Tamassia · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Cache-oblivious algorithm In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having…
- External sorting External sorting is a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not…
- In-place matrix transposition In-place matrix transposition, also called in-situ matrix transposition, is the problem of transposing an N×M matrix in-place in computer memory, ideally…
- Algorithmic efficiency In computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm…
- Compressed suffix array In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data…
- 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…
- Oblivious data structure In computer science, an oblivious data structure is a data structure that gives no information about the sequence or pattern of the operations that have…
- Oblivious RAM An Oblivious RAM (ORAM) simulator is a compiler that transforms an algorithm in such a way that the resulting algorithm preserves the input-output behavior…