A file system with 300 GByte uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. Find the maximum possible file size in this file system.

A file system with 300 GByte uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. Find the maximum possible file size in this file system.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 11P

See similar textbooks

Related questions

Q: Suppose that a 5 MB file consisting of 1 KB logical blocks is stored on a disk drive with the…

A: Average seek time , assuming the disk head starts at track 0 Rotation speed = 8000 rpm Number of…

Q: Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the…

A: Answer the above question are as follow

Q: Consider a Disk I/O transfer, in which 1500 bytes are to be transferred, but number of bytes on a…

A: Handwritten solution

Q: The disk has 200 tracks numbered from 0-199. The head pointer is currently positioned at 112 moving…

A: Here in this question we have given some disk request and we have asked to find total head movement…

Q: A post calculation strategy for a factory indicates a disk with 200 blocks. Assuming, that the file…

A: Given table contains 5 files, x1, x2, x3, x4 and x5. Each file have their length and starting…

Q: Consider a single-platter disk with the following parameters: rotation speed:7200 rpm; number of…

Q: Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume…

A: Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume…

Q: Suppose that a disk drive has 1,024 cylinders, numbered 0 to 1,023. The driver is currently serving…

A: We need to implement the mentioned algorithms on the given string.

Q: Consider a disk with an advertised average seek time of 6 ms, rotation speed of 7,200 rpm, and…

A: Given Data Consider a disk with an advertised average seek time of 6 ms, rotationspeed of 7,200…

Q: Consider a disk with a sector size of 512 bytes, 1,000 tracks per plater, 100 sectors per track, 10…

A: The size of a sector is 512 bytes. A plater has 1000 tracks. A track has 100 sectors. A cylinder has…

Q: Consider a UNIX-like file system implemented with i-nodes that resides on a disk of size 512GB. Each…

A: Introduction :Given ,A UNIX like file system,disk size = 512 GB .Number of blocks = 15 Block size =…

Q: Q1: If the specifications of a 729.3 MB disk drive are: Min. seek time = 6 msec, average seek time =…

Q: c) Suppose a disk has 300 cylinders, numbered from 0 to 299. The drive is currently serving an I/O…

A: (i) SSTF Total head movements- 10+24+10+75+10+18+3+18=168

Q: Consider a magnetic disk with 1000 cylinders rotating at a speed of 7200 revolutions per minute. The…

A: Given:- Total number of cylinders =1000 Number of Revolutions per minute = 7200 Sector size =1024…

Q: A FAT (file allocation table) based file system is being used and the total overhead of each entry…

A: Introduction:Given,Overhead of each entry = 4 BytesDisk Size = 100 x 106 BytesData block size = 103…

Q: Selects the disk I/O request that requires the least amount of travel from the current position of…

A: here in this problem given information is disk with tracks numbered from 0 to 255 and The disk arm…

Q: Consider a file system on a disk that has both logical and physical block sizes of 512 bytes.…

A: Let Z be the starting file address (block number). Contiguous-Divide the logical address by 512 with…

Q: 5) A hard disk (with sectors numbered 0 - 255) currently has its head positioned at sector 73. We…

A: Given that, The number of sectors are 256 from 0 to 255. Initial head position= 73 Queue of disk…

Q: Assume a file system with block size of 512 words. A process P1 reads a whole file F1 of length 8000…

A: Answer: Option d None of the above In Option a, process P1 and P2 reads 1 block. It is incorrect…

Q: In our discussion of the SSTF disk scheduling algorithm, we stated that the problem of starvation…

A: The Shortest Seek Time First (SSTF) is a disk-scheduling algorithm that operates with the concept of…

Q: A FAT (file allocation table) based file system is being used and the total overhead of each entry…

A: Summary In this question, values are given as follows: Block size is given as 1600 bytes, disk…

Q: We can use the following utility tool(s) to view the File System (e.g. NTFS) of a partition/volume:…

A: DOS is called a Disk Operating System its an operating system with non-graphical content, dos…

Q: Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per…

A: Introduction given , Disk pack, seek time = 4 ms Rotational speed = 10000 rpm Sectors per track…

Q: A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure…

A: Introduction Given, A disk of size 2 TB , multilevel inode structure. Disk block size is 512 B .…

Q: Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes…

A: Introduction. givena disk pack with no of surface=16tracks=128no of sector/track=256data…

Q: d minimu

A: It is given that the file system uses contiguous allocation and the disk consists of 100 data…

Q: Using a larger block size in a fixed block size file system leads to a) better disk throughput but…

A: Disk throughout : Number of blocks that can be fetched in one unit of time. Disk Space Utilization…

Q: Assume that each block has B = 1000 Bytes, and the buffer pool has m = 210 + 1 = 1001 frames. What…

A: According to the question, we have to find scale of the file according to the given criteria. The…

