5. Assume a file system is using combined indexing scheme to keep track of the blocks allocated to a file, as in Linux/Unix file system. In the inode of a file, there are 12 direct pointers, one single-indirect pointer, one double-indirect pointer, and one triple-indirect pointer. Assume the size of a disk block address (i.e., disk pointer size) is 8 bytes. Assume block size is 4 KB. a) What is the maximum file size? b) How many index blocks are required for files of size 30 KB, 256KB, 15 MB, 512 MB, 32 GB?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
5. Assume a file system is using combined indexing scheme to keep track of the
blocks allocated to a file, as in Linux/Unix file system. In the inode of a file,
there are 12 direct pointers, one single-indirect pointer, one double-indirect
pointer, and one triple-indirect pointer. Assume the size of a disk block
address (i.e., disk pointer size) is 8 bytes. Assume block size is 4 KB.
a) What is the maximum file size?
b) How many index blocks are required for files of size 30 KB, 256KB,
15 MB, 512 MB, 32 GB?
c) Assume nothing is cached (no disk caching applied in the system)
and we know the disk location of the inode of a file of size 1 GB. How many
disk accesses are required to access a byte at offset 2^14 (16K) in the file? How
many disk accesses are required to access a byte at offset 2^26 in the file?
Transcribed Image Text:5. Assume a file system is using combined indexing scheme to keep track of the blocks allocated to a file, as in Linux/Unix file system. In the inode of a file, there are 12 direct pointers, one single-indirect pointer, one double-indirect pointer, and one triple-indirect pointer. Assume the size of a disk block address (i.e., disk pointer size) is 8 bytes. Assume block size is 4 KB. a) What is the maximum file size? b) How many index blocks are required for files of size 30 KB, 256KB, 15 MB, 512 MB, 32 GB? c) Assume nothing is cached (no disk caching applied in the system) and we know the disk location of the inode of a file of size 1 GB. How many disk accesses are required to access a byte at offset 2^14 (16K) in the file? How many disk accesses are required to access a byte at offset 2^26 in the file?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY