Designing Self-Optimizing Operating Systems: Information-Theoretic Approaches to Thread Scheduler Implementation

Year : 2025 | Volume : 12 | Issue : 03 | Page : 31 39
    By

    Anantham Srujana Jyothi,

  • K.V.V. Subba Rao,

  • Manas Kumar Yogi,

  1. Assistant Professor, Department of Computer Science and Engineering-Artificial Intelligence and Machine Learning Department, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India
  2. Assistant Professor, Department of Computer Science and Engineering Department, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India
  3. Assistant Professor, Department of Computer Science and Engineering Department, Pragati Engineering College (A), Surampalem, Andhra Pradesh, India

Abstract

Thread Level Scheduling (TLS) in multi-core and many-core processor environments represents a critical frontier in next-generation operating system design. As computing systems grow increasingly heterogeneous and concurrent, traditional scheduling strategies often rely on heuristics or localized resource metrics, frequently overlooking the deeper, quantifiable relationships and uncertainties inherent in complex concurrent workloads. This study explores the application of information-theoretic approaches, specifically entropy-based task allocation, mutual information-driven dependency analysis, and channel capacity-inspired throughput bounds, to advance TLS models within modern operating system kernels. By developing a rigorous framework grounded in entropy and mutual information, we systematically characterize thread dynamics, unravel hidden dependencies, and optimize resource allocation for maximal efficiency and minimal contention. The findings reveal that information-driven strategies offer promising directions to improve prediction, adaptability, and fairness in operating system schedulers, ultimately forging a more robust foundation for high-performance and real-time computing environments.

Keywords: Thread scheduling, operating systems, entropy, information theory, mutual information, OS kernel design

[This article belongs to Journal of Operating Systems Development & Trends ]

How to cite this article:
Anantham Srujana Jyothi, K.V.V. Subba Rao, Manas Kumar Yogi. Designing Self-Optimizing Operating Systems: Information-Theoretic Approaches to Thread Scheduler Implementation. Journal of Operating Systems Development & Trends. 2025; 12(03):31-39.
How to cite this URL:
Anantham Srujana Jyothi, K.V.V. Subba Rao, Manas Kumar Yogi. Designing Self-Optimizing Operating Systems: Information-Theoretic Approaches to Thread Scheduler Implementation. Journal of Operating Systems Development & Trends. 2025; 12(03):31-39. Available from: https://journals.stmjournals.com/joosdt/article=2025/view=232705


References

  1. Lee J, Chwa HS, Lee J, Shin I. Thread-level priority assignment in global multiprocessor scheduling for DAG tasks. J Syst Softw. 2016 Mar 1; 113: 246–56.
  2. Anjaria K, Mishra A. Thread scheduling using ant colony optimization: An intelligent scheduling approach towards minimal information leakage. Karbala Int J Mod Sci. 2017 Dec 1; 3(4): 241–58.
  3. Olivier SL, Porterfield AK, Wheeler KB, Spiegel M, Prins JF. OpenMP task scheduling strategies for multicore NUMA systems. Int J High Perform Comput Appl. 2012 May; 26(2): 110–24.
  4. Duran A, Corbalán J, Ayguadé E. Evaluation of OpenMP task scheduling strategies. In: Eigenmann R, de Supinski BR, editors. OpenMP in a New Era of Parallelism. IWOMP 2008. Lecture Notes in Computer Science. Vol. 5004. Berlin: Springer; 2008. p. 100–110. doi:10.1007/978-3-540-79561-2_9.
  5. Chen Y, Qiu K, Chen L, Jia H, Zhang Y, Xiao L, Liu L. Smart scheduler: an adaptive NVM-aware thread scheduling approach on NUMA systems. CCF Trans High Perform Comput. 2022 Dec; 4(4): 394–406.
  6. Ghazzawi HA. Scheduling approaches for large-scale complex task management. In The Proceedings of the 2nd Large Scale Complex IT Systems (LSCITS) Postgraduate Workshop. 2010; 60–66.
  7. Chen F, Kodialam M, Lakshman TV. Joint scheduling of processing and shuffle phases in MapReduce systems. In 2012 Proceedings IEEE INFOCOM. 2012 Mar 25; 1143–1151.
  8. Arora NS, Blumofe RD, Plaxton CG. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures. 1998 Jun 1; 119–129.
  9. Madan HT, Manjunatha H, Vidyashankar M. CPU scheduling algorithms performance analysis in the RISC-V xv6 operating system environment. J Integr Sci Technol. 2025; 13(3): 1053.
  10. Rajagopalan M, Lewis BT, Anderson TA. Thread Scheduling for Multi-Core Platforms. In Proceedings of HotOS’07: 11th Workshop on Hot Topics in Operating Systems, San Diego, California, USA. 2007 May 7.
  11. González-Rodríguez M, Otero-Cerdeira L, González-Rufino E, Rodríguez-Martínez FJ. Study and evaluation of CPU scheduling algorithms. Heliyon. 2024 May 15; 10(9): e29959.
  12. Qian J, Jiang H, Srisa-An W, Seth S, Skelton S, Moore J. Energy-efficient I/O thread schedulers
Regular Issue Subscription Original Research
Volume 12
Issue 03
Received 10/11/2025
Accepted 12/11/2025
Published 19/11/2025
Publication Time 9 Days
59

Login


My IP

PlumX Metrics