suppose a file system stores every file under a i-node similar to (but may not be the same as) the Unix V7 File System. The i-node contains 15 addresses, each address has 32 bits (4 bytes).
If an i-node contains 12 direct addresses, 1 single-indirect address, 1 double-indirect address, and 1 triple-indirect address. Suppose every disk block is 4KB. What is the largest file size, in GB, that the file system can store? Round your answer to the nearest integer.
(Note: 1GB = 1024MB; 1MB = 1024KB; 1KB = 1024 bytes)
Continuing from above. Sam is a sound engineer and requires random accesses to large numbers of audio files ranging from 4MB to 16MB in size. You are designing a variation of the file system with different numbers of single, double and triple indirect addresses to minimize Sam's random file access time, while using the same block size and supporting at least the same largest file size. You would --
In both cases above, try to make the change amount minimal. For example, if increasing the number of a particular type of addresses by N could minimize the access time, then don't increase it by N+1.
Continuing from above. Using 4KB block size but potentially any number of direct, single-indirect, double-indirect, and triple-indirect addresses (as long as the total is 15) per i-node, what is the largest possible file size, in GB, that the file system can support? Round your answer to the nearest integer.
(Note: 1GB = 1024MB; 1MB = 1024KB; 1KB = 1024 bytes)