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
What is the hardware support required to implement paging? Each operating system has its own techniques for storing page tables. The majority allocates a page table for each pr

Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given  unique priorities.

Question: (a) Red Hat Linux is distributed under the Open Source agreement. Explain what you understand by Open Source distribution system. (b) Write a short note on the L

We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system to forsake this principle and to

What lead to the concept of paging? The main memory is separated into two parts that are one for the resident operating system, and one for the user processes. We may perhaps p

What are the different ways in which a thread can be cancelled? Cancellation of a target thread may happen in two different scenarios: Asynchronous cancellation: One thr


The term thread-safe in computer programming describes that routine or portion of the program that may be called from multiple programming threads without uncalled for interactions

The different paging techniques are 1. Multilevel paging or hierarchical paging method: In definite cases the page table may consist up to 1 million entries. This would be

Q. What are the advantages as well as disadvantages of using circuit switching? For what types of applications is circuit switching a viable strategy? Answer: Circuit