A double indirect block contains pointers to single indirect blocks. A single indirect block contains pointers to data blocks.
Each block holds 1024 bytes. Block pointers are 32 bits.
Block pointers per block = (1024 * 8) / 32 = 256
It means one single indirect block will contain pointers for 256 blocks.
One double indirect block will contain pointers for 256 single indirect blocks.
It means first entry in double indirect index will point to first 256 data blocks of file.
1st data block of file - byte 0 to 1023
2nd data block of file - byte 1024 to 2047
3rd data block of file - byte 2048 to 3071
4th data block of file - byte 3072 to 4095 (This block will contain byte 4090. This block needs to be accessed.)
1st access will be for double indirect index block.
2nd access will be for single indirect index block. Now we already know that we have to access 4th data block of file. So we will directly access that block, whose pointer is stored in single indirect index block.
3rd access will be for the data block containing data byte 4090.
Hence total 3 disk access are needed.
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 po...
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
A UNIX-type file-system uses a disk block size of 1KB, 128 byte inodes, and 32 bit disk addresses. If the inode contains 64 bytes of data, 8 direct, 1 indirect, 1 double-indirect, and 1 triple- indirect blocks, apart from other file information. How many disk blocks would be required for storing files of sizes (a) 1 byte (b) 1024 bytes (c) 64 KB (d) 1MB ?
Really don't know what its about... Course in operating system, file system Question 2. File Systems (10 marks) (a) Consider a 32GB hard disk and a FAT file system with 24 bits cluster (block) address. What is the minimum block (cluster) size in order to fully utilize all space in the hard disk? (3 marks) (b) Consider an index-based file system with the inode containing 64 direct pointers, 1 indirect pointer, and 1 double-indirect pointer. Suppose the size of a...
Assume you have: 32-bit addresses, 4KB Page size, 4MB Physical Memory Space, 4KB Cache with 4-way set associative and LRU replacement, 32 Byte Cache block size, 4-entry fully associative TLB. A program to be run on this machine begins as follows: double A[1024]; int i, j; double sum = 0; for( i = 0; i < 1024; i++ ) // first loop A[i] = i; for( j = 0; j < 1024; j += 16 ) // second loop ...
Question 12 Consider a magnetic disk drive with 10 double sided platters, 512(=2^9) tracks per surface, and 1024 (=2^10) sectors per track. Sector size is 2KBytes (=2^10 Bytes ). Assume the average seek time 0.02 ms, the seek time from a track to its adjacent track can be ignored. The drive rotates at 5400 rpm. Successive tracks in a cylinder can be read without head movement. Furthermore, disks can be handled independently, so multiple tracks in a cylinder can be...