Scribd
Upload
115 views2 pages

School of Computer Science and Engineering, VIT University: Operating Systems (Cse-2005)

This document presents an improved scheduling algorithm for real-time systems. It begins with an introduction that describes scheduling objectives and criteria for real-time systems. It then discusses traditional round robin and priority scheduling algorithms and their disadvantages. The document proposes a new scheduling algorithm to address the issues with existing approaches. It includes sections that describe the proposed algorithm, provide code for the algorithm, compare its performance to other algorithms, and present output and conclusion.

Uploaded by

Yashwanth jonnagaddala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
115 views2 pages

School of Computer Science and Engineering, VIT University: Operating Systems (Cse-2005)

This document presents an improved scheduling algorithm for real-time systems. It begins with an introduction that describes scheduling objectives and criteria for real-time systems. It then discusses traditional round robin and priority scheduling algorithms and their disadvantages. The document proposes a new scheduling algorithm to address the issues with existing approaches. It includes sections that describe the proposed algorithm, provide code for the algorithm, compare its performance to other algorithms, and present output and conclusion.

Uploaded by

Yashwanth jonnagaddala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

OPERATING SYSTEMS ( CSE-2005 )

School of Computer Science and Engineering, VIT University

PROJECT TITLE : An Improved Scheduling Algorithm for Real Time Systems

CONTENTS Page No
1. ABSTRACT ……………………………………………………..( 01 - 04 )
I. Introduction: ………………………………………………( 01 - 02 )
II. SCHEDULING OBJECTIVES …………………………..( 02 - 03 )

III. SCHEDULING CRITERIA ………………………………( 03 - 04 )

2. ROUND ROBIN SCHEDULING ALGORITHM ………………( 04 - 05 ) 


3. PRIORITY SCHEDULING ALGORITHM………………….…..( 05 - 05 )

Disadvantage ………………………………………………..( 05 - 05 )

4. Our Contribution: ……………………………………………….( 05 - 05 )

5. Our Proposed algorithm: ………………………………………( 06 -06 )

6. Algorithm …………………………………………………………( 06 - 07 )

7. Code ……………………………………………………………..( 07 - 10 )

8. Comparison ……………………………………………………..( 10 - 10 )

9. Graph ( Comparison of WT and TAT ) ……………………….( 11 - 11 )

10. OUTPUT …………………………………………………….…..( 11 - 12 )

Low burst time ………………………………….……..…….( 11 - 11 )

High burst time ………………………………….…………( 12 - 12 )

11. Conclusion …………………………………………………….( 12 - 12 )

12 . REFERENCES ………………………………………………..( 13 - 14 )

You might also like