classification of schedulers
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
jothi
Active In SP
**

Posts: 1
Joined: Jul 2010
#1
19-07-2010, 07:33 PM


ieee project and implimentation for classification of schedulers
Reply
projectsofme
Active In SP
**

Posts: 1,124
Joined: Jun 2010
#2
22-09-2010, 12:19 PM

ABSRTACT




There are four types of schedulers.they are long-term scheduler,mid-term scheduler,short-term scheduler and dispatcher.
The long-term, or admission, scheduler decides which jobs or processes are to be admitted to the ready queue; that is, when an attempt is made to execute a program, its admission to the set of currently executing processes is either authorized or delayed by the long-term scheduler.Without proper real time scheduling, modern GUI interfaces would seem sluggish.


The mid-term scheduler temporarily removes processes from main memory and places them on secondary memory (such as a disk drive) or vice versa. This is commonly referred to as "swapping out" or "swapping in" (also incorrectly as "paging out" or "paging in"). The mid-term scheduler may decide to swap out a process which has not been active for some time, or a process which has a low priority, or a process which is page faulting frequently, or a process which is taking up a large amount of memory in order to free up main memory for other processes, swapping the process back in later when more memory is available, or when the process has been unblocked and is no longer waiting for a resource.


The short-term scheduler (also known as the CPU scheduler) decides which of the ready, in-memory processes are to be executed (allocated a CPU) next following a clock interrupt, an IO interrupt, an operating system call or another form of signal. Thus the short-term scheduler makes scheduling decisions much more frequently than the long-term or mid-term schedulers - a scheduling decision will at a minimum have to be made after every time slice, and these are very short. This can be preemptive or non preemptive.


Another component involved in the CPU-scheduling function is the dispatcher. The dispatcher is the module that gives control of the CPU to the process selected by the short-term scheduler. This function involves the following:

Switching context
Switching to user mode
Jumping to the proper location in the user program to restart that program

The dispatcher should be as fast as possible, since it is invoked during every process switch. The time it takes for the dispatcher to stop one process and start another running is known as the dispatch latency.
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
Thumbs Down fuzzy self constructing feature clustering algorithm for text classification Guest 1 514 20-03-2013, 10:34 AM
Last Post: study tips
  fuzzy self constructing feature clustering algorithm for text classification ramya k s 1 729 05-02-2013, 10:07 AM
Last Post: Guest
  fault classification in transmission lines sravanichweety 0 337 22-09-2012, 08:38 PM
Last Post: sravanichweety
  iris classification using radial basis function network Guest 0 416 13-07-2012, 11:16 AM
Last Post: Guest
  attack classification in ids using ensemble approach sona3010@gmail.com 0 807 21-03-2012, 12:02 AM
Last Post: sona3010@gmail.com
  Project idea on Ontology Classification for Semantic-Web-Based Software Engineering victer 0 976 30-10-2011, 05:35 AM
Last Post: victer
  SEMISUPERVISED NEAREST NEIGHBOUR TECHNIQUE: AN APPLICATION TO PIXEL CLASSIFICATION debosmita29 0 633 05-04-2011, 09:05 PM
Last Post: debosmita29