A binary-tree architecture for scheduling real-time systems with hard and soft tasks

Authors:
Angel García;Sergio Sáez;Joan Vila;Alfons Crespo
Affiliations:
Universidad del Valle, Cali, Colombia;Universidad Politécnica de Valencia, Valencia, Spain;Universidad Politécnica de Valencia, Valencia, Spain;Universidad Politécnica de Valencia, Valencia, Spain
Venue:
SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
Year:
1999

Citing 3
Cited 0

Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems

Real-Time Systems
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems

IEEE Transactions on Software Engineering
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches

RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Complex real-time systems require jointly schedule both periodic and aperiodic tasks. To do this. optimal schedulers are dynamic slack stealing algorithms (DSS). However, these software schedulers are impractical due to their large overheads that always result in delays and reduced CPU utilization. One of the proposed solutions to this problem is doing scheduling in hardware. This paper analyzes in depth a hardware design based on binary trees.