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
Explain DosCreateThread Functions Used in the OS/2  DosCreateThread(&threadID,MyThreadFunction,arg,flags,stackSize) DosCreateThread creates a thread within the context of th


explain how indefinite blocking or starvation occurs..

Single level directory: This is the easiest directory structure. All the files are controlled in the same directory, which is simple to support and understand. Few of the li

Define Coding in an independent service architecture Coding in an independent service architecture alleviates many of the traditional dependencies of monolithic applications.


Note that the parameter for scanf doesn't need the address operators & because name is an address. However the variable name has no defined space. This can cause problems within C

categorize the CPU scheduling algorithms and among them explain the non-preemptive algorithms..

In a  p system each part (RAM, ROM, I/O) has a unique set of numbers. The allocation of these numbers is usually stated in the form of a memory map. This is a plot of data bus agai

Q. Remapping of bad blocks by sector sparing or else sector slipping could influence performance. Presume that the drive in Subsequent Exercise has a total of 100 bad sectors at r