2. 6. Give an example of an environment or application that best matches the characteristics of each of the following RAID levels: a. Level 0 b. Level 1 c. Level 3 d. Level 5 e. Level 6 3. Given that it takes 1.75 ms to travel from one track to the next of a hard drive; that the arm is originally positioned at Track 15 moving toward the low- numbered tracks; and that you are using the LOOK scheduling policy: Compute the total seek time to satisfy the following requests4, 40, 35, 11, 14, and 7. Assume all requests are initially present in the wait queue. (Ignore rotational time and transfer time; just consider seek time.) 4. Given it takes 1 ms to travel from one track to the next adjacent one. Let's say that while retrieving data from Track 20, the following list of requests has arrived: Tracks 9, 45, 16, 40, 12, and 19. Let's also assume that once a requested track has been reached, the entire track is read into main memory. Satisfy all orders using the FCFS order.

2. 6. Give an example of an environment or application that best matches the characteristics of each of the following RAID levels: a. Level 0 b. Level 1 c. Level 3 d. Level 5 e. Level 6 3. Given that it takes 1.75 ms to travel from one track to the next of a hard drive; that the arm is originally positioned at Track 15 moving toward the low- numbered tracks; and that you are using the LOOK scheduling policy: Compute the total seek time to satisfy the following requests4, 40, 35, 11, 14, and 7. Assume all requests are initially present in the wait queue. (Ignore rotational time and transfer time; just consider seek time.) 4. Given it takes 1 ms to travel from one track to the next adjacent one. Let's say that while retrieving data from Track 20, the following list of requests has arrived: Tracks 9, 45, 16, 40, 12, and 19. Let's also assume that once a requested track has been reached, the entire track is read into main memory. Satisfy all orders using the FCFS order.

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

Assume that you have a program that has a part at the beginning that is sequential in nature (for example, reading a file, that must be executed by only one processor) and takes 20 ms. Also there is a part at the end of the program that is sequential and takes 10 ms. Between these two parts, there is a perfectly parallelizable part and it take 480 ms in sequential. a) What is maximum speed-up according to Amdahl's law? b) What is the speed-up for 4 processors? c) What is the efficiency for 4 processors? Sorunun tüm bölümlerine cevap verin
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.
Data mapping for a RAID Level 0 array is shown. Following the working principles of RAID Level 1 array, how you would like to fill the following physical disks from the stripes available in logical disk in the given diagram
Creating a RAID array is a technique for generating live backups of physical hard drives, although doing so will reduce the available capacity of the hard drive. Alternatively, would you want to have backup at the expense of half your available disc space? When it comes to a home computer system that has regular power outages that might result in hard disc failures, which form of RAID is the best choice?
Given the following hard disk set with RAID 4 configuration, can you find the missing data of Block2 back? Please write down your calculation steps