Determine the turnaround time for each process

Assignment Help Basic Computer Science

Reference no: EM131212011

Five batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6, and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 7, 9, and 4 respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the turnaround time for each process and the average turnaround for all jobs. Ignore process switching overhead. Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound.

a. round robin with a time quantum of 1 minute

b. priority scheduling

c. FCFS (run in order 15, 9, 3, 6, and 12)

d. shortest job first

Reference no: EM131212011

Questions Cloud

Using the weighted-average method : A company's beginning Work in Process inventory consisted of 24,000 units that were 90% complete with respect to direct labor. A total of 94,000 were finished during the period and 29,000 remaining in Work in Process inventory were 60% complete with ..

The modified units to make it worthwhile to modify them : Elmwood, Inc. currently sells 12,700 units of its product per year for $107 each. Variable costs total $82 per unit. Elmwood’s manager believes that if a new machine is leased for $200,025 per year, modifications can be made to the product that will ..

What does it mean if a task has negative laxity : Suppose a task currently has a laxity of t. By how long may the scheduler delay starting this task and still meet its deadline?

Define the critical task set as the first n tasks : Among critical set tasks that are ready, the scheduler selects the task with the least laxity. If no critical set tasks are ready, the schedule chooses among the noncritical tasks the one with the least laxity. Ties are broken through an optional ..

Determine the turnaround time for each process : Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound.

List and briefly define three versions of load sharing : List and briefly define five different categories of synchronization granularity.

Difference between periodic and aperiodic real-time tasks : List and briefly define five general areas of requirements for a real-time operating system.

Create a marketing display for your company : In the Cookie Company case in the last chapter, your team selected a cookie recipe for your company. In this chapter, your team will use that recipe to bake a batch of cookies, collect cost and time performance data related to the baking, create a ma..

What undesired event could occur and how it could occur : Explain this by telling what undesired event could occur and how it could occur.

User Account

All Pages