Journals / Istanbul University Journal of Electrical and Electronics Engineering / 2003 / Cilt: 3 - Sayı: 2

Design of a scheduler: Comparison of different scheduling algorithms

Pages
859–877
Publication Date
2022-11-04
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

We show that the proposed algorithm outperforms the known scheduling algorithms from the point of balancing the average response times.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, we investigate different scheduling algorithms, and compare their performance for systems with multiple priority queues.
📊
Key Findings & Data:The scheduler defined in this paper may be thought as the preprocessor in an ATM switch, a network processor in a router or just an ordinary CPU scheduler where multiple processes with different priorities are present in the system.
💡
Conclusion & Impact:We show that the proposed algorithm outperforms the known scheduling algorithms from the point of balancing the average response times.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this study, we investigate different scheduling algorithms, and compare their performance for systems with multiple priority queues. The scheduler defined in this paper may be thought as the preprocessor in an ATM switch, a network processor in a router or just an ordinary CPU scheduler where multiple processes with different priorities are present in the system. We show that the proposed algorithm outperforms the known scheduling algorithms from the point of balancing the average response times.

🔖

Cite This Article

ZAİM, A. H. (2022). Design of a scheduler: Comparison of different scheduling algorithms. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 3 - Sayı: 2, 859–877. https://ajindex.com/articles/651712

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (4)

  1. Sotskov, Y.N. And Tanaev, V.S., Scheduling theory and practice: Minsk Group results, Intelligent Systems Engineering, Spring, 1994
  2. Jing Z., Li L., Sun H., Chen Y., Performance of priority scheduling to support differentiated services in ATM switches, Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on, Volume: 1, 2000, Page(s): 463 -470 vol.1 3. Baruah, S.K.; Deji Chen; Mok, A., Static-priority scheduling of multiframe tasks Real-Time Systems, 1999. Proceedings of the 11th Euromicro Conference on, 1999, Page(s): 38 -45 4. Kim H., Lee S. and Lee J., Alternative priority scheduling in dynamic priority systems, Engineering of Complex Computer Systems, 1996. Proceedings., Second IEEE International Conference on, 1996, Page(s): 239 -246 5. Katcher, D.I.; Sathaye, S.S.; Strosnider, J.K., Fixed priority scheduling with limited priority levels, Computers, IEEE Transactions on, Volume: 44 Issue: 9, Sept. 1995, Page(s): 1140 -1144 6. Kleinrock, L, "Queueing Systems: Theory", Wiley-interscience publications, New York, 1975
  3. Viniotis, Y., "Probability and Random Processes for Electrical Engineers", McGraw Hill Pub., Boston, 1998
  4. Kleinrock, L., "Queueing Systems: Computer Applications", Wiley-interscience publications, New York, 1976.