Operating Systems Discusion

Part 1 Discusion post: Optimization

Do you think that it is possible to optimize the design of a process scheduling policy to suit any system? (i.e. One policy works for every situation?)

Part 2 Respond to two peers posts

Peer 1 Reese

Based on past experiences in networking, and my current knowledge level of computer systems I do not think it is possible to optimize a process scheduling policy to meet all system requirements.  Much like “all in one” network appliances, an all in one policy would work for many systems, however I do not think it would work for all.  For example, in a self-driving car, utilizing a shortest job next algorithm my not be the best route to take if a breaking process is longer than adjusting the volume of the radio to overcome road noise.  In the example I give, priority scheduling would work better.  Every system will have different requirements, and will need to look at process scheduling that will best meet the intended uses of the system. 

Peer 2 Megan

I do  not think it is possible to create one scheduling policy that will solve every situation and suit every system. We see that with some of the scheduling policies, the initial policy is followed then when two jobs come up with the same priority then it follows a different scheduling policy. For example, priority scheduling provides preferential treatment to jobs with a higher priority. What happens when two jobs come with the same priority level? then first come first served is used. Essentially unless there is a scheduling policy that incorporates EVERY SINGLE policy then we won't be able to have one for every system.