Suppose a UNIX filesystem has i-nodes that each contain 12 direct block pointers

Question

Suppose a UNIX filesystem has i-nodes that each contain 12 direct block pointers, 9 single-indirect pointers, 3 double-indirect pointers, and 1 triple-indirect pointers. Assume that each 64-bit...

Suppose the UNIX file system has i-nodes that each contain 12 direct block pointers, 9 single-indirect pointers, 3 double-indirect pointers, and 1 triple-indirect pointers Assume that each 64-bit pointer references an 4 KB 12 Bytes) block containing file data or addresses. Further, assume that nodes, pointer blocks, data blocks, and sectors are all the same size. (a) How many disk-block-pointers can each pointer block accommodate? (b) (4 points) complete the table below for the modified system. Show your working in the space below to receive partial credit Level Number of Data blocks Number of Data Bytes (2n) Direct blocks Single-indirect blocks Double-indirect blocks Triple indirect blocks (c) What is the maximum file size supported?

Explanation / Answer

2. For 12 direct entries = (29)*12 = 6144

For 9 single = (29)2*9 = 218*9=2359296

      For 3 double = (29)3 *3 = 227*3=402653184

For 1 triple = (29)4= 236=68719476736

     Total pointer is :69124495360

3. Size of the disk is : total of pointer*size of the pointer

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.