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 these questions:
If we are currently at logical block 5 (the last block accessed was blocked 4) and want to access logical block 15, how many physical blocks must be read from the disk?
If we are currently at logical block 5 (the last block accessed was block 4) and want to access logical block 15, the number of physical blocks must be read from the disk are given as follows:
Contiguous
Divide the given logical address by 512. E and F represents the quotient and the remainder respectively.
Assume Y to be the starting address of the file.
Add E to Y to get the physical block number.
The displacement into the block is represented by F.
So, if the logical block is 5, the number of blocks as per the contiguous method, the readable blocks are 1.
Linked
Divide the given logical address by 511. E and F represents the quotient and the remainder respectively.
So, for chasing the linked list, the number of blocks obtained are A+1.
In this the number of displacements would be B+1.
So, if the logical block is 5, the number of blocks as per the linked method, the readable blocks are 15.
Indexed
Divide the given logical address by 512. E and F represents the quotient and the remainder respectively.
To get the indexed block into the memory, the address of the physical block is there in the index block which is at the location of A.
The displacement here is B.
So, if the logical block is 5, the number of blocks as per the indexed method, the readable blocks are 7.5
Consider a file system on a disk that has both logical and physical block sizes of...
1 Mark Question Two Consider a file system on a disk that has both logical and physical block sizes of 512 tebytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these at 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...
Suppose that a file requires 20 blocks to be stored in disk. For each of the following allocation strategies( contiguous, linked, indexed), determine the number of disk block we need to read to bring in block 7 into memory after reading the file’s directory header?
Operating System Problem Three file allocation techniques for storing a file on disk, namely contiguous allocation, linked allocation, and indexed allocation. For each allocation method show how a file of 10 blocks would be allocated on disk. Note that the disk is represented as 30 blocks with blocks 0, 5, 6, 15, 25 already allocated. Note you must show the entire data structure for each allocation method as part of the answer. Thanks
How many disk accesses are needed to bring byte 4090 of a file into memory when the file is stored using double indirect indexed allocation? Assume that only the file's FCB is in memory, block pointers require 32 bits, and that blocks hold 1024 bytes each. How many disk accesses are needed to bring byte 4090 of a file into memory when the file is stored using double indirect indexed allocation? Assume that only the file's FCB is in memory,...
We know that there are different disk allocation methods that help the operating system decide how disk blocks are allocated for files. In the contiguous disk allocation method, each file occupies a set of consecutive addresses on the disk. While this makes file allocation easier, an increase in the file size means that it has to be assigned elsewhere on the disk. The linked disk allocation method requires including a pointer in the current file, which points to the location...
How many disk accesses are needed to bring byte i of a file into memory when the file is stored using contiguous allocation? Assume only the file’s FCB is in memory , block pointers require 32 bits , and that blocks hold 4096 bytes each. 3 accesses 1 + [ i/4096] accesses [i/4096 accesses 2 accesses 1 access
How many disk accesses are needed to bring byte i of a file into memory when the file is stored using contiguous allocation? Assume only the file’s FCB is in memory , block pointers require 32 bits , and that blocks hold 4096 bytes each. 3 accesses 1 + [ i/4096] accesses [i/4096 accesses 2 accesses 1 access
Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk is formatted blocks 0 is occupied for system-related information. The system always allocated free blocks starting st the lowest numbered block, and it uses non-contiguous allocation. Question 6 (2, 4) Consider an empty 1 Gbyte disk with the block size of 4096 bytes. When the disk is formatted blocks 0 is occupied for system-related information. The system always allocates free blocks starting at the...
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at /dir1/dir2/fle3 ? Assume that none of the disk blocks is currently being cached Total number of disk operations:
Consider a file system similar to the one used by UNIX (indexed allocation). How many disk operations are required to access the contents of a file at dir1/dir2/file3 ? Assume that none of the disk blocks is currently being cached. Total number of disk operations: