Answer 1
a) Without Indirect Block, File size
= Number of Direct Block * Block Size
= 10*8 KB
= 80 KB
b) Count of Block Numbers which can be stored in a indirect block
= Block Size / Block Number Size
= 8 KB / 4 B
= 2048
c) An indirect Block can contain 2048 block numbers, so total data which an indirect block is pointing to
= 2048*Block Size
= 2048*8 KB
= 16 MB
d) Without double Indirect Block, File size
= Number of Direct Block * Block Size + Number of Block entries in Indirect Block * Block Size
= 10*8 + 2048*8 KB
= 16464 KB
e) A double indirect Block can contain 2048 indirect block entries and each block in 2048 blocks can contain 2048 direct block entries., so total data which an double indirect block is pointing to
= 2048*2048*Block Size
= 2048*2048*8 KB
= 33,554,432 KB
= 32 GB
f) Maximum Size of file
= 80 KB + 16464 KB + 33,554,432 KB
= 33,570,976 KB
Answer 2
Block Size = 8 KB = 8192 Bytes means
0th block will have 0 - 8191 Bytes
1st block will have 8192 - 16383 Bytes and so on
a) 0 => Logical Block Number = 0 and offset = 0
b) 8188
=> Block number = 8188/8192 = 0
=> offset = 8188%8192 = 8188
c) 8192
=> Block number = 8192/8192 = 1
=> offset = 8192%8192 = 0
d) 10000
=> Block number = 10000/8192 = 1
=> offset = 10000%8192 = 1,808
e) 20000
=> Block number = 20000/8192 = 2
=> offset = 20000%8192 = 3,616
Assume an FFS-style file system with an 8 KB block size, 4 byte block numbers, and...
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...
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,...
Computer Science Operation System question. I will give thumb
up, thank you!
Consider a file system that uses inodes to represent
files. This file system has 16 direct disk blocks, as well as
single, double, and triple indirect disk blocks. This file system
is illustrated in the below figure. Please notice that the tables
pointed to by the indirect pointers are full sized blocks that only
stores pointers.
mode owners (2) timestamps (3) size block count data data data direct...
Memory Sizing NOTE: K (kilo) means 1024, not 1000. A byte (B) is 8 bits. A kilobyte (KB) is therefore 8 x 1024 = 8192 bits. a) A 32 KB (kilobytes) memory has a 16 bit wordsize. How many words total can be stored in this memory? _________words b) A 256 KB memory has a 32 bit wordsize. How many bits are required to address this memory? _________ bits c) A computer memory has a 128 bit wordsize. It is made up...
Consider a file system that uses inodes to represent files. Disk blocks are 4-KB in size and a pointer to a disk block requires 4 bytes. This file system has 12 direct disk blocks, plus two single indirect disk blocks. What is the maximum size of a file that can be stored in this file system? A single indirect disk block points to a block where its whole space is used to point to data blocks. Please explain it as...
Part B
Consider a file system that uses a structure similar to an i-node with the following differences. If the file size is less than 100 bytes, the data is stored directly in the i-node. If it is larger, there are 8 direct links (point to a data block), 2 single-indirect links, 1-double indirect links and 1 triple indirect link. What is the largest file size that can be indexed in this system? Assume the block size is 1024 bytes....
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...