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
shell script that accepts two directory names as arguments and delete those file in the second directory that are identical to the file in the first

Question : (a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The

Which is most common phase structured grammar? Most common phase structured grammar is Context – Sensitive

Q. What is the purpose of system calls? Answer: System calls permit user-level processes to request services of the operating system.

Windows admin need it Project Description: We want to protect an executable on operating system level , so the process could be visible among all users while the executable r

With software algorithms for mutual exclusion, such as Dekker's algorithm, Peterson's algorithm, or Lamport's bakery algorithm, note that optimizing compilers and out-of-order exec

Q. How does DMA raise system concurrency? How does it make difficult hardware design? Answer: DMA increases system concurrency by allowing the CPU to perform tasks while the

Deadlocks can be detected while the program is running, by running cycle detection algorithms on the graph that de?nes the current use of resources. De?ne this graph as follows:

Dynamic scheduling : The number of thread in a program may be changed during the course of operation. Dynamic priority scheduling is a kind of scheduling algorithm in which the pr

Q. Capability lists are typically kept within the address space of the user. How does the system make sure that the user cannot modify the contents of the list? Answer: An ap