- Applied mathematics
- >
- Theoretical computer science
- >
- Algorithms
- >
- External memory algorithms

- Fields of mathematics
- >
- Applied mathematics
- >
- Algorithms
- >
- External memory algorithms

- Fields of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- External memory algorithms

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Algorithms
- >
- External memory algorithms

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 for a setting where the number of elements to

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 main memory at once. Such algorithms mus

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 fit into the main memory of a computing device

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.

External memory graph traversal

External memory graph traversal is a type of graph traversal optimized for accessing externally stored memory.

Funnelsort

Funnelsort is a comparison-based sorting algorithm. It is similar to mergesort, but it is a cache-oblivious algorithm, designed for a setting where the number of elements to sort is too large to fit i

© 2023 Useful Links.