Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served

Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose that a magnetic disk has an average seek time of 4 ms, a rotation rate of 5400 RPM, a transfer rate of 50 MB/second, a sector size of 512 bytes, and controller overhead of 2 ms. What is the average amount of time to read a single sector?
Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 MB, 4 MB, 20 MB, 18 MB, 7 MB, 9 MB, 12 MB and 15 MB. Which hole is taken for successive segment requests of (i) 12 MB (ii) 10 MB (iii) 9 MB for first fit? Now repeat the question for best fit and worse fit.
A certain disk can read data at a rate of 515.2 MB/s. How many books can be read in 4 seconds if an "average" book has69 pages,20 lines per page,9 words per line,6 characters per word,and each character is one of 100 different characters where the fewest number of bits are used to represent each character?
Disk requests come to disk driver for cylinders 10, 153, 34, 90, 120, 205, 319, 256 and 400 in that order at a time when the disk drive is reading from cylinder 99. The cylinders are numbered from 0 to 499. Compute the total head movement incurred while servicing these requests if the disk arm scheduling algorithm is first-come-first-serve.
Examine the internet's history and current technology.
Please and thank you. An external event is sensed using polling with period P. It takes 100 cycles to processthe event. Processor frequency is 48 MHz. Before starting a new period, the previouspolling task should have finished. The relative deadline for processing an event is 10μs.(a) Determine the range of feasible polling periods? (b) Suppose now that an unrelated interrupt may occur and the interrupt has higher priority than the code for processing the polling event. Including all overhead, it takes 40 cycles to process the interrupt. The minimum time between two subsequent interrupts is T. Suppose that T is larger than 140 cycles. Determine the range of feasible polling periods.
please no chatgpt answer . Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference, if the page-table entry is in the associative memory. Assume that 80 percent of the accesses are in the associative memory and that, of those remaining, 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time? Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Assuming demand paging with four frames, Show which pages are resident under the LRU, FIFO, and Optimal replacement algorithms by filling out the following tables. How many page faults would occur…
Consider a disk subjected to I/O requests arriving (following Poisson distribution) at an average rate of requests/second. Assume that on average, there were 5 requests waiting for service in the queue and that each request waits in the queue for about 10 milliseconds, on average. What is the effective arrival rate for this disk?
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
Consider a demand-paging system with a paging disk that has an average access/transfer time of 50 ms. Addresses are translated through a page table in main memory, with an access time of 500 ns per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added a TLB that reduces access time to one memory reference if the page-table entry is in the TLB. Assume that 80% of the accesses are in the TLB and that, of those remaining, 15% (or 3% of the total) cause page faults. We assume that the TLB access time is 20 ns. What is the effective access time?
The Answer to the given question is provided at the end of the question. I need you to show the full solution to get the given answer. Show all steps where necessary. During TLB search, the associative lookup time (ε) is 3ns and hit ratio (α) is 70%. For each time memory access, 80ns is needed. Calculate the effective access time. Answer: 106.1ns