One can uncover the pattern size with the following code. The code accesses the raw device to avoid file system optimizations. The key to all of the Shear algorithms is to use random requests to avoid triggering any of the prefetch or caching mechanisms within the RAID or within individual disks. The basic idea of this code sequence is to access N random blocks at a fixed interval p within the RAID array and to measure the completion time of each interval.
Requests fall on the same disk; thus, the value of p with the highest time corresponds to the pattern size of the RAID.
a. Figure 6.26 shows the results of running the pattern size algorithm on an unknown RAID system.
? What is the pattern size of this storage system?
? What do the measured times of 0.4, 0.8, and 1.6 seconds correspond to in this storage system?
? If this is a RAID 0 array, then how many disks are present?
? If this is a RAID 0 array, then what is the chunk size?
b. Draw the graph that would result from running this Shear code on a storage system with the following characteristics:
? Number of requests: N = 1000
? Time for a random read on disk: 5 ms
? RAID level: RAID 0
? Number of disks: 4
? Chunk size: 8 KB
This question was answered on: Jul 11, 2017
Need a similar solution fast, written anew from scratch? Place your own custom order
We have top-notch tutors who can help you with your essay at a reasonable cost and then you can simply use that essay as a template to build your own arguments. This we believe is a better way of understanding a problem and makes use of the efficiency of time of the student. New solution orders are original solutions and precise to your writing instruction requirements. Place a New Order using the button below.