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 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 (

Dynamically loadable kernel modules, Q. Dynamically loadable kernel module... Q. Dynamically loadable kernel modules give elasticity when drivers are added to a system however do they have disadvantages too? Under what situations would a kernel be compiled

Logical address to physical address case study in java, solution solution

What is a file, Question 1 What is a file? Write down the operations on fi... Question 1 What is a file? Write down the operations on files Question 2 What do you mean virtual machine? Write down the application of virtual machine Question 3 What

Explain indexed allocation, Indexed allocation Indexed allocation bring... Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block

Array-initialization loops using lru replacement algorithm, Q. Consider th... Q. Consider the two-dimensional array A: int A[][] = new int[100][100]; Whereas A [0][0] is at location 200 in a paged memory system with pages of size 200. A little process

What are the two types of fragmentations, Questiion 1 Use Priority Sche... Questiion 1 Use Priority Scheduling Algorithm to schedule the following processes        Process                 Burst Time             Priority/Time            P1

What is an operating system?, What is an operating system? An operating... What is an operating system? An operating system is a program that acts as a mediator between a user and the computer hardware. The function of an operating system is to provid

System protection, what is the need-to-know principle? why is it important ... what is the need-to-know principle? why is it important for a protection system to adhere to this principle?

What is the concept of an atomic operation, Question: Concurrency and Sync... Question: Concurrency and Synchronization a) Define the following terms: I. Critical section II. Mutual Exclusion III. Deadlock IV. Starvation. b) Name three methods w