✓20. How long does it take to read a disk with 10,000 cylinders, each containing four tracks of 2048 sectors? First, all the sectors of track 0 are to be read starting at sector 0, then all the sectors of track 1 starting at sector 0, and so on. The rotation time is 10 msec, and a seek takes 1 msec between adjacent cylinders and 20 msec for the worst case. Switching between tracks of a cylinder can be done instantaneously.

✓20. How long does it take to read a disk with 10,000 cylinders, each containing four tracks of 2048 sectors? First, all the sectors of track 0 are to be read starting at sector 0, then all the sectors of track 1 starting at sector 0, and so on. The rotation time is 10 msec, and a seek takes 1 msec between adjacent cylinders and 20 msec for the worst case. Switching between tracks of a cylinder can be done instantaneously.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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:
The outer track 0 of a hard disk has a diameter of 8cm, the innermost track 36113 has a diameter of 4cm. For simplicity, let's assume that the head is moving at a constant speed of 2m/s. The hard disk rotates at 7200 rpm, the reading time of the sectors is negligible. How long does it take to change lanes from lane 0 to lane 36113? Enter the answer in milliseconds without decimal places.
1) Given an O/S with soft timers using a single clock, consider a situation where the event list looks like this: Current time = 4105; Next Signal = 6; Clk Header → 6 → 1 → 3 → 12 → 5 a. What will current time be when the “12” signal is dispatched = b. At time 4113 a new signal arrives to be scheduled for 4125, fill in the following to reflect this signal being added at that time: Current time = ; Next Signal = ; Clk Header → 2) Given a disk with 100 tracks, Consider the following disk request sequence (track numbers): 45, 20, 90, 10, 50, 60, 80, 25, 70. The initial position of the R/W head is on track 50. Determine the distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used and the Elevator algorithm (note -the Elevator algorithm will move towards 100 when it starts execution). Which algorithm will move the fewest tracks , SSTF or Elevator: , and by how many fewer tracks: tracks less than the other algorithm.
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
Devise an efficient divide-and-conquer algorithm for the Towers of Hanoi problem when the disks are colored alternately red and blue, and we add the extra rule that no disk may be placed on any other disk of the same color.
what is the right choise? Assume a disk with 250 tracks and the head is initially at track 50. The requested tracks are the following: 37,22,19,11,55,65,100,150. Using SSTF which of the following is correct: 50à 55à 65à 37à 19à 11à 100à 150 50à 55à 65à 100à150à 37à 19à11 50à 55à 65à 100à150à 37à 11à19 50à 55à 65à 37à 11à 19à 100à 150
Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of tracks on one side of platter: 30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the disk receive a request to access a random sector on a random track and assume the disk head starts at track 0. a. What is the average seek time? b. What is the rotational latency? c. What is the transfer time for a sector? d. What is the total average time to satisfy a request?
Consider a disk with a sector size of 512 bytes, 1,000 tracks per plater, 100 sectors per track, 10 tracks per cylinder and a block size of 2,048 bytes including 48 bytes for non-data overhead. Suppose that a file containing 1,000,000 records of 100 bytes each is to be stored on such a disk and that no record can span two blocks. a) How many records fit onto a block? b) How many cylinders are required to store the entire file?
I will upvote . Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is
Consider a disc with 512-byte sectors, 1,000-track platters, 100-sector tracks, ten-track cylinders, and a block size of 2,048 bytes plus 48 bytes for non-data overhead. Assume that a file with 1,000,000 100-byte records is to be stored on such a disc, and that no record can transcend two blocks. a) How many recordings can fit on a single block? b) How many cylinders will be needed to store the complete file?
when I split an audio file of 10.27 minutes into clips of 0.5 seconds am getting 1400 files instead of 1232 files. Why so? What can I do to get chunks of an exact number of files?
If AES-192-CBC is used for encrypting a file of size 1800 byte, then find the total number of blocks that are generated by the whole process?