Abstract
The paper proposes an approximation for modeling shortest-job-next (SJN) scheduling discipline at single server stations. The approximation is developed in the form of a response time equation, which can be used directly in the well known Mean Value Analysis (MVA) technique. Detailed experimental results are presented that show the approximation to be highly accurate. We then examine a more complex situation, i.e., the case of a multiple chain network with nonpreemptive priority among chains and SJN scheduling within a chain. Two known ways of modeling priorities are considered and the results compared. Finally, we propose two techniques for handling stations with a restricted type of load dependence. These techniques are not limited to SJN scheduling, but apply to any discipline for which we can write reliable response time equations for a load-independent station.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call