Ask Question, Ask an Expert

+1-415-315-9853

info@mywordsolution.com

Ask Computer Engineering Expert

Part I: TRUE OR FALSE

Storage and file systems

1. The peak read bandwidth of a RAID-4 array grows linearly with the number of disks, but the single parity disk limits the peak prepare bandwidth.

2. Doubling the rotation speed of a 10K RPM (rotations per minute) disk doubles its peak transfer bandwidth, but improves its throughput for random 8KB reads only marginally.

3. Doubling the bit density of a 10K RPM disk doubles its peak transfer bandwidth, but improves its throughput for random 8KB reads only marginally.

4. You have a system with two primary workloads. One performs sequential access to a set of large files; the other performs small, independent, random reads to a separate set of large files. To satisfy these two workloads, you have a set of 4 disks. Both applications can saturate the peak bandwidth of your disk subsystem (i.e., they are I/O bound). Each disk can provide 100MB/s and has an average seek time of 10ms. The best way to organize data on these disks in order to provide the best performance for the random workload is to mirror the disks (that is, store 4 identical replicas on the 4 disks).

5. A log-based file system can deliver data at close to the peak transfer bandwidth of its disk system, independent of which files or directories are being accessed.

6. A log-based file system can perform prepares and updates at close to the peak transfer bandwidth of its disk system, independent of which files or directories are being updated.

7. To preserve data integrity, file system software must control the order in which disk prepares complete.

8. Swap space allocated as a special region (partition) on the disk can be faster than if allocated as a special file because it avoids file system costs due to disk organization.

9. A stateful file service recovers faster after a crash because all state information is stored locally, while a stateless file service needs to bring state information from a distant node.

10. AFS/Ceph (answer for the one you read) provides a stateful file service.

Distributed coordination

11. The centralized approach to deadlock detection in a distributed system requires a larger number of messages than a decentralized approach (which is the reason why decentralized solutions are always preferred).

12. An election algorithm for a bidirectional ring can be more efficient than the one presented in the textbook for the unidirectional ring.

13. A deadlock detection scheme is always more efficient than a deadlock prevention scheme in distributed systems.

14. Events in a distributed system can be globally ordered in time using the happened-before relationship presented in Lamport’s paper.

15. In a distributed system deployed over the Internet, agreement among n processes can be reached always in constant x (n+1) rounds of communication.

Part II: ELABORATE

16. You have a system with two primary workloads. One performs sequential access to a set of large files; the other performs small, independent, random reads to a separate set of large files. To satisfy these two workloads, you have a set of 8 disks. Both applications can saturate the peak bandwidth of your disk subsystem (i.e., they are I/O bound). Each disk can provide 100MB/s and has an average seek time of 10ms.

a. How should you organize these disks and lay out your data to provide best performance for the sequential workload?

b. How should you organize these disks and lay out your data to provide best performance for the random workload?

c. If you want to run both applications simultaneously and achieve the maximum average bandwidth for each application, how should you organize these disks and data?

d. Suppose the random reads are dependent, in that each request cannot be submitted before the previous one completes. Does this change the answer to problem c)? If so, how?

17. Distributed file systems:

e. Most distributed file systems cache recently used file data in client memory. What are the performance benefits of file caching? What are the performance costs?

f. File caching introduces the problem of cache consistency when files are shared across the network.
describe the problem and demonstrate it with an ex.

g. Outline a plausible scheme for dealing with the problem of cache consistency in a distributed file system. You may ignore the problem of failures in your answer (but see next problem). Your scheme need not be identical to that used in any specific distributed file system.

h. What are the limitations of the file caching scheme you described for previous problem? describe how your scheme can handle failures (crashes), assuming that systems fail only by stopping, discarding the contents of their memory, and restarting.

18. Problem 18.8 Silberschatz.

19. Clocks in distributed systems:

a. Why are clocks difficult to synchronize in distributed systems?

b. What features in a system assume that the clocks are (reasonably) synchronized? Give two exs of cases where a problem would occur if the clocks were not synchronized.

c. Order the following events based on the figure below according to the happened before relationship as introduced by Lamport. Consider that the vertical lines represent events in a process ordered chronologically from bottom up (that is, time grows going up on the axis).
- p3, q3, q5, r3
- r1, q4, r4
- p1, q3, r3, r4

928_lampot layout.jpg

20. Consider a setting where processors are not associated with unique identifiers but the total number of processors is known and the processors are organized along a bidirectional ring. Is it possible to derive an election algorithm for such a setting?

Computer Engineering, Engineering

  • Category:- Computer Engineering
  • Reference No.:- M91491

Have any Question? 


Related Questions in Computer Engineering

1 what is a vulnerability what do you understand by a

1. What is a vulnerability? What do you understand by a system vulnerability? 2. Discuss four sources of system vulnerabilities. 3. What are the best ways to identify system vulnerabilities? 4. What is innovative misuse? ...

Assume a tcp client is expecting to receive byte 3001 it

Assume a TCP client is expecting to receive byte 3001. It receives a segment with the sequence number 3001 that carries 400 bytes. If the client has no data to be sent at this moment and has acknowledged the previous seg ...

Describe the dbas responsibilities how can the dba function

Describe the DBA's responsibilities. How can the DBA function be placed within the organization chart? What effect(s) will such placement have on the DBA function? What is Business Intelligence (BI)? Give some recent exa ...

Based on klamaths requirements select some network

Based on Klamath's requirements, select some network optimization technologies that will help maintain video quality for the distance-learning program. Based on Figure 11-6, "New Core WAN at Klamath," draw a network topo ...

Get the instructions for last years form 1040 from

Get the instructions for last year's form 1040 from http://www.irs.ustreas.gov. Find the tax brackets that were used last year for all categories of taxpayers (single, married filing jointly, married filing separately, a ...

Why are system safety principles not used by all safety

Why are system safety principles not used by all safety professionals? Suggest some ways to overcome the obstacles to wider adoption of system safety. Your response must be at least 75 words in length

1 a network consists of n hosts assuming that cryptographic

1. A network consists of n hosts. Assuming that cryptographic keys are distributed on a per-hostpair basis, compute how many different keys are required. 2. One cryptographic checksum is computed by applying the DES in C ...

Take a 512 x 512 image containing noise design low-pass

Take a 512 x 512 image containing noise. Design low-pass, band-pass, and high-pass zonal masks in different transform domains such that their passbands contain equal energy. Map the three filtered images into R, G, B col ...

The first few numbers of the lucas sequence which is a

The first few numbers of the Lucas sequence which is a variation on the Fibonacci sequence are: 1  3  4  7  11  18  29 ... Design an algorithm to generate the Lucas sequence.

1 discuss the risks to the protected internal network as a

1. Discuss the risks to the protected internal network as a result of a DMZ. 2. What is a bastion router? How different is it from a firewall? 3. Search and discuss as many services and protocols as possible offered by a ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro

Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen