6 Disks 4
6 Disks 4
Thus:
disk accesses are more precious. they are expected to be more precious in future.
Hardware solutions
Will not be discussed.
Buffering
Keep cache of recently accessed pages in main memory
Goal: request for page can be satisfied from cache instead of disk Purge pages when cache is full
For example, use LRU algorithm Record clean/dirty state of page (clean pages dont have to be written)
Application
cache/buffer
Case 1:
The file is stored in 100 extents each of size 4 pages where each page is 8 sectors. Time to read the file= 100 x ( 9.1 + 4.17 + 32 x 0.21)=2 seconds
Case 2:
The file is stored in 3200 pages each of size one sector. Time to read the file = 3200 (9.1 + 4.17 + 0.21) = 43 seconds
6
Item transfer
Hardware Solutions
Arrange disks arrays: several disks that give abstraction of a single, large disk. Partition data into striping units and distribute them over several disks.
student file:
pages 1-10 pages 11-20 pages 21-30
Summary
Disks: cheap, non-volatile storage.
provides both sequential and random access. The cost for a random access depends on the location of page on disk; important to arrange data sequentially to minimize seek and rotation delays.
10