Table of Contents
CHAPTER ONE: INTRODUCTION
1.1 BACKGROUND OF THE STUDY .
1.2 PROBLEM STATEMENT ..
1.3 JUSTIFICATION OF THE STUDY
1.4 AIM AND OBJECTIVES .
1.5 SCOPE …
1.6 METHODOLOGY .
CHAPTER TWO: LITERATURE REVIEW ..
2.1 THEORITICAL FRAME WORK ..2.2 MULTIPROGRAMMING
2.3 SCHEDULING
2.3.1 Job Scheduling Versus Process Scheduling
2.4 PROCESS SCHEDULER
2.5 JOB AND PROCESS STATUS
2.6 PROCESS CONTROL BLOCKS
2.6.1 Process Identification
2.6.2 Process Status…
2.6.3 Process State ..
2.6.4 Accounting ….
2.7 PCBs AND QUEUING .
2.8 PROCESS SCHEDULING POLICIES .
2.9 PROCESS SCHEDULING ALGORITHMS
2.9.1 First-Come First Served
2.9.2 Shortest Job Next
2.9.3 Priority Scheduling
2.9.4 Shortest Remaining Time
2.9.5 Round Robin
2.10 STATIC RR VERSUS DYNAMIC RR SCHEDULING TECHNIQUE
2.11 CONTEXT SWITCHING
2.12 REVIEW OF VARIOUS DYNAMIC RR CPU SCHEDULING TECHNIQUE
CHAPTER THREE: DESIGN OF A MODIFIED MEDIAN ROUND ROBIN ALGORITHM
3.1 INTRODUCTION .
3.2 MMRRA ALGORITHM.
3.3 MMRRA FLOW CHART
3.4 EVALUATION: CLASSICALRR, IRR, IMRR, HLVQTRR, DRRCP & MMRRA
3.4.1 Generated data from the proposed algorithm .
3.4.2 Generated data from DRRCP..
3.4.3 Generated dada from IMRRSJF
CHAPTER FOUR: EVALUATION OF THE DESIGNED MMRRA .
4.1 INTRODUCTION ..
4.2 DESCRIPTION OF THE SIMULATION ..
4.3 PSEUDOCODE FOR THE SIMULATION ..
4.4 EVALUATION CRITERIA …
4.5 ALGORITHM EVALUATION ..
4.6 DISTRIBUTION FUNCTION USED .
4.7 ALGORITHM FOR THE EXPONENTIAL DISTRIBUTION .
4.8 THE BEST WAY OF CHOOSING PERCENTAGE (for a method) .
4.9 PRESENTATION OF RESULTS.
4.10 DISCUSSION OF RESULTS.
CHAPTER FIVE: SUMMARY, CONCLUSION AND RECOMMENDATION
5.1 SUMMARY
5.1.1 Advantage of MMRRA over IMRRSJF
5.1.2 Advantage of MMRRA over HLVQTRR.
5.1.3 Advantage of MMRRA over DRRCP .
5.1.4 Advantage of MMRRA over IRR ..
5.1.5 Some Major Challenges of DYNAMIC RR Algorithms.
5.1.6 Critisism With Respect To Context Switching On Most Of the proposed Round Robin Algorithms reviewer
5.2 CONCLUSION .
5.3 RECOMMENDATION ..
REFERENCES .
Appendix : Source code .