Dynamic scheduling, Operating System


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 priorities are determined during the run time of the system. The goal of dynamic scheduling is to calculate to dynamically modification progress and form an optimal configuration in self-sustained manner.


2479_Dynamic scheduling.png

Posted Date: 8/20/2012 3:34:47 AM | Location : United States

Related Discussions:- Dynamic scheduling, Assignment Help, Ask Question on Dynamic scheduling, Get Answer, Expert's Help, Dynamic scheduling Discussions

Write discussion on Dynamic scheduling
Your posts are moderated
Related Questions

p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 0014

What is preemptive and nonpreemptive scheduling? Under nonpreemptive scheduling once the CPU has been allocated to a process, the process keeps the CPU unless it releases the C

Q. Describe the purpose of the open() and close() operations. Answer: The open() operation notifies the system that the named file is about to become active. The c

Question: a) Windows Server 2003 has brought great enhancements the Server System as compared to the previous version. Write down short notes on the below listed enhancements.

The principle is that of ordinary addition; however remember the highest number is 1.   Calculate the following:                             11001 +                           11

Q. What is the major difficulty that a programmer should overcome in writing an operating system for a real-time environment? Answer: The major difficulty is keeping the oper

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

Write a Perl script assignGrades.pl to assign letter grades to the students.