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 (auxiliary memory) such as hard drives or tape drives, or when memory is on a computer network.[1][2] External memory algorithms are analyzed in the external memory model.
^Vitter, J. S. (2001). "External Memory Algorithms and Data Structures: Dealing with MASSIVE DATA". ACM Computing Surveys. 33 (2): 209–271. CiteSeerX 10.1.1.42.7064. doi:10.1145/384192.384193. S2CID 2155038.
^Vitter, J. S. (2008). Algorithms and Data Structures for External Memory(PDF). Series on Foundations and Trends in Theoretical Computer Science. Vol. 2. Hanover, MA: Now Publishers. pp. 305–474. CiteSeerX 10.1.1.140.3731. doi:10.1561/0400000014. ISBN 978-1-60198-106-6. {{cite book}}: |journal= ignored (help)
and 19 Related for: External memory algorithm information
In computing, externalmemoryalgorithms or out-of-core algorithms are algorithms that are designed to process data that are too large to fit into a computer's...
sorting algorithms are externalmemoryalgorithms and thus applicable in the externalmemory model of computation. External sorting algorithms generally...
term in computing, see auxiliary memory For the use of the term in computer science, see externalmemoryalgorithm This disambiguation page lists articles...
externalmemory (PEM) model is a cache-aware, external-memory abstract machine. It is the parallel-computing analogy to the single-processor external...
accessing internal memory, the need for efficient traversal of externalmemory exists. For externalmemoryalgorithms the externalmemory model by Aggarwal...
The buddy memory allocation technique is a memory allocation algorithm that divides memory into partitions to try to satisfy a memory request as suitably...
technique for overcoming the memory-size problem is using external sorting, for example one of the ways is to combine two algorithms in a way that takes advantage...
computing tasks. External space: space needed on a disk or other externalmemory device; this could be for temporary storage while the algorithm is being carried...
half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary...
memory is ever "lost" (i.e. that there are no "memory leaks"). The specific dynamic memory allocation algorithm implemented can impact performance significantly...
suffers greatly from external fragmentation. SLOB currently uses a first-fit algorithm, which uses the first available space for memory. In 2008, a reply...
genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA)....
mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative...
in the context of the cache oblivious model. In the externalmemory model, the number of memory transfers it needs to perform a sort of N {\displaystyle...
buffered in externalmemory, which can lead to increased cache contention that counters some of the numerical advantage. Both algorithms gain approximately...
trees. The algorithm has a linear time complexity and a low memory requirement, which works well with high-volume data. In essence, the algorithm relies upon...
sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961. It is still a commonly used algorithm for...
Global Information