On the Efficient Scheduling of Non-Periodic Tasks in Hard Real-Time Systems

Authors:
Michael E. Thomadakis;Jyh-Charn Liu
Affiliations:
-;-
Venue:
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Year:
1999

Citing 0
Cited 14

Response Time Analysis of Asynchronous Real-Time Systems

Real-Time Systems
Dynamic Task Scheduling with Security Awareness in Real-Time Systems

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
PARM: a power-aware message scheduling algorithm for real-time wireless networks

WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters

Journal of Parallel and Distributed Computing
Scheduling Security-Critical Real-Time Applications on Clusters

IEEE Transactions on Computers
Improving security for periodic tasks in embedded systems through scheduling

ACM Transactions on Embedded Computing Systems (TECS)
Distributed algorithms for partially clairvoyant dispatchers

Cluster Computing
Real-time scheduling with quality of security constraints

International Journal of High Performance Computing and Networking
Dynamic, capability-driven scheduling of DAG-based real-time jobs in heterogeneous clusters

International Journal of High Performance Computing and Networking
Winner Price Monotonicity for Approximated Combinatorial Auctions

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Fine-grained efficient resource allocation using approximated combinatorial auctions: A parallel greedy winner approximation for large-scale problems

Web Intelligence and Agent Systems
Schedulability of aperiodic tasks in hybrid process model

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
An experimental analysis of biased parallel greedy approximation for combinatorial auctions

International Journal of Intelligent Information and Database Systems
Enhancing security of real-time applications on grids through dynamic scheduling

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents linear time, on-line algorithms which guarantee and jointly schedule firm aperiodic, hard sporadic and periodic tasks in fixed-priority real-time systems. We develop and capitalize on a methodology which computes the spare capacity Z(a,b) exactly in time Theta(n), for arbitrary schedule intervals [a, b), which, to the best of our knowledge, is the first linear time algorithm reported in the literature. Previous state of the art methods incur pseudopolynomial time to guarantee on-line a single aperiodic and incur coninuous overhead for slack maintenance. Our method guarantees and schedules firm tasks to receive FIFO or EDF service, incurring a one-time linear cost, of Theta(n) and Theta(n+k), respectively, where k is the number of pending firm tasks.