Modified MUF and EDF algorithms for overloaded soft real time systems

Authors:
Sandeep Agrawal;Pankaj Bhatt;K. K. Shkula
Affiliations:
Telecommunication Practice, Tata Consultancy Services Limited, New Delhi, India;Telecommunication Practice, Tata Consultancy Services Limited, New Delhi, India;Department of Computer Engineering, Institute of Technology, Banaras Hindu University, Varanasi, India
Venue:
ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science
Year:
2008

Citing 7
Cited 0

Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems

IEEE Transactions on Computers
Skip-Over: algorithms and complexity for overloaded systems that allow skips

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Three Obstacles to Flexible Scheduling

ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Soft Real-Time Systems: Predictability vs. Efficiency (Series in Computer Science)

Soft Real-Time Systems: Predictability vs. Efficiency (Series in Computer Science)
Energy-Efficient Real-Time Task Scheduling for a DVS System with a Non-DVS Processing Element

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
A non-preemptive scheduling algorithm for soft real-time systems

Computers and Electrical Engineering
Overrun handling approaches for overload-prone soft real-time systems

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes static and dynamic mechanisms by which MUF scheduling algorithm can be made more effective in overloaded soft real time systems (such as multimedia) using the concept of Random Dropping (RD) and negative laxity check. With introduction of RD, both algorithms result in higher values of DMTR as compared to without RD. Using negative laxity check and appropriate random dropping, EDF gives better results as compared to MUF across all tasks - important and less important.