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
Write a note on the usage of semaphores. Semaphore is a synchronization tool and it is a variable having integer values. It is accessed only by two standard atomic operations w

What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti

Explain the OS/2 Operating System Like NetWare, OS/2 manage resources at three levels, as shown in Figure 4.5 Resources may be maintained at the session, process, and thread le

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. With the notes under code. Its exactly "programming project 1 - Unix Shell and History Fea

Describe the differences among short-term, medium-term, and long-term scheduling.   Short-term (CPU scheduler)-selects from jobs in memory those jobs that are ready to execu

FIRST FIT ALGORITHM Scanning a list along with if a free hole is available with necessary space for the process to allocate it allocates the process in that space. The first s

What is a thread? A thread or else called a lightweight process (LWP) is a basic unit of CPU utilization, it comprises of a thread id, a program counter, a register set and a s

Is it probable to have a deadlock involving only one single process? Describe your answer. Answer: No This pursue directly from the hold-and-wait condition.

What are the system components of an operating system and explain them? a) Process management b) Main-memory management c) I/O management d) File management e) Seco