KornShell (ksh) Scheduling Algorithms (SRT)
I'm still relatively new to stack overflow and was naive to the thoughts and opinions about homework assignments. I was debating on removing the question, but after reading this post( https://meta.stackexchange.com/questions/10811/how-to-ask-and-answer-homework-questions ), I decided my question fits the guidelines and therefore is worthy of keeping up.
I figured out the Shortest remaining time algorithm. I am thankful that no one answered this question, figuring out the algorithm on my own (with some help from my TA) was worth it. Therefore, my provided answer will have the basic pseudo logic and no actual code.
shortest = the first process read from the input(assuming it has already arrived)while there are still processes to be run process = next process (out of processes that have not completed yet) if (process arrival time <= currentTime) #process arrived if (process execution time < shortest execution time) shortest = processNOTE: This is just about the same help I received from my TA (who wrote the assignment) which is why I feel comfortable posting this answer.