Clustering-Based Deadline Monotonic Scheduling with Dynamic and Intelligent Time Slice for Real-time Systems
H. S. Behera1, Sushree Sangita Panda2, Jana Chakraborty3
1H.S. Behera, Computer Sc. And Engineering, Veer Surendra Sai University of Technology, Burla, Sambalpur, India.
2Sushree Sangita Panda, Computer Science And Engineering, Veer Surendra Sai University of Technology, Burla, Sambalpur, India.
3Jana Chakraborty, Computer Science And Engineering, Veer Surendra Sai University of Technology, Burla, Sambalpur, India.
Manuscript received on March 22, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on April 30, 2012. | PP: 124-129 | Volume-1 Issue-4, April 2012 | Retrieval Number: D0299041412/2012©BEIESP
Open Access | Ethics and Policies | Cite
© 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: In this paper, clustering based deadline monotonic scheduling with dynamic and Intelligent Time Slice is proposed for real-time systems. The proposed algorithm determines the schedulability of a process, and groups the schedulable and unschedulable process into separate clusters. Then an improved Round Robin algorithm is used for all schedulable processes to calculate average turn-around time, average waiting time and context switch. Then the experimental analysis shows that the performance of the proposed algorithm is better in terms of average turnaround time, average waiting time and context switch.
Keywords: Real-time systems, Deadline monotonic scheduling(DM), Response Time Analysis Schedulability test, Clustering, Round Robin(RR) scheduling algorithm Turnaround time and Waiting time, Upper Quartile.