Schedulability analysis of Rate Monotonic Algorithm using Improved Time Demand Analysis for Multiprocessor Environment

Abstract

Real -Time Monotonic algorithm (RMA) is a widely used static priority scheduling algo-rithm. For application of RMA at various systems, it is essential to determine it’s feasibil-ity first. Though there are a lot of feasibility analysis test present, most of them reduce the scheduling points in an attempt to decrease the complexity. In this paper we state and de-velop an exact schedulablity test algorithm named as improved time demand analysis, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the previous tests to effectively reduce the high complexities encountered in processing large task sets. We also extend our algorithm to multiprocessor environment and compare number of iterations with different number of processors