Log In
0 votes
Consider a system where free space is kept in a free-space list.
a. Suppose that the pointer to the free-space list is lost. Can the
system reconstruct the free-space list? Explain your answer.
b. Consider a file system similar to the one used by UNIX with
indexed allocation. How many disk I/O operations might be
required to read the contents of a small local file at /a/b/c?
Assume that none of the disk blocks is currently being cached.
c. Suggest a scheme to ensure that the pointer is never lost as a result
of memory failure.
in Operating System 86 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
Fragmentation on a storage device can be eliminated by recompaction of the information. Typical disk devices do not have relocation or base registers (such as those used when memory is to be compacted), so how can we relocate files? Give three reasons why recompacting and relocation of files are often avoided.
asked Mar 22, 2019 in Operating System ajaysoni1924 69 views
0 votes
0 answers
Discuss how performance optimizations for file systems might result in difficulties in maintaining the consistency of the systems in the event of computer crashes
asked Mar 22, 2019 in Operating System ajaysoni1924 19 views
0 votes
0 answers
Some file systems allow disk storage to be allocated at different levels of granularity. For instance, a file system could allocate 4 KB of disk space as a single 4-KB block or as eight 512-byte blocks. How could we take advantage of this flexibility to improve performance? What modifications would have to be made to the free-space management scheme in order to support this feature?
asked Mar 22, 2019 in Operating System ajaysoni1924 22 views
0 votes
0 answers
What are the advantages of the variant of linked allocation that uses a FAT to chain together the blocks of a file?
asked Mar 22, 2019 in Operating System ajaysoni1924 34 views