The CS2220 Hard Disk Drive (HDD) is advertised with an average seek time of 3ms, 2048 byte sectors, 128 sectors per track, and a rotational speed of 7,200 rpm. It is required to read a file consisting of 256 sectors for a total of 512 Kbytes. Determine the time required to read the entire file assuming that it is randomly distributed.

The CS2220 Hard Disk Drive (HDD) is advertised with an average seek time of 3ms, 2048 byte sectors, 128 sectors per track, and a rotational speed of 7,200 rpm. It is required to read a file consisting of 256 sectors for a total of 512 Kbytes. Determine the time required to read the entire file assuming that it is randomly distributed.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter7: Transportation, Assignment, And Transshipment Problems

Section: Chapter Questions

Problem 5RP

See similar textbooks

Similar questions

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?
Consider a disk with an advertised average seek time of 6 ms, rotationspeed of 7,200 rpm, and 512-byte sectors with 500 sectors per track. Suppose that we wish to read a file consisting of 2500 sectors for a total of 1.28 Mbytes. Estimate the total time for the transfer when:
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 ?
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 disk with an advertised average seek time of 4 ms, rotation speed of 15,000 rpm, and 512-byte sectors with 500 sectors per track. Suppose that we wish to read a file consisting of 2500 sectors for a total of 1.28 Mbytes, then find each of the following: i) Average seek time ii) Average rotational latency iii) Transfer time for a sector iv) Total average time to satisfy a request
Consider a disk drive specifications. with the following 16 surfaces, 512 tracks/surface, 512 sectors/ track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one byte word is ready it is sent to memory; similarly, for writing, the disk interface reads a 4 byte word from the memory in each DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation?
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
This is the specification of the Toshiba MK5059GSXP internal hard drive: Calculate the average access time for the hard drives. Based on the specification in the Figure above, calculate the total seek time if you were to apply SSTF, SCAN, and C-SCAN algorithms on the hard disk. Assume that the read/write head is currently positioned at location 100 and is moving in the direction of increasing track number. The track requests in the disk queue are as follows: 153, 59, 65, 147, 168, 80, 89, 63 Based on your answer in (b), suggest and justify the algorithm that performs better disk scheduling in terms of: Fair service distribution ii. Disk throughput
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
There are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you double the number of sectors per block, then you double the number of blocks on the disk. b)…
There are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you divide tracks into half as many blocks, then you double the read time for a block.…
You have a disk with an average seek time of 3ms. Its rotation speed is 20,000rpm. The disk is organized as 512-byte sectors with 500 sectors per track. Assume that the disk uses sequential organization. How long would it take to read a file consisting of 3000 sectors? What is the total size of the file read in MB?