Alert dont submit AI generated answer. 001213425637Stripesetdisk4PP0----------0810191010910111213141150РOPI221Р1----------2316172318 192203212322 232P3Р2------------4524 254526 274285294530 31452P Р163--------67167677167 The following diagram shows a 5-disk RAID 4 array, again with a stripe size of 2 sectors. Sectors in the RAID volume and on individual disks are indicated as above. Stripe diskGiven the following operations on the RAID 4 volume, translate them to the corresponding read or write operations, giving type (read or write), disk number, LBA, and length foreach operation. There are several ways in which (B) and (C) may be performed; for each give the one resulting in the fewest resulting read and write operations.read(LBA = 3,length 12) write(LBA = 3, length = 12) write(LBA = 24, length = 8) Again, please specify an exact sequence of disk read and write operations. Note that this question hasmultiple correct answers, each of which can be expressed multiple ways.

On the RAID 4 Volume to the corresponding read or write operations, we need to consider the layout…

0 0 1 2 1 3 4 2 5 6 3 7 Stripe set disk 0 - - - - - 4 PP - - - - - 0 8 1 0 19 1 0 1 0 9 10 11 12 13 14 1 15 0 OPI Р 1 P 1 - - - - - - - - - - 2 3 1617 2 3 18 19 2 3 2 3 2 20 21 22 23 22 3 P Р 2 - 4 24 - 5 25 - 4 - 5 2627 3 - - - - - 4 - 5 28 29 - - 4 30 - 5 31 - - - - 4 - 5 I - P Р - 6 7 16 7 10 6 7 16 7 16 7

0 0 1 2 1 3 4 2 5 6 3 7 Stripe set disk 0 - - - - - 4 PP - - - - - 0 8 1 0 19 1 0 1 0 9 10 11 12 13 14 1 15 0 OPI Р 1 P 1 - - - - - - - - - - 2 3 1617 2 3 18 19 2 3 2 3 2 20 21 22 23 22 3 P Р 2 - 4 24 - 5 25 - 4 - 5 2627 3 - - - - - 4 - 5 28 29 - - 4 30 - 5 31 - - - - 4 - 5 I - P Р - 6 7 16 7 10 6 7 16 7 16 7

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

Hi, please solve it correctly ,else i will downvote Consider the following disk request sequence for a disk with 100 tracks. 98, 183, 37, 122, 14, 124, 65, 67 Head pointer starting at 53 (current position of R/W heads) and moving in right direction. Find the number of head movements in cylinders using FCFS scheduling. Subject code - rcs509
The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes 1 msec to satisfy a request from the cache, but 40 msec to satisfy a request if a disk read is needed, give a formula for the mean time required to satisfy a request if the hit rate is h. Plot this function for values of h varying from 0 to 1.0. Explain your logic and justify the structure of the formula.
A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).
Consider a file whose size varies between 2KB and 8MB during its lifetime. It is required that the file be accessible in the face of corrupted disk blocks. State, with reasons, whether or not the following block allocation schemes will be appropriate for implementing the file storage: contiguous, linked and table/indexed
This is the specification of the Toshiba MK5059GSXP internal hard drive: Calculate the average access time for the hard drives. Based on the specification in the Figure above, calculate the total seek time if you were to apply SSTF, SCAN, and C-SCAN algorithms on the hard disk. Assume that the read/write head is currently positioned at location 100 and is moving in the direction of increasing track number. The track requests in the disk queue are as follows: 153, 59, 65, 147, 168, 80, 89, 63 Based on your answer in (b), suggest and justify the algorithm that performs better disk scheduling in terms of: Fair service distribution ii. Disk throughput
Take into account the following scenario: we have a byte-addressable computer with 2-way set associative mapping, 16-bit main memory addresses, and 32 blocks of cache memory. Since there are 8 bytes in a block, you can use that information to calculate how big the offset field has to be.
Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk.?
Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer the following question: If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk?
1. Assume that a virtual memory is managed using a buffer pool. The buffer pool contains five buffers and each buffer stores one block of data. Memory accesses are by disk block ID. Assume the following series of memory accesses takes place. 5 2 5 12 3 6 5 9 3 2 4 1 5 9 8 15 3 7 2 5 9 10 4 6 8 5 2. For the following buffer pool, using the LRU replacement heuristic, show the disk block ID of the buffer pool as each disk block is called using the table below. Assume that the buffer pool is initially empty.
To what extent does disk write caching benefit from the following?
Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is.
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?