Q: Suppose that we have an ordered file with r = 30000 records stored on a disk with block size B =…

A: The Answer is in given below step

Q: Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a…

A: Given: Assume the head of a moving-head disc contains 200 tracks numbered 0 to 199, and it is now…

Q: a) The physical size of a given file is 16384 bytes in a magnetic disk, with each cluster consisting…

A: Solution: a) 1. How many sectors and clusters will the above file take? Number of sectors in one…

Q: For a file system I have chosen to use indexed allocation with 2 KB blocks. 512 bytes is reserved…

A: Given that, Block size= 2 KB Header size= 512 bytes The file contains one direct and one 2nd…

Q: For the following buffer pool, using the LRU replacement heuristic, show the disk block ID of the…

A: According to the information given:- We have to following buffer pool, using the LRU replacement…

Q: To improve performance when reading files, "block read ahead" can be performed. What is this? A.…

A: A) The operating system determines, when reading block K, if the file is being read sequentially. If…

Q: A processor sends 40 disks I/Os per second, these requests are exponent-distributed, and the average…

A: The Answer is

Q: Let us consider a file system which uses inodes to manage files on disk where each inode consists of…

A: Introduction :Given , A file system , file name = 4 Byte User Id= 2 Byte timestamp = 4 Byte…

Q: Let us assume a disk with rotational speed of 15,000 rpm, 512 bytes per sector, 400 sectors per…

A: a) Answer : T = transfer time = b/rN Where b = number of bytes to transfer r = rotation speed and N…

Q: Consider a Disk 1/O transfer, in which 1500 bytes are to be transferred, but number of bytes on a…

A: Given No.of bytes to be transferred (b)=1500 bytes Rotation speed (r)=1500 Number of bytes on track…

Q: Assume that you have a disk that has 191 tracks (numbered 0- 190) and the header current position is…

A: FCFS: First Come First Serve It is similar to FIFO. It is simple, fair approach but perhaps not the…

Q: Consider a file system on a disk that has a logical block size of 512 bytes, and assume that the…

A: I'm providing the answer to the above question. I hope this will be helpful for you.

Q: Calculate the number of disk tracks traversed using the FCFS, SSTF, SCAN, and LOOK algorithms for…

A: Performance: The speed of the CPU is a key factor that often decides the performance of the system.…

Q: Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3,…

Q: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a…

Q: Suppose that a block is 1K Byte and that a disk address is 4 bytes. Suppose that files are…

A: file: Collection of logically related entites. All attributes of file are called file context.

Q: Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3,…

A: Answer to the above question is in step2.

Q: Requests are not usually uniformly distributed. For example, a cylinder containing the file system…

Q: Suppose that the head of a disk drive is currently at track 9, that the disk has 32 tracks per…

A: head of the drive is at track 9

Q: question(6).Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of…

A: Introduction :

Concept explainers

Fundamentals of memory

A collection of connected storage devices form the memory unit. It is a space to store data and instructions required for processing. Information is stored in a memory unit in the form of bits. There are two types of memory namely:

Question

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, I indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system will be ?
Consider a file whose size varies between 2KB and 8MB during its lifetime. It is required that the file be accessible in the face of corrupted disk blocks. State, with reasons, whether or not the following block allocation schemes will be appropriate for implementing the file storage: contiguous, linked and table/indexed
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 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.
Disk requests are received by a disk drive for cylinders 13 , 6 , 1 , 29 , 28 , 8 in that order and the head pointer starts at 9 . A seek takes 5 ms per cylinder moved. How much seek time is needed to serve these requests by using the First Come First Served (FCFS) disk scheduling algorithm? a. 315 b. 305 c. 325 d. 320 e. 310
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).
The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes 1 msec to satisfy a request from the cache, but 40 msec to satisfy a request if a disk read is needed, give a formula for the mean time required to satisfy a request if the hit rate is h. Plot this function for values of h varying from 0 to 1.0. Explain your logic and justify the structure of the formula.
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.
On a 16 GB hard disk drive (HDD), each cluster consists of 32 sectors and each sector has a fixed size of 512 bytes. A text file with a size of 150,000 bytes is to be stored. a. i.What is the size of the slack space, in bytes, once the file has been stored?
c) Suppose a disk has 300 cylinders, numbered from 0 to 299. The drive is currently serving an I/O request at cylinder 111 and the disk head was previously serving a request at cylinder 99, and there is a queue of disk access requests for cylinders as below: 181, 199, 150, 160, 85, 178, 109, 75 Starting from the current head position, calculate the total head movements using the following disk scheduling algorithms.(i) SSTF scheduling (ii) SCAN scheduling
What is the maximum file size supported by a file system with 16 direct blocks,single,double,and triple indirection?the block size is 1k bytes.Disk block numbers can be stored in 4 bytes? give the answer in detail
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.