Schedulability Analysis for Rate Monotonic Algorithm in Distributed Real-Time System
Leena Das1, Durga Prasad Mohapatra2
1Leena Das, Department of Computer Science, KIIT University, Bhubaneswar (Odisha), India.
2Durga Prasad Mohapatra, Department of Computer Science, and Engineering, National Institute of Technology, Rourkela (Odisha), India.
Manuscript received on 07 March 2019 | Revised Manuscript received on 20 March 2019 | Manuscript published on 30 March 2019 | PP: 243-249 | Volume-8 Issue-5, March 2019 | Retrieval Number: E2992038519/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Real-Time Monotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA at various systems, it is essential to determine the system’s feasibility first. The various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper we develop a algorithm to compute the RMA schedulability in a distributed real-time system. In today’s world all the high performance computation are done in some form of distributed systems. We look at the limitations of parallel system and show how a distributed system can overcome it and also propose a distributed algorithm for the Schedulability analysis.
Keyword: Distributed Systems, Real-Time Systems, RMA, Schedulability.
Scope of the Article: Data Analytics Modelling and Algorithms