Note that the latter is characterized by undesirable scheduling starvation. Higher throughput and system spectrum efficiency may be achieved by channel-dependent scheduling, for example a proportionally fair algorithm, or maximum throughput scheduling. Round-robin scheduling does not utilize this. It would be more efficient to wait with the transmission until the channel conditions are improved, or at least to give scheduling priority to less expensive users. However, if link adaptation is used, it will take a much longer time to transmit a certain amount of data to 'expensive' users than to others since the channel conditions differ. In a centralized wireless packet radio network, where many stations share one frequency channel, a scheduling algorithm in a central base station may reserve time slots for the mobile stations in a round-robin fashion and provide fairness.
If you already have the values available, the algorithm seems as simpleĪs sorting a list the processes by running time/remaining time, then Or do you have to estimate them? If you must estimate, what information
The same is true for SRTF.Īre you somehow given the running time/remaining time for each process, General case) is to run the process and see, but that defeats the point To implement SJF, you need to know for how longĪ process is going to run. I would argue that it isn't possible to implement SJF for a generalĬase(though it is still useful as a theoretically optimal lower bound onĪverage waiting time).
You need to define the problem a bit better, and perhaps post any work Much about the construction is there anyone who can help me to built I am currently in taking OS course, and my lecturer would like us toįind ways to construct a CPU algorithm such as SJF(shortest Jobįirst), SRTF (Shortest Remaining Time First), and since i know not
0 kommentar(er)
