Scribd
Upload
25 views5 pages

External Memory Alorithm

External memory algorithms are designed to process data that is too large to fit in a computer's main memory at once. They must efficiently fetch and access data stored in slow bulk memory like hard drives. The external memory model analyzes such algorithms, modeling a cache between the processor and unbounded external memory. Both are divided into blocks, and algorithm efficiency is measured by the number of input/output operations to transfer blocks between memories.

Uploaded by

Harsh Sojitra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views5 pages

External Memory Alorithm

External memory algorithms are designed to process data that is too large to fit in a computer's main memory at once. They must efficiently fetch and access data stored in slow bulk memory like hard drives. The external memory model analyzes such algorithms, modeling a cache between the processor and unbounded external memory. Both are divided into blocks, and algorithm efficiency is measured by the number of input/output operations to transfer blocks between memories.

Uploaded by

Harsh Sojitra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

External memory algorithm

Prepared by:
Harsh Sojitra(18pgce017)
What is External memory algorithm?

 In computing, external memory algorithms or out-


of-core algorithms are algorithms that are designed
to process data that is too large to fit into a
computer's main memory at one time. 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. External memory
algorithms are analyzed in the external memory
model.
Model

 The cache on the left


holds M/B blocks of
size B each, for a total
of M objects. The
external memory on
the right is
unbounded.
Model
 External memory algorithms are analyzed in an idealized model of computation
called the external memory model (or I/O model, or disk access model).
The external memory model is an abstract machine similar to the RAM
machine model, but with a cache in addition to main memory. The model
captures the fact that read and write operations are much faster in a cache than
in main memory, and that reading long contiguous blocks is faster than reading
randomly using a disk read-and-write head. The running time of an algorithm
in the external memory model is defined by the number of reads and writes to
memory required. The model was introduced by Alok Aggarwal and Jeffrey
Vitter in 1988. The external memory model is related to the cache-oblivious
model, but algorithms in the external memory model may know both the block
size and the cache size. For this reason, the model is sometimes referred to as
the cache-aware model.
 The model consists of a processor with an internal memory or cache of size M,
connected to an unbounded external memory. Both the internal and external
memory are divided into blocks of size B. One input/output or memory transfer
operation consists of moving a block of B contiguous elements from external to
internal memory, and the running time of an algorithm is determined by the
number of these input/output operations.
Thank you!

You might also like