Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
You have a system with two primary workloads. One performs sequential access to a set of large files, the other performs small, independent, random reads to a separate set of large
Define the DosExecPgm Functions used in the OS/2 DosExecPgm (objBuffer, objLen, flags, cmdLine, env, &resultCode, execName) DosExecPgm function is designed to load an execut
what if we need the portion from a text based on some keyword. For eg. My file is like below, ------------------------------------------------ Order=[ 1 2 3 4 5 Order=[ 6 7 8 9
Processes have valid and invalid entries on their page tables. The valid entries all point to some where "real" (e.g. a physical page, or some portion of disk in case of non-reside
Mention the various features that characteristics the deadlock condition . The four circumstances that give rise to deadlock condition are: 1) Mutual exclusion : As a minim
Virtual file systems The file-system execution having of three major layers. The first layer is the file-system interface, based on the open, read, write and close calls and fi
What lead to the concept of paging? The main memory is separated into two parts that are one for the resident operating system, and one for the user processes. We may perhaps p
LRU page replacement In least lately used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an opti
socket based fortune teller sever.your program should create a server that listens to a specific port when a client receives a connection the server should respond with a random fo
Define approaches that require knowledge of the system state? Answer: Deadlock detection, Deadlock prevention, Deadlock Avoidance.
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd