- #1
hyouhaku
- 2
- 0
Homework Statement
Big-Oh Run-Time Calculations
The OS File Manager manages files and the directory structure. Two common disk
formatting methods exist: disks formatted in blocks using an inode and the classical bytedriven
semi-contiguous file using pointers after each contiguous portion. In either case
the File Allocation Tables were basically similar. The inode will be a simple direct
pointer inode (without the multilevel nodes). Assume the blocks are 4K large and
pointers are 32 bits long.
For this question discuss the:
· Best-case, and
· Worst-case
run-times for both the blocked disk access method and semi-contiguous file access
method.
In other words assume the worst-case situation for how a file might exist on disk in the
semi-contiguous and block files methods. Then compute using Big-Oh notation the
performance of loading such a file entirely into memory. Do this again for the best-case
situation.
Finally discuss and compare your findings. Which is better, in what case and why?
2. The attempt at a solution
I read though the whole textbook and can't find what is the so called classical byte driven semi contiguous file. And what makes it different from blocks...
Thank you so much!