A faster exact schedulability analysis for fixed-priority scheduling

Authors:
Wan-Chen Lu;Jen-Wei Hsieh;Wei-Kuan Shih;Tei-Wei Kuo
Affiliations:
Department of Computer Science, National Tsing Hua University, 101, Kuang Fu Road, Hsinchu 300, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan, ROC;Department of Computer Science, National Tsing Hua University, 101, Kuang Fu Road, Hsinchu 300, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan, ROC
Venue:
Journal of Systems and Software
Year:
2006

Citing 14
Cited 0

A statistical admission control algorithm for multimedia servers

MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Bus access optimization for distributed embedded systems based on schedulability analysis

DATE '00 Proceedings of the conference on Design, automation and test in Europe
Real-Time Traffic Scheduling and Routing in Packet-Switched Networks Using a Least-Laxity-First Strategy

Journal of VLSI Signal Processing Systems
An approach for imprecise transmission of TIFF image files through congested real-time ATM networks

LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
Visual assessment of a real-time system design: a case study on a CNC controller

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
A multiframe model for real-time tasks

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
The Space of Rate Monotonic Schedulability

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
A Hyperbolic Bound for the Rate Monotonic Algorithm

ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Scheduling Analysis Integration for Heterogeneous Multiprocessor SoC

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems

Real-Time Systems
Real-time garbage collection for flash-memory storage systems of real-time embedded systems

ACM Transactions on Embedded Computing Systems (TECS)
Admission of high priority real-time calls in an ATM network via bandwidth reallocation and dynamic rerouting of active channels

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-time scheduling for task sets has been studied, and the corresponding schedulability analysis has been developed. Due to the considerable overheads required to precisely analyze the schedulability of a task set (referred to as exact schedulability analysis), the trade-off between precision and efficiency is widely studied. Many efficient but imprecise (i.e., sufficient but not necessary) analyses are discussed in the literature. However, how to precisely and efficiently analyze the schedulability of task sets remains an important issue. The Audsley's Algorithm was shown to be effective in exact schedulability analysis for task sets under rate-monotonic scheduling (one of the optimal fixed-priority scheduling algorithms). This paper focuses on reducing the runtime overhead of the Audsley's Algorithm. By properly partitioning a task set into two subsets and differently treating these two subsets during each iteration, the number of iterations required for analyzing the schedulability of the task set can be significantly reduced. The capability of the proposed algorithm was evaluated and compared to related works, which revealed up to a 55.5% saving in the runtime overhead for the Audsley's Algorithm when the system was under a heavy load.