Estimate the continued transfer rate of drive, Operating System

Assignment Help:

Q. The term "fast wide SCSI-II" signifies a SCSI bus that operates at a data rate of 20 megabytes per second when it moves a packet of bytes among the host and a device. Presume that a fast wide SCSI-II disk drive spins at 7200 RPM has a sector size of 512 bytes and holds 160 sectors per track.

a. Estimate the continued transfer rate of this drive in megabytes per second.

b. Presume that the drive has 7000 cylinders 20 tracks per cylinder a head switch time from one platter to another of 0.5 millisecond as well as an adjacent cylinder seek time of 2 milliseconds. Utilize this additional information to give an accurate estimate of the sustained transfer rate for a huge transfer.

c. Presume that the average seek time for the drive is 8 milliseconds. Evaluate the I/Os per second as well as the effective transfer rate for a random-access workload that reads individual sectors that are scattered across the disk.

d. Compute the random-access I/Os per second and transfer rate for I/O sizes of 4 kilobytes 8 kilobytes and 64 kilobytes.

e. If numerous requests are in the queue a scheduling algorithm such as SCAN should be able to reduce the average seeks distance. Presume that a random-access workload is reading 8-kilobyte pages the average queue length is 10 and the scheduling algorithm decreases the average seek time to 3 milliseconds. Now compute the I/Os per second and the effective transfer rate of the drive.

Answer:

a. The disk spins 120 times per second as well as each spin transfers a track of 80 KB. Therefore the sustained transfer rate can be approximated as 9600 KB/s.

b. Presume that 100 cylinders is a huge transfer. The transfer rate is entire bytes divided through total time. Bytes: 100 cyl * 20 trk/cyl * 80 KB/trk that is 160,000 KB. Time: rotation time + track switch time + cylinder switch time and rotation time is 2000 trks/120 trks per sec, i.e., 16.667 s. Track switch time is 19 switch per cyl * 100 cyl * 0.5 ms that is 950 ms. Cylinder switch time is 99 * 2 ms that is 198 ms. Therefore the total time is 16.667 + 0.950 + 0.198 that is 17.815 s. (We are ignoring any initial seek as well as rotational latency which might add about 12 ms to the schedule that is 0.1%.) therefore the transfer rate is 8981.2 KB/s. The overhead of track in addition to cylinder switching is about 6.5%.

c. The time/per transfer is 8ms to seek + 4.167ms average rotational latency + 0.052 ms (calculated from 1/(120 trk per second * 160 sector per trk)) to rotate one sector past the disk head during reading. We compute the transfers per second as 1/(0.012219), i.e., 81.8. Since every transfer is 0.5 KB the transfer rate is 40.9 KB/s.

d. We ignore track as well as cylinder crossings for simplicity. For reads of size 4 KB and 8 KB and 64 KB the corresponding I/Os per second are calculated from the seek and rotational latency and rotational transfer time as in the previous item giving (respectively) 1/ (0.0126) 1/(0.013), and 1/(0.019). Therefore we get 79.4, 76.9, and 52.6 transfers per second respectively. Transfer rates are acquired from 4, 8 and 64 times these I/O rates giving 318 KB/s, 615 KB/s and 3366 KB/s respectively.

e. From 1/ (3+4.167+0.83) we acquire 125 I/Os per second. From 8 KB per I/O we acquire 1000 KB/s.


Related Discussions:- Estimate the continued transfer rate of drive

First-in-first-out (fifo), FIFO is named as 'named pipes'. FIFO (first-in-...

FIFO is named as 'named pipes'. FIFO (first-in-first-out) is a special file which is laid to be data transient. Once data is load from named pipe, it cannot be load again. Also, da

What are the necessary conditions for deadlocks?, What are the necessary co...

What are the necessary conditions for deadlocks? 1. Mutual exclusion :  Only one process at a time is able to use the resource. 2. Hold and wait :  A process should be holdi

Memory management unit, When a program issues a memory load or store operat...

When a program issues a memory load or store operation, the virtual addresses (VAs) used in those operations have to be translated into "real" physical memory addresses (PAs). This

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Explaintable management techniques, Discuss in detail Table management Tech...

Discuss in detail Table management Techniques?     An Assembler employs the subsequent tables: OPTAB: Operation Code Table consists of mnemonic operation code and its machi

What is co-operating scheduling?, What is co-operating scheduling? CPU ...

What is co-operating scheduling? CPU scheduling decisions may possibly place under the following four circumstances: 1.      When process switches from the running state to

Explain the overlay structured program, Overlay structured program: A p...

Overlay structured program: A program consisting of overlays is referred as overlay structured program in which an overlay is a part of program which has similar load origin as

Memory management, 4. Describe priority scheduling algorithm. Consider the ...

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p

Explain direct sequence-analog signal, 1. A digitized voice channel is made...

1. A digitized voice channel is made by digitizing a 7 KHz bandwidth analog signal. The signal is to be sampled twice the highest frequency (two samples per hertz) . Assume each sa

Explain the file-system manipulation, Q. Explain the File-system manipulati...

Q. Explain the File-system manipulation? File-system manipulation there is several details in file allocation, creation, deletion and naming that users should not have to perfo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd