Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{142938,
        author = {Vaishali},
        title = {A RESEARCH IN REAL TIME SCHEDULING POLICY FOR EMBEDDED SYSTEM DOMAIN},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {2},
        number = {7},
        pages = {353-364},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=142938},
        abstract = {Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical problem in CPU scheduling in time sharing and real time operating systems. Previous approaches to scheduling computer systems have focused primarily on system-level abstractions for the scheduling decision functions or for the mechanisms that are used to implement them. This paper introduces a new scheduling concept New Multi Level Feedback Queue (NMLFQ) algorithm. It’s important to get a good response time with interactive tasks while keeping other tasks from starvation. In this research paper, we prove that a New version of the Multilevel Feedback queue algorithm is competitive for single machine system, in our opinion providing theoretical validation of the goodness of the idea that has proven effective in practice.},
        keywords = {NMLFQ, operating system, computer organization, scheduling, queue, round robin, deadline, edf, rm, preemption, multilevel queue.},
        month = {},
        }