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.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 11P

See similar textbooks

Related questions

Q: Write a finite automaton for a language that accepts all words starting with an alphabet character…

A: Automation State 1: Input: a Output: Go to state 2 State 2: Input: [a-zA-Z0-9] Output:…

Q: Creating a RAID array is a technique for generating live backups of physical hard drives, however…

A: Introduction: RAID is a data virtualization storage system that brings together several physical…

Q: The RAID level which mirroring is done along with stripping is a. RAID 1+0 b. RAID 0 c. RAID 2 d.…

A: Given that: The RAID level which mirroring is done along with stripping is a. RAID 1+0 b. RAID 0 c.…

Q: Let us consider a scenario in which the boot record of a disc volume is corrupted. Which file…

A: Corrupted boot records on disc volumes can cause serious problems with accessing the data that is…

Q: These cylinder requests come in to a disk driver. The disk driver code can only buffer five requests…

A: A disk driving force can be defined in such a way that it is a device or software that permits your…

Q: A program repeatedly perform the 3steps process: it reads a 4KB block of data from disk, does some…

A: As program performing a repetitive process involving reading data from disk, processing it, and…

Q: Assume there is a PCI buffer that is used for data transfers between primary memory and a webcam.…

A: A PCI buffer is a special type of buffer that is used in systems with Peripheral Component…

Q: Consider a RAID level 5 organization comprising five disks, with the parity for sets of four blocks…

A: RAID (redundant array of independent disks) is a way of storing the same data in different places on…

Q: 26. The following four requests could come in to an operating system as it is running on a computer…

A: Explanation: The processor gives highest priority to the seconds counter first, because it has to…

Q: Write a program to test the class LinkedBag.

A: write a java program to test the calss linked bag

Q: Brian, a photographer, recently lost his data that was stored on a hard disk after it crashed. To…

A: A three-way mirror resiliency type is ae to handle multiple drive failures and and can still operate…

Q: 1. Raid Consider two implementations. Implementation A uses Raid Level 1 and B uses Raid Level 5. B…

A: We need minimum of twice the disk space for implementing RAID level 1. So, 4 Terabytes of disk space…

Q: Suppose that a magnetic dick drive has the following characteristics: Rotational speed = 20000…

A: Actually, given information Rotational speed = 20000 RPM HTH switching time = 3 ms Average TTT…

Question

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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider a disk that rotates at 3600 rpm. The seek time to move the head between ad- jacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector 31. The head sees the sectors in ascending order. Assume the read/write head is positioned at the start of sector 1 on track 8. There is a main memory buffer large enough to hold an entire track. Data is transferred between disk locations by reading from the source track into the main memory buffer and then writing the date from the buffer to the target track. a. How long will it take to transfer sector 1 on track 8 to sector 1 on track 9? b. How long will it take to transfer all the sectors of track 8 to the corresponding sec- tors of track 9?
Consider a RAID level 5 organization comprising five disks, with the parity for sets of four blocks on four disks stored on the fifth disk. How many blocks are accessed in order to perform the following?a. A write of one block of datab. A write of seven continuous blocks of data
These cylinder requests come in to a disk driver. The disk driver code can only buffer five requests at once. Requests for tracks 13, 21, 11, 80, and 65 come in. The order of the requests be processed are 13, 21, 11, 80, and 65. This indicates the seek algorithm used is: C-SCAN RAID FIFO SSF
What is the average time to read or write a 512 bytes sector for a disk? The advertised average seek time is 5 ms, the transfer rate is 40 MB/sec, it rotates at 10,000 RPM, and the controller overhead is 0.1 ms. Assume the disk is idle so that there is no queuing delay. In addition, calculate the time assuming the advertised seek time is three times longer than the measured seek time.
Need both part
Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of tracks on one side of platter: 30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the disk receive a request to access a random sector on a random track and assume the disk head starts at track 0. a. What is the average seek time? b. What is the rotational latency? c. What is the transfer time for a sector? d. What is the total average time to satisfy a request?
Consider a RAID-4 disk configuration involving five disks A, B, C, D and E where disk E stores the parity. Examine the following six scenarios involving read and write operations in the presence of disk failures in this configuration: 1. All disks are up. There is a write operation on block 10 of disk C. 2. Disk B is down and all other disks are up. There is a read operation on block 20 of disk C. 3. Disk C is down and all other disks are up. There is a read operation on block 30 of disk C. 4. Disk D is down and all other disks are up. There is a write operation on block 40 of disk C. 5. Disk E is down and all other disks are up. There is a read operation on block 50 of disk C. 6. Disk E is down and all other disks are up. There is a write operation on block 60 of disk C. In each of the above scenarios determine how many disk accesses happen in order to process the I/O operation. Assume that the goal is to allow as many of the I/O operations as possible, in the presence of disk…
On a 16 GB hard disk drive (HDD), each cluster consists of 32 sectors and each sector has a fixed size of 512 bytes. A text file with a size of 150,000 bytes is to be stored. a. i.What is the size of the slack space, in bytes, once the file has been stored?
A certain moving arm disk storage, with one head, has the following specifications. Number of tracks/recording surface = 200 Disk rotation speed = 2400 rpm Track storage capacity = 62,500 bits The average latency of this device is P msec and the data transfer rate is Q bits/sec. Write the value of P and Q.
CPU with interrupt-driven I/O is busy servicing a disk request. While the CPU is midway through the disk service routine, another I/O interrupt occurs. Q.) Is it a problem?
A particular high-performance computer system has been functioning as an e-business server on the Web. This system supports $10,000 per hour in gross business volume. It has been estimated that the net profit per hour is $1,200. In other words, if the system goes down, the company will lose $1,200 every hour until repairs are made. Furthermore, any data on the damaged disk would be lost. Some of this data could be retrieved from the previous night’s backups, but the rest would be gone forever. Conceivably, a poorly timed disk crash could cost your company hundreds of thousands of dollars in immediate revenue loss, and untold thousands in permanent business loss. The fact that this system is not using any type of RAID is disturbing to you.Although your chief concern is data integrity and system availability, others in your group are obsessed with system performance. They feel that more revenue would be lost in the long run if the system slowed down after RAID is installed. They have…