Scribd
Upload
787 views

CPU Scheduling Algorithms Simulation Using Java

Kaushal Sinha implemented four scheduling algorithms - First Come First Serve, Round Robin, Shortest Job First, and Shortest Remaining Time. Java was selected as the programming language due to its rich GUI classes, object orientation, documentation capabilities, and popularity. The document concludes with an invitation for questions.

Uploaded by

Comrade Beckenbauer
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
787 views

CPU Scheduling Algorithms Simulation Using Java

Kaushal Sinha implemented four scheduling algorithms - First Come First Serve, Round Robin, Shortest Job First, and Shortest Remaining Time. Java was selected as the programming language due to its rich GUI classes, object orientation, documentation capabilities, and popularity. The document concludes with an invitation for questions.

Uploaded by

Comrade Beckenbauer
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 13

| 

 

 
 



Kaushal Sinha
CSC 4320
Spring 2007
| 
 

 
 



 ple ented the following


Scheduling algorith s

 ¦irst Co e ¦irst Serve (¦C¦S)


 Round Robin
 Shortest Job ¦irst
 Shortest Re aining Ti e
| 
 

 
 



¦ ¦  
 ¦¦
This non-pree ptive scheduling algorith
follows the first-in, first-out (¦¦ ) policy.
As each process beco es ready, it joins the
ready queue. When the current running
process finishes execution, the oldest
process in the ready queue is selected to
run next.
| 
 

 
 



ë ë  ëë

 RR is designed specially for ti e-sharing syste s.


 t is si ilar to ¦C¦S but pree ption is added to
switch between processes.
 A s all unit of ti e, called a ti e quantu or
ti e slice, is defined.
 The ready queue is treated as a circular queue.
The CPU scheduler goes around the ready queue,
allocating the CPU to each process for a ti e
interval of up to 1 ti e quantu .
| 
 

 
 



ë ë  ëë  
 The i ple entation of RR is easily anaged with a
¦¦ ready queue.
 The CPU is allocated to the process at the head the
ready queue. Then, one of two things will happen. f
the process has a CPU burst of less than 1 ti e
quantu , the process itself will release the CPU
voluntarily. The CPU is then assigned to the next
process in the ready queue. therwise, if the CPU
burst of the currently running job is longer than 1
ti e quantu , the process is pree pted after 1
ti e quantu and put at the tail of the ready
queue. The CPU is then assigned to the next process
in the ready queue.
| 
 

 
 



¦  ¦
This non-pree ptive scheduling algorith
favors processes with the shortest
expected process ti e. As each process
beco es ready, it joins the ready queue.
When the current running process finishes
execution, the process in the ready queue
with the shortest expected processing
ti e (or service ti e) is selected to run
next.
| 
 

 
 



ë    ë


This pree ptive scheduling algorith
favors processes with the shortest
re aining expected process ti e. As each
process beco es ready, it joins the ready
queue. This triggers an interrupt which
pree pts the current running process
back into the ready queue. The process in
the ready queue with the shortest
re aining service ti e is selected to run
next.
| 
 

 
 



Selection of JAVA as a progra ing tool

 Rich GU classes available (Swing, AWT)


 bject rientation capabilities
 Convenient and powerful docu entation
capabilities
  like it
| 
 

 
 


| 
 

 
 


| 
 

 
 


| 
 

 
 



 e onstration
| 
 

 
 



]uestions

You might also like