Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is al ready in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these questions: a. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.) b. If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk

Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is al ready in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these questions: a. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.) b. If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).
Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in size, and a pointer to a disk block requires 8 bytes. This file system has 12 direct disk blocks, as well as 1 single and 1 double indirect disk blocks. What is the maximum size of a file that can be stored in this file system in GBs (round to the nearest integer)?
Suppose that you have a very simple file system (VSFS) using i-node to manage disk data blocks, where the disk block size is 4096 bytes. Disk addresses and file block pointers take 32 bits (4 bytes), and the i-node contains 10 direct pointers, one single-indirect pointer and one double-indirect pointer. Assume an index block is the same size as a data block (both 4096 Bytes). If there is a file having 45,000 bytes of data and it has never been accessed, we only assume the file's i-node is in memory, but none of the rest of the file. If the user process wants to read the entire file into the memory, how many disk blocks (including both data blocks and index block(s)) would be brought into the main memory? O a. 11 O b. 10 O C. 12 O d. 1035 e. 1034
Suppose that a block is 1K Byte and that a disk address is 4 bytes. Suppose that files are implemented using i-nodes, and that an i-node has the following structure: the last address in the inode is a third-level indirect block; the second-to-last address is a second-level indirect block; the third-to-last address is an indirect block; and the remaining addresses are data blocks. Approximately how large a file can this system support?
Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer the following question: If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk?
Suppose that you have a UNIX file system where the disk block size is 4096 bytes. Disk addresses and file block pointers take 32 bits (4 bytes), and the i-node contains 12 direct pointers, one single-indirect pointer and one double-indirect pointer. Assume an index block is the same size as a data block (both 4096 Bytes). If there is a file having 50,000 bytes of data and it is never been accessed, we only assume the file's i-node is in memory, but none of the rest of the file. If the user process wants to access to read the entire file into the memory, how many I/O operations would be needed? O a. 15 O b. 12 O c. 14 O d. 13
Suppose that there is a file system with blocks of 512 bytes in size. For each inode, there are 20 direct blocks, 2 singly-indirect blocks, and 2 doubly-indirect blocks. The size of a pointer is 4 bytes. Calculate the maximum possible size of a file in bytes. Show your work.
Consider a file system that uses contiguous allocation method. For a disk consists of 100 data blocks, each block is 4KB. What is the maximum and minimum number of files of size 15KB can it save? Find the number of files the disk able to support using (1) link allocation and (2) index allocation, assuming the address is 32 bit.
Consider a file system that uses inodes to represent files. Disk blocks are 16 KB in size, and a pointer to a disk block requires 4 bytes. This file system has 12 direct disk blocks, as well as single, double, and triple indirect disk blocks. What is the maximum size of a file that can be stored in this file system? Show calculation steps
Consider a file system that uses indexed file allocation. Disk block size is 1K-byte, and a file pointer is 64 bits (8-bytes). If we assume that an i-node just holds 2 direct entries and 4 single indirect entries, what is the maximum size of a file the system can allow? List the steps that lead to your conclusion.
Suppose that we have a magnetic disk with the following structure: Each sector is fixed at 512 bytes, and each cluster consists of 4 sectors. Given that a file has reserved 2 clusters with a slack space of 1024 bytes . a- How many sectors will the file will require? b- What will be the physical size of the file? c- What will be the logical size of the file?
Suppose a Unix Inode has 10 direct disk block pointers, one single indirect block pointer, one double indirect block pointer, and one triple indirect block pointer. For convenience, each index table has 256 = 28 entries and each block has 1K = 210 bytes. What is the maximum size of a Unix file in Kbytes?