Consider a disk that rotates at 3600 rpm. The seek time to move the head between ad- jacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector 31. The head sees the sectors in ascending order. Assume the read/write head is positioned at the start of sector 1 on track 8. There is a main memory buffer large enough to hold an entire track. Data is transferred between disk locations by reading from the source track into the main memory buffer and then writing the date from the buffer to the target track. a. How long will it take to transfer sector 1 on track 8 to sector 1 on track 9? b. How long will it take to transfer all the sectors of track 8 to the corresponding sec- tors of track 9?

Consider a disk that rotates at 3600 rpm. The seek time to move the head between ad- jacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector 31. The head sees the sectors in ascending order. Assume the read/write head is positioned at the start of sector 1 on track 8. There is a main memory buffer large enough to hold an entire track. Data is transferred between disk locations by reading from the source track into the main memory buffer and then writing the date from the buffer to the target track. a. How long will it take to transfer sector 1 on track 8 to sector 1 on track 9? b. How long will it take to transfer all the sectors of track 8 to the corresponding sec- tors of track 9?

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

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.
Asap
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.
A computer has instructions that each require two bus cycles, one to fetch the instruc- tion and one to fetch the data. Each bus cycle takes 10 nsec and each instruction takes 20 nsec (i.e., the internal processing time is negligible). The computer also has a disk with 2048 512-byte sectors per track. Disk rotation time is 5 msec. To what percent of its normal speed is the computer reduced during a DMA transfer if each 32-bit DMA transfer takes one bus cycle?
Calculate the number of disk tracks traversed using the SSTF algorithms for the series of disk track service requests given as 54,36,21,74,46,35,26,67. At the time the first request arrives in the disk request queue, the read/write head is at track 50, moving toward the outer (lower-numbered)tracks. Draw the graph of the movement. Assume that the disk has 100 tracks from 0 to 99.
CPU with interrupt-driven I/O is busy servicing a disk request. While the CPU is midway through the disk service routine, another I/O interrupt occurs. Q.) Is it a problem?
Consider a disk with the following characteristics: block size 512 bytes, number of blocks per track=20, number of tracks per surface=400. A disk pack consists of 15 double sided disks. Suppose the disk drive rotates the disk pack at an average speed of 2400 rpm (revolutions per minute) i) How much time in (msec) does one disk revolution take? ii) Using the total capacity of the track as 10240 bytes how many bytes will be transferred from the track in 1 msec (ie transfer rate in bytes/sec)
Calculate the number of disk tracks traversed using the FCFS algorithms for the series of disk track service requests given as 54,36,21,74,46,35,26,67. At the time the first request arrives in the disk request queue, the read/write head is at track 50, moving toward the outer (lower-numbered)tracks. Draw the graph of the movement. Assume that the disk has 100 tracks from 0 to 99.
Calculate the number of disk tracks traversed using the FCFS, SSTF, SCAN, and LOOK algorithms for the series of disk track service requests given below. At the time the first request arrives in the disk request queue, the read/write head is at track 50, moving toward the outer (lower-numbered) tracks. (Hint: Each track over which the disk arm passes counts in the total, whether or not the track is read.)54, 36, 21, 74, 46, 35, 26, 67
One disc makes 7200 revolutions per minute. There are 24 tracks on the disc and 8 sectors on each track. 2. A file saved in 2 consecutive sectors on the track and 4 consecutive sectors on track 20 will be read. The reader head of the disc is on the tenth (10) track when the reading starts. The transition time of the head from one track to another takes 10 ms. Assuming that there are 1024 bytes in each sector and the data transfer rate is equal to the rotation speed of the disk, what is the time to read one sector and read the entire file? 1,04 ms ; 274,54 ms C. 6,24 ms; 307,25 ms 8,3 ms; 180,75 ms 8,3 ms ; 298,5 ms
Suppose that a magnetic disk has an average seek time of 4 ms, a rotation rate of 5400 RPM, a transfer rate of 50 MB/second, a sector size of 512 bytes, and controller overhead of 2 ms. What is the average amount of time to read a single sector?
232. The Eclipse SDK includes the Eclipse Java development tools. True False