Write an equation for this seek time, Operating System

Assignment Help:

Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s typically seek at a fixed rate. Presume that the disk in subsequent exercise has a constant-rate seek rather than a constant acceleration seek consequently seek time is of the form t = x + yL where t is the time in milliseconds and L is the seek distance. Presume that the time to seek to an adjacent cylinder is 1 millisecond as before and is 0.5 milliseconds for every additional cylinder.

a. Write an equation for this seek time like a function of the seek distance.

b. Utilizing the seek-time function from a part calculate the total seek time for each of the schedules in Exercise 12.2. Is your answer the similar as it was for Exercise 12.3(c)?

c. What is the percentage accelerate of the fastest schedule over FCFS in this case?

Answer:

a. t = 0.95 + 0.05L

b. FCFS 362.60; SSTF 95.80; SCAN 497.95; LOOK 174.50; C-SCAN 500.15; (and C-LOOK 176.70). SSTF is still the winner as well as LOOK is the runner-up.

c. (362.60 - 95.80)/362.60 = 0.74 the percentage accelerate of SSTF over FCFS is 74% with respect to the seek time. If we comprise the overhead of rotational latency and data transfer the percentage speedup will be less.


Related Discussions:- Write an equation for this seek time

Keeping track of free memory, How do we keep track of where the free pieces...

How do we keep track of where the free pieces of memory are? One idea is to maintain a set of linked-lists of free space; each linked-list will store free chunks of some given size

PSEUDO CODE FOR PROGRAM, THE PROGRAM WILL CHOOSE TWO RANDOM NUMBERS,THEN PR...

THE PROGRAM WILL CHOOSE TWO RANDOM NUMBERS,THEN PRINT THEM OUT AS AN ADDITION PROBLEM.THE PROGRAM WILL THEN ASK THE USERTO ENTER THE CORRECT ANSWER.IF THE ANSWER IS CORRECT,THE PRO

Binary arithmetic, The principle is that of ordinary addition; however reme...

The principle is that of ordinary addition; however remember the highest number is 1.   Calculate the following:                             11001 +                           11

Semaphore, define semaphore. how can we use semaphore to deal with n-proces...

define semaphore. how can we use semaphore to deal with n-process critical section problem.

What are the system components of an operating system, What are the system ...

What are the system components of an operating system and explain them? a) Process management b) Main-memory management c) I/O management d) File management e) Seco

What is two-level directory, What is Two-level directory In the two-lev...

What is Two-level directory In the two-level directory structure every user has own user file directory (UFD). When a user jobs begins or a user logs in, the system's master fi

What is the main function of the memory-management unit, What is the main f...

What is the main function of the memory-management unit? The runtime mapping from virtual to physical addresses is done by a hardware device known as a memory management unit (

Explain general graph directory, General graph directory The serious pr...

General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire

What is the translation look aside buffer (tlb), Translation Look aside Buf...

Translation Look aside Buffer In a cached system, the base addresses of the last few indexed pages is maintained in registers named the TLB that adds in faster lookup. TLB has

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