consider a data base system applying replication on logs, assuming each transaction on average accesses the hard disk once and generates 20 KB of log data. Calculate the time overhead for two and three-way replications. What if the transaction is executed in - memory and takes 1 \mu s. 2 way with latency of 20us and bw of 100 MB/s, and 3 way latency of 200us and bw 10 MB/s.

consider a data base system applying replication on logs, assuming each transaction on average accesses the hard disk once and generates 20 KB of log data. Calculate the time overhead for two and three-way replications. What if the transaction is executed in - memory and takes 1 \mu s. 2 way with latency of 20us and bw of 100 MB/s, and 3 way latency of 200us and bw 10 MB/s.

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

Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the read write head is initially at track 53, what is the total distance that the disk are moves to satisfy all the pending request for C-SCAN? E E E E E ΣΕ GHO
Consider a disk queue with requests for I/O to blocks on cylinders.98 183 37 122 14 124 65 67. "Considering SSTF (shortest seek time first) scheduling", the total number of head movements is, if the disk head is initially at 53 is?
Consider a file system that uses contiguous allocation method. For a disk consists of 100 data blocks, each block is 4KB. What is the maximum and minimum number of files of size 15KB can it save? Find the number of files the disk able to support using (1) link allocation and (2) index allocation, assuming the address is 32 bit.
Describe the working of recursive and iterative queries in DNS. Use figures for the description. A file of F = 3 x 105 bits is distributed to N peers. The server has an upload rate of us = 1 x 105 bps. Each peer has a download rate of di = 1 x 105 bps and an upload rate of u = 30,000 bps. For N = 1 to 10, and for both client-server and P2P architectures, plot a single graph with minimum distribution time on the y-axis and N on the x-axis. Use a table to show all the values for N = 1 to 10 and use the values to plot the graph. Clearly show the calculation only for N = 1, 2, and 3. Explain at least one P2P application (BitTorrent or DHT) in detail.
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KB data, and an initial 2 × RTT of "handshaking" before data is sent: (a) The bandwidth is 10 Mbps, and data packets can be sent continuously. (b) The bandwidth is 10 Mbps, but after we finish sending each data packet we must wait one RTT before sending the next. (c) The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT.
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.
Suppose we have a disk with an average seek time of 10ms, average rotational delay of 5ms, anda transfer time of 1ms for a 4K page. Assume that the cost of reading/writing a page is the sumof those values (i.e., 16ms) unless a sequence of pages is read/written. In this case, the cost is theaverage seek time plus the average rotational delay (to find the first page) plus 1ms per page (totransfer data). You are given 320 buffer pages and asked to sort a file with 10^7 pages. Make theassumptions used in Section 13.3 of the textbook. Find the cost of the following operations:A) Do 319-way merges on 319 input buffers of 1 page each, and 1 output buffer page.B) Do 256-way merges on 256 input buffers of 1 page each, and output buffer of 64 pages.C) Do 16-way merges on 16 input buffers of 16 pages each, and output buffer of 64 pages.
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The bandwidth is 10 Mbps, and data packets can be sent continuously. The bandwidth is 10 Mbps, but after we finish sending eachdata packet we must wait one RTT before sending the next.
Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3, 11, 75, 185, 110, 87, 93. Using the SSTF scheduling algorithm, a) What is the order that the requests are serviced, assuming the disk head is at cylinder 100?
Consider a file system that uses indexed file allocation. Disk block size is 1K-byte, and a file pointer is 64 bits (8-bytes). If we assume that an i-node just holds 2 direct entries and 4 single indirect entries, what is the maximum size of a file the system can allow? List the steps that lead to your conclusion.
Consider a disk drive that cab complete an average request in 10ms. The time to complete a request is approximately distributed.Over a period of 30minutes, 117,000 request were made to the disk.How long will it take to complete the average request and what is the average number of queued request?
Consider a paging memory allocation whose page size is 5KB and one word is equalto 8 Bytes. Answer these three sub-questions. How many words are there in one page? What are the page number and page offset for this logical address: 33124? Consider a process of 41500 Bytes being allocated into the main memory by this pagingmemory allocation. How much is the size of internal fragmentation (in the unit of Bytes)?