Calculate maximum average bandwidth, Operating System

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 question c)? If so, how?

 

Posted Date: 4/2/2013 2:00:36 AM | Location : United States







Related Discussions:- Calculate maximum average bandwidth, Assignment Help, Ask Question on Calculate maximum average bandwidth, Get Answer, Expert's Help, Calculate maximum average bandwidth Discussions

Write discussion on Calculate maximum average bandwidth
Your posts are moderated
Related Questions
Direct memory access Many computers avoid burdening the main CPU with programmed I/O by offloading sine if this work to a special-purpose processor known as a direct memory add

Recall that condition variables are synchronization primitives that enable threads to wait until a particular condition occurs. Generalizing, the combination of locks and condit

Write a short note on file organization and access. There are three methods to access files 1Record Access 2Sequential Access 3Random Access The record access

EXPLAIN MULTITASKING IN DETAIL

What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Init

Long term scheduling Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it cont

Did Abhinav agree to the initial timeline requested by Rebecca

What are the different directory structures? Explain each type. There are five dissimilar directory structures: 1.      Single level directory 2.      Two level directory