memory management, Operating System

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-preemptive scheduling
Process Name Arrival time Processing time Priority assigned
Process Arrival Processing Priority
Name time time assigned
1 0 5 3
2 2 3 5
3 5 8 1
4 9 2 6
5 12 5 4
Posted Date: 7/3/2012 12:15:34 PM | Location : United States







Related Discussions:- memory management, Assignment Help, Ask Question on memory management, Get Answer, Expert's Help, memory management Discussions

Write discussion on memory management
Your posts are moderated
Related Questions
What are the deadlock p revention methodologies? a.       Necessitate that processes request all resources before starting - if cannot be granted don't run. b.      Process

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


UNIX systems utilized to use disk-layout optimizations based on the rotation position of disk data however modern implementations including Linux simply optimize for sequential dat

what are the design issues of network OS

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 sat

PART A Question 1 Using your own words, explain what a continuous random variable and a continuous probability density function are. Give examples. Question 2 Gi

Q. The RC 4000 system as well as other systems have defined a tree of processes (called a process tree) such that all the descendants of a process are given resources (objects) as

As we have discussed, page tables map virtual page addresses to physical page addresses. One of the advantages of using virtual addresses is that we can achieve complete separation

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo