Categories of Scheduling Algorithms
{"Image DocumentName": "Categories of Scheduling Algorithms", "Image ImageDescription": "Batch Systems, Non Preemptive algorithms, or Preemptive algorithms with long time periods for each process are often acceptable. This approach reduces process switches and thus improves performance. Interactive Users, preemption is essential to keep one process from hogging the CPU and denying service to the others. Preemption is needed to prevent this behaviour. Real-time Constraints, Preemption is, oddly enough, sometimes not needed because the processes know that they may not run for long periods of time and usually do their work and block quickly. The difference with interactive systems is that real-time systems run only programs that are intended to further the application at hand. Interactive systems are general purpose and may run random programs that are not cooperative or even harmful. Intro To OS, Chapter 2 By Rana Umer.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}