• 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...
    9 KB (1,031 words) - 02:22, 8 May 2024
  • Thumbnail for External sorting
    sorting algorithms are external memory algorithms and thus applicable in the external memory model of computation. External sorting algorithms generally...
    14 KB (2,149 words) - 07:23, 11 May 2024
  • cache's performance. It is different than the external memory model because cache-oblivious algorithms do not know the block size or the cache size. In...
    13 KB (1,843 words) - 05:14, 3 November 2024
  • term in computing, see auxiliary memory For the use of the term in computer science, see external memory algorithm This disambiguation page lists articles...
    327 bytes (80 words) - 16:16, 21 January 2019
  • Thumbnail for Parallel external memory
    external memory (PEM) model is a cache-aware, external-memory abstract machine. It is the parallel-computing analogy to the single-processor external...
    16 KB (1,961 words) - 08:49, 16 October 2023
  • The buddy memory allocation technique is a memory allocation algorithm that divides memory into partitions to try to satisfy a memory request as suitably...
    12 KB (1,459 words) - 22:39, 7 February 2024
  • accessing internal memory, the need for efficient traversal of external memory exists. For external memory algorithms the external memory model by Aggarwal...
    9 KB (1,558 words) - 19:55, 12 October 2024
  • computing tasks. External space: space needed on a disk or other external memory device; this could be for temporary storage while the algorithm is being carried...
    27 KB (3,324 words) - 22:37, 15 September 2024
  • Thumbnail for Sorting algorithm
    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...
    68 KB (6,408 words) - 17:30, 26 September 2024
  • Euclidean algorithm extended k-d tree extendible hashing external index external memory algorithm external memory data structure external merge external merge...
    35 KB (3,137 words) - 09:36, 21 October 2024
  • Thumbnail for Memory management
    memory is ever "lost" (i.e. that there are no "memory leaks"). The specific dynamic memory allocation algorithm implemented can impact performance significantly...
    26 KB (3,002 words) - 10:28, 3 November 2024
  • also referred to as binary merges. The k-way merge is also an external sorting algorithm. A 2-way merge, or a binary merge, has been studied extensively...
    16 KB (2,409 words) - 01:39, 8 November 2024
  • when free memory is separated into small blocks and is interspersed by allocated memory. It is a weakness of certain storage allocation algorithms, when they...
    20 KB (2,701 words) - 18:13, 11 October 2024
  • Thumbnail for Bailey's FFT algorithm
    factors" in between. The algorithm got its name after an article by David H. Bailey, FFTs in external or hierarchical memory, published in 1989. In this...
    5 KB (633 words) - 08:12, 18 November 2024
  • Funnelsort (category External memory algorithms)
    in the context of the cache oblivious model. In the external memory model, the number of memory transfers it needs to perform a sort of N {\displaystyle...
    8 KB (1,427 words) - 03:39, 31 July 2024
  • Cache-oblivious distribution sort (category External memory algorithms)
    to fit in a cache where operations are done. In the external memory model, the number of memory transfers it needs to perform a sort of N {\displaystyle...
    6 KB (958 words) - 18:35, 1 November 2023
  • Thumbnail for Binary search
    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...
    74 KB (9,632 words) - 17:33, 10 October 2024
  • heavy hitters using external memory. Cormode, Graham (2014). "Misra-Gries Summaries". In Kao, Ming-Yang (ed.). Encyclopedia of Algorithms. Springer US. pp...
    8 KB (992 words) - 10:52, 29 July 2024
  • Best, worst and average case (category Analysis of algorithms)
    combination of tolerances and external conditions. The term best-case performance is used in computer science to describe an algorithm's behavior under optimal...
    13 KB (1,273 words) - 21:09, 3 March 2024
  • Thumbnail for Merge sort
    Merge sort (category Divide-and-conquer algorithms)
    merge-sort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative...
    49 KB (6,727 words) - 03:39, 13 November 2024
  • Thumbnail for Genetic algorithm
    genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA)....
    68 KB (8,044 words) - 01:32, 3 November 2024
  • SLOB (redirect from SLOB memory allocator)
    suffers greatly from external fragmentation. SLOB currently uses a first-fit algorithm, which uses the first available space for memory. In 2008, a reply...
    2 KB (239 words) - 04:20, 9 October 2024
  • Thumbnail for Algorithmic art
    Algorithmic art or algorithm art is art, mostly visual art, in which the design is generated by an algorithm. Algorithmic artists are sometimes called...
    23 KB (2,481 words) - 10:11, 17 September 2024
  • numbers of intermediate values being spilled to memory and then restored. The Sethi–Ullman algorithm (also known as Sethi–Ullman numbering) produces code...
    6 KB (789 words) - 19:57, 12 October 2024
  • Thumbnail for Quicksort
    Quicksort (redirect from External quicksort)
    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...
    71 KB (9,935 words) - 04:49, 14 November 2024
  • is in contrast to algorithms that are compute-bound, where the number of elementary computation steps is the deciding factor. Memory and computation boundaries...
    9 KB (1,189 words) - 18:54, 5 August 2024
  • Parallel RAM (category Analysis of parallel algorithms)
    PRAM algorithms Flynn's taxonomy Lock-free and wait-free algorithms Random-access machine Parallel programming model XMTC Parallel external memory (Model)...
    11 KB (1,275 words) - 08:57, 12 August 2024
  • The Cooley–Tukey algorithm, named after J. W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete...
    36 KB (5,397 words) - 03:21, 31 July 2024
  • algorithm for data anomaly detection using binary trees. It was developed by Fei Tony Liu in 2008. It has a linear time complexity and a low memory use...
    31 KB (3,852 words) - 19:39, 21 November 2024
  • Thumbnail for Clique problem
    in very large graphs" (PDF), in Abello, J.; Vitter, J. (eds.), External Memory Algorithms, DIMACS Series on Discrete Mathematics and Theoretical Computer...
    84 KB (9,905 words) - 17:15, 23 September 2024