how to estimate the disk access time?
e.g. the time between read one byte and another byte in the
disk.
Answers were Sorted based on User's Feedback
Answer / prasad jvv
Disks are block devices. Mean one block of data can be read
at one point of time. So there is no point of time between
read one byte and another byte. If intended to calculate
time to read one byte, first of all we need to calculate
the time required to read one block and devide that by
block size.
Access Time = Command Overhead Time + Seek Time + Settle
Time + Latency
This equation is not universal standard.
Is This Answer Correct ? | 6 Yes | 2 No |
Answer / daniele
http://www.linuxinsight.com/how_fast_is_your_disk.html
% sudo hdparm -t /dev/hda
/dev/hda:
Timing buffered disk reads: 140 MB in 3.02 seconds = 46.28
MB/sec
Substitute /dev/hda with the name of your raw disk device,
of course (for example, it might be /dev/sda if you're using
libata, or something else).
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / arbit
I suppose the answer is to be figured out programmatically
not by handwaving. Every stupid in Computer Science knows
what you have answered
Is This Answer Correct ? | 1 Yes | 3 No |
what is diff b/w huge & far & near pointer??
Discuss similarities and differences of Multiprogramming OS and multiprocessing OS?
What is the use of header files?
why should i select you?
How do you declare a variable that will hold string values?
what is c?
What are the features of the c language?
write a program in C that prompts the user for today's date,tomorrow's date and display the results.Use structures for today's date,tomorrow's date and an array to hold the days for each month of the year.
Convert the following expression to postfix and prefix (A+B) * (D-C)
Write a program or provide a pseudo code to flip the 2nd bit of the 32 bit number ! (Phone Screen)
How can I find leaf node with smallest level in a binary tree?
write a c program to find the square of a 5 digit number and print the result.
5 Answers Accenture, Sasken, Vimukti Technologies,