Abstract
Problem statement: Providing an ageing strategy for Shortest Job First, kee** the waiting time as efficient as possible better than any other algorithm of similar kind. Approach: Relative waiting time and burst time of each process are compared to get an effective scheduling policy in a constant scheduling overhead. Result: Based on experiments and calculations, our algorithm have provided better waiting time than Highest Response Ratio Next (HRRN) in some cases, equal waiting time in most cases, very negligible more waiting time in some cases and a constant scheduling overhead. HRRN was the best known improvement on Shortest Job First till date. Conclusion: Our algorithm can prove very effective for batch processing systems and situations where burst time can be easily predicted.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Caprita, B., Chan, W.C., Stein, J.N.C., Zheng, H.: Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems. Columbia University, Technical Report CUCS-028-04
Waldspurger, C.A., Weihl, W.E.: Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. In: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation, OSDI 1994 (1994)
Bennett, J.C.R., Zhang, H.: WF2Q: Worst-Case Fair Weighted Fair Queueing. In: INFOCOM 1996, vol. 1, pp. 120–128 (1996)
Neih, J., Vaill, C., Zhong, H.: Virtual-Time Round Robin: An O(1) Proportional Share Scheduler. In: Proceedings of the General Track: USENIX, Annual technical conference (UAT 2001), pp. 245–260 (2001)
Tanenbaum, A.S.: Modern Operating Systems, 3rd edn., p. 1104. Prentice Hall, Englewood Cliffs, ISBN: 13:9780136006633
Hong, L., Ningyi, X., Zucheng, Z., Jihu, P.: N New HRRN in the Bus Arbitration of SoC Design. In: Proceedings of 5th International Conference on ASIC (2003)
Aburas, A.A., Miho, V.: Fuzzy Logic based Algorithm for Uniprocessor Scheduling. In: Proceedings of International Conference on Computer & Communication (2008)
Saboori, E., Mohammadi, S., Parsazad, S.: A New Scheduling Algorithm for Server Farms Load Balancing. In: 2nd International Conference on Industrial and Information Systems (IIS) (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Mishra, V., Kumar, R., Chandra Jaiswal, U. (2011). Rail Road Strategy for SJF Starvation Problem. In: Das, V.V., Stephen, J., Chaba, Y. (eds) Computer Networks and Information Technologies. CNC 2011. Communications in Computer and Information Science, vol 142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19542-6_75
Download citation
DOI: https://doi.org/10.1007/978-3-642-19542-6_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19541-9
Online ISBN: 978-3-642-19542-6
eBook Packages: Computer ScienceComputer Science (R0)