subject

Drive a: • drive diameter: 3.5" • platters: 2 • rpm: 7,500 • exterior color: silver • average time needed to move the read heads to a specific track (seek time): 7ms • rate at which data passes under the read heads: 40 mb/s • rate at which the hard drive communicates with the computer: 100 mb/s
drive b: • drive diameter: 2.5" • platters: 4 • rpm: 10,000 • exterior color: blue • average time needed to move the read heads to a specific track (seek time): 4ms • rate at which data passes under the read heads: 90 mb/s. the rate at which the hard drive communicates with the computer: 200 mb/s
assume that the os requests a read of some block of data from one track on a drive. assume the drive controller will read the entire block of data from the disk, then begin transmitting the data back to the os. answer the following questions twice, once for drive a and once for drive b.
a. what is the average latency for reading a 1024 byte block of data? b. what is the minimum latency for reading a 2048 byte block of data? c. for each drive, determine the dominant factor that affects latency. specifically, if you could make an improvement to any one aspect of that drive, what would you improve and why? if there is no dominant factor, explain why. hints: simply sum up the latencies imposed by seeks, rotational delay, time to read the data from disk into the controller, and time to transmit the data from the controller to the main memory. (these correspond to some of the numbers given in the data tables.) the controller would impose a small logical overhead, do not include this. for minimums, assume the disk mechanisms are in the ideal positions for the read.

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 20:00
What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i.e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }
Answers: 3
question
Computers and Technology, 23.06.2019 19:30
Of the following pieces of information in a document, for which would you most likely insert a mail merge field?
Answers: 3
question
Computers and Technology, 24.06.2019 11:00
Why is it uncommon for users to perform searches directly in database tables? a.)users are discouraged from interacting directly with tables because they might confuse tables with spreadsheets. b.) users are discouraged from interacting directly with tables because this may result in unintended changes to source data. c.)users do not have the technical skills required to perform searches directly in database tables. d.)users do not have the permissions required to perform searches directly in database tables.
Answers: 1
question
Computers and Technology, 24.06.2019 11:30
Why is body language an important factor in a business meeting
Answers: 1
You know the right answer?
Drive a: • drive diameter: 3.5" • platters: 2 • rpm: 7,500 • exterior color: silver • average t...
Questions
question
Mathematics, 10.12.2020 04:30
question
Mathematics, 10.12.2020 04:30
question
Mathematics, 10.12.2020 04:30
question
Biology, 10.12.2020 04:30
question
Mathematics, 10.12.2020 04:30
Questions on the website: 13722361