Question 1An HDD disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. Itreceives requests for a number of tracks in the following order: 20, 130, 115, 186, 174, 43, 12, 61, 121.What is the average seek time in a C-SCAN scheduling policy?O 62.1O 37O 29.1O 28.8Question 2An HDD disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. Itreceives requests for a number of tracks in the following order: 20, 130, 115, 186, 174, 43, 12, 61, 121.What is the average seek time in a SSTF scheduling policy?O 62.1O 28.8O 29.1O 37

#include <bits/stdc++.h>using namespace std; int size = 8;int disk_size = 200; void CSCAN(int…

An HDD disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. It receives requests for a number of tracks in the following order: 20, 130, 115, 186, 174, 43, 12, 61, 121. What is the average seek time in a C-SCAN scheduling policy? O 62.1 O 37 O 29.1 O 28.8

An HDD disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. It receives requests for a number of tracks in the following order: 20, 130, 115, 186, 174, 43, 12, 61, 121. What is the average seek time in a C-SCAN scheduling policy? O 62.1 O 37 O 29.1 O 28.8

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

Computer Science Question: Consider a virtual cylinder identical to the one shown the figure below with the following characteristics: seek time is 4 ms/track, search time is 1.7 ms/sector, and data transfer time is 0.9 ms. Calculate the resulting seek time, search time, data transfer time, and total time for the following Request List, assuming that the read/write head begins at Track 0, Sector 0. Finally, calculate the total time required to meet all of these requests. Track Sector 1 0 1 4 1 0 3 1 2 4 3 0
You are given the following data about a virtual memory system:(a) The TLB can hold 512 entries and can be accessed in 1 clock cycle (1nsec).(b) A page table entry can be found in 100 clock cycles or 100 nsec.(c) The average page replacement time is 9 msec.If page references are handled by the TLB 99% of the time, and only 0.01%lead to a page fault, what is the effective address-translation time?
Consider a swapping system in which memory consists of the following hole sizes inmemory order: 12 MB, 4 MB, 20 MB, 12 MB,18 MB, 7 MB, 9 MB and 12 MB.Which hole is taken for successive segment requests of(a) 10MB(b) 15MB(c) 9 MBfor first fit, worst fit, and next fit?
Last solution had mistakes For a 5,000 RPM disk, assume its average seek time is 7 msec, and it has 100 MB/sec bandwidth; assume the sector size is 512 bytes. (In this problem, MB means 1,000,000 bytes.) How long does it take to access 2,048 bytes of contiguous data on average? What is the average throughput (bytes per second) if the user accesses 512 bytes for each I/O? Assume the data is perfectly aligned on the disk. How long does it take to access 1 MB of contiguous data (on average)? What is the average throughput (bytes per second) if the user accesses 1 MB for each I/O operations? Assume the data is perfectly aligned on the disk. Suppose a user expects his or her average throughput to reach 50% of the disk’s maximum bandwidth. Find the minimum I/O size needed to achieve this.
If a memory with a size of 1024 GB is known, allocate Using the buddy system:i. Allocation of 512 MBii. Allocation of 128 MBiii. Release 128 MB
Consider a disk with tracks numbered from 0 to 255. The disk arm is moving towards highnumbered tracks and it takes 1ms to travel from one track to the next adjacent one. While retrieving data from Track 52, the following list of requests has arrived: 185, 17, 124, 83, 40, 29, 76, 112 Identify the disk scheduling algorithms based on the following descriptions: Selects the disk I/O request that requires the least amount of travel from the current position of the disc arm, regardless of direction. The disc arm moves back and forth over the disk, satisfying requests in its path. Based on your answer in (a), perform disk scheduling analysis using these TWO (2) disks scheduling algorithms. Compute the average seek time for both algorithms. Based on your answer in (b), which algorithm performs better disk scheduling? Justify your answer.
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to non-uniform distribution of requests arm starting and stopping inertia higher capacity of tracks on the periphery of the platter use of unfair arm scheduling policies
If a memory with a size of 1024 GB is known, allocateUsing the buddy system:i. Allocation of 512 MBii. Allocation of 128 MBiii. Release 128 MBiv. Allocation of 64 MBv. Allocation of 64 MBvi. Allocation of 128 MB
Assume a CUDA device's SM (streaming multiprocessor) can take up to 2,048 threads and up to 4 thread blocks. Which of the following block configuration would result in the greatest number of threads in each SM? (More than one correct answer is possible, select all correct answers.) a. 256 threads per block b: 512 threads per block c: 2048 threads per block d: 1,024 threads per block
110. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.Process P0 P1 P2 Maximum needs (process-wise : P0 through P2 top to bottom) 10 4 9Currently allocated (process-wise)522Which of the following sequence is a safe sequence ? a. P0, P1, P2 b. P1, P2, P0 c. P2, P0, P1 d. P1, P0, P2
Disk requests are received by a disk drive for cylinders 13 , 6 , 1 , 29 , 28 , 8 in that order and the head pointer starts at 9 . A seek takes 5 ms per cylinder moved. How much seek time is needed to serve these requests by using the First Come First Served (FCFS) disk scheduling algorithm? a. 315 b. 305 c. 325 d. 320 e. 310
Answer the following questions according to the figure below :a) Suppose that B=500kb, Q=200kb, x=2Mbps, and r=3Mbps. Compute the playout time and the time that the client buffer becomes full