Summary: I/O-Algorithms
Lars Arge
Aarhus University
April 16, 2008
Lars Arge
I/O-algorithms
2
I/O-Model
· Parameters
N = # elements in problem instance
B = # elements that fits in disk block
M = # elements that fits in main memory
T = # output size in searching problem
· We often assume that M>B2
· I/O: Movement of block between memory
and disk
D
P
M
Block I/O

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

Collections: Computer Technologies and Information Sciences