The topic I'm talking about this time is what I think is the hardest algorithm for process scheduling and the most time-consuming algorithm which are Highest Response Ratio Next(HRRN) and Round Robin(RR)
I say HRRN is the hardest and probably the most hassle algorithm to do because it's the only one where you actually have to compute something to determine what process executes. All the other algorithms doesn't require any calculation at all, Round Robin is the most time consuming because of all the ticks that you need to do and on top of that keeping track of the ready queue and the burst time of all the processes. It's especially much more time consuming when the time per tick in Round Robin is low. Making a careless mistake in Round Robin can change what should be a correct answer into a wrong one so sometimes it's best to be careful and keep proper track than regret it afterwards.
No comments:
Post a Comment