Nitin Ranjan
11/16/2010
ROLL:-C2802B35 REGN NO:-10805970
[ In the below project there is the explanation of the process algorithms used in UNIX and LINUX and there comparison..]
INDEX
1. Introduction
2. Introduction to unix
3. Unix scheduling algorithms
4. Problems in Unix scheduling
5. Introduction to linux
6. Linux process scheduling
7. Conclusion
8. Acknowledgement
9. References
ACKNOWLEDGEMENT
I wish to express my deepest gratitude and warmest appreciation to the following people, who, in any way have contributed and inspired me to the overall success of the undertaking term paper: KAVITA CHOUDHARY MADAM who had assigned me this job to enhance my knowledge, my parents who had been the continuous source of financial aid and moral support and then my roommates who helped me to complete my work on time.
NITIN RANJAN
INTRODUCTION
1. WHAT IS PROCESS SCHEDULING?
To manage all the processes in ready queue for the maximum utilization of CPU, this job is done by process scheduler on the basis of scheduling algorithms. Scheduling is a key concept in computer multitasking, multiprocessing operating system and real-time operating system designs. Scheduling refers to the way processes are assigned to run on the available CPUs, since there are typically many more processes running than there are available CPUs. This assignment is carried out by softwares known as a scheduler and dispatcher.
2. WHAT IS PROCESS SCHEDULER?
It takes the job from the ready queue and dispatch it to CPU according to scheduling algorithms
Scheduler is mainly concerned with:
a) CPU