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.

Posted Date: 7/29/2013 1:43:39 AM | Location : United States

Ask an Expert

Related Discussions:- Write an equation for this seek time, Assignment Help, Ask Question on Write an equation for this seek time, Get Answer, Expert's Help, Write an equation for this seek time Discussions

Write discussion on Write an equation for this seek time
Your posts are moderated

Write your message here..

Related Questions

What is thrashing, What is thrashing? It is a method in virtual memory... What is thrashing? It is a method in virtual memory schemes when the processor spends most of its time swapping pages, rather than implementing instructions. This is because o

Starvation, what do you mean by starvation?explain in detail what do you mean by starvation?explain in detail

Interprocess communication, case study:interprocess communication case study:interprocess communication

Load sharing , Load Sharing : Processes are not given to a particular proc... Load Sharing : Processes are not given to a particular processor. A global queue of threads is used to maintain. Each processor, when idle, picks a thread from this queue. Note th

Explain the network protocols, Explain the Network protocols There are ... Explain the Network protocols There are a wide variety of network protocols to choose from traditionally client - server developers were required to choose a communications pro

Define file permission in unix, The permission function is used to calculat... The permission function is used to calculate what, if any access each class or level of user has to each file on a Unix machine. The permission task is one of the data components s

Necessary conditions for deadlock, Here are the conditions necessary for a ... Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient: 1. ?nite resources: the resources are held in a mutually-e

Co-operating process, what is the meaning of co-operating process? what is the meaning of co-operating process?

What are the typical elements of a process image, What are the typical elem... What are the typical elements of a process image? User data: Modifiable part of user space. May have program data, user stack area, and programs that might be modified. User

Prevention of a data race in a parallelised program, Present your own fully... Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p