Question

1. Assume that we start with no relevant data in the buffer in main-memory, and the...

1. Assume that we start with no relevant data in the buffer in main-memory, and the database system reads a data item, updates it, and writes it back to disk. Assume the data item fits in one disk block.

(a) How may disk reads and writes would a RAID-5 storage system have to perform to implement this? Explain.

(b) How may disk reads and writes would a RAID-1 storage system have to perform to implement this? Explain.

(c) Having calculated the cost for RAID-1 and RAID-5, explain whether the RAID alternative with the fewer input/output operations is necessarily the better design choice.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

RAID level 5, block-interleaved distributed parity, improves on level 4 by partitioning data and
parity among all N + 1 disks, instead of storing data in N disks and parity in one disk. In level 5,
all disks can participate in satisfying read requests, unlike RAID level 4, where the parity disk
cannot participate, so level 5 increases the total number of requests that can be met in a given
amount of time. For each set of N logical blocks, one of the disks stores the parity, and the other
N disks store the blocks.

Add a comment
Know the answer?
Add Answer to:
1. Assume that we start with no relevant data in the buffer in main-memory, and the...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Based on the error corretion algorithm discussed in ch6, Assume data are processed in 2048 bits,...

    Based on the error corretion algorithm discussed in ch6, Assume data are processed in 2048 bits, in order to perform SEC-DED (single error correction and double error detection), what is the best length of the check bits? Question 5 options: A 13 B 14 C 11 D 12 Question 6 (3 points) Consider a magnetic disk drive with 8 double sided platters, 2000 tracks per disk surface. Each track has a capacity 2048 KBytes. Sector size is 2KBytes. Each disk...

  • Homework 13: In a file system using metadata journaling for crash consistency, what would the sequence...

    Homework 13: In a file system using metadata journaling for crash consistency, what would the sequence of write operations be to disk to create “file100” in the directory structure in Homework 11? How would it differ from that of data journaling? Using the same format as for Homework 12, identify what data or metadata is written and where it is being written. Format of HW12 Journal Write: Transaction Begin(TxB) record, file X data 1. 2. 3. 4. HW11 for reference...

  • Let's start with a memory system that is byte addressable and has 14-bit addresses. Now let's...

    Let's start with a memory system that is byte addressable and has 14-bit addresses. Now let's add a direct mapped cache that can hold 16 blocks (or has 16 lines) and each block is 4 bytes. The table shoun below details the contents of the cache at a particular point in time. if the valid bit is 1 there is a cache block loaded into the cache with Tag as detailed in the tag column. The columns B0-D3 then show...

  • Question 1 (5 marks) Consider two relations called Item and Orderltem. Imagine that relation Item has 160,000 tuples and Orderltem has 200,000 tuples. Both relations store 100 tuples per a page....

    Question 1 (5 marks) Consider two relations called Item and Orderltem. Imagine that relation Item has 160,000 tuples and Orderltem has 200,000 tuples. Both relations store 100 tuples per a page. Consider the following SQL statement SELECT * FROM Item INNER JOIN OrderItem ON Item.ItemID-OrderItem. ItemID; We wish to evaluate an equijoin between Orderltem and Item, with an equality condition Item.ltemID Orderltem.ItemID. There are 802 buffer pages available in memory for this operation. Both relations are stored as (unsorted) heap...

  • Operating Systems Questions (Please help if you can) 1. A computer has cache, main memory, and...

    Operating Systems Questions (Please help if you can) 1. A computer has cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, 20ns are required to access it. If it is in main memory but not in the cache, 60ns are required to load it into the cache (this includes the time to originally check the cache), and then, the reference is started again. If the word is not in main memory,...

  • We would like to develop a database to manage all the data relevant to students and...

    We would like to develop a database to manage all the data relevant to students and faculty at Virginia Tech. For each department, we have a department ID and name. The students enroll in departments. Each student will have a hokie ID, birthdate, gender, photo in the system. The department will hire multiple faculty members to teach courses. Each faculty member will have faculty hokie ID, research (including papers, patents, etc), gender, birthdate. The department will determine (1) what courses...

  • 1. Assume we have a size-of-24-bytes data memory as shown in Figure 1. How does int...

    1. Assume we have a size-of-24-bytes data memory as shown in Figure 1. How does int arr3) = {19088743, 2882400001, 169552957) get stored (assume arr[0] points to oth location)? Hints: Endianness. Report the following in your report. 23 22 1 0 Figure 1: Endianness (a) How much space (in byte) does one integer occupy considering a RISC-V architecture? (b) Draw the data mapping. 2. Continuing with 1, what is the value of x10 (assume x23 =0)? Id x8, 0(x23) Id...

  • 18. You have a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associati...

    18. You have a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of 8 bytes and page size of 16 bytes. In the system below, main memory is divided into blocks, where each block is represented by a letter. Two blocks equal one frame. Given the system state as depicted above, answer the following questions: a) How many bits are in a virtual address...

  • 1 Overview The goal of this assignment is to help you understand caches better. You are...

    1 Overview The goal of this assignment is to help you understand caches better. You are required to write a cache simulator using the C programming language. The programs have to run on iLab machines. We are providing real program memory traces as input to your cache simulator. The format and structure of the memory traces are described below. We will not give you improperly formatted files. You can assume all your input files will be in proper format as...

  • 1. It is said that the amount of digital data is doubling every two years. Discuss...

    1. It is said that the amount of digital data is doubling every two years. Discuss 4 implications and issues associated with this rapid growth of data. [20 marks) 2. Use your imagination and creativity to describe how virtual reality might be used to help students learn in one of your most challenging courses. [20 marks] 3. Your manager has asked for your input on ideas for how to improve the likelihood of successful adoption of a new information system...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT