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 is the latest OS of ANDROID in US

File System Interface and Implementation The Nachos file system, as distributed, uses a single-level index allocation method for data allocation of files. In the current design,

i need the job to be done within 3days

Q. What is Multiprogramming? Multiprogramming When two or more programs are in memory at the same instance, sharing the processor is referred to multiprogramming opera

SEGMENTATION In a memory management system that is properly a programmer views a program to be collection of program components called as segments . Every segment is a logical

Q. Explain a mechanism by which one segment could belong to the address space of two different processes. Answer: Because segment tables are a collection of base-limit register

Determine a scheduling policy that is most suitable for a time-shared operating system   Round-Robin is a scheduling policy that is most suitable for a time-shared operating s

What is an I/O subsystem? The control of devices connected to the computer is a main issue while designing operating systems. Because I/O deices differ widely in their function

Give a brief introduction about the operation of your program and show that you understand the idea behind threads and mutual exclusion variable. Why do we need to use mutual exclu

You must use fork and pipe to complete this project. This project creates processes to add all numbers in a file. The user will enter a number (1, 2, or 4) of parallel processes