Aperiodic task scheduling for Hard-Real-Time systems |
| |
| Authors: | Brinkley Sprunt Lui Sha John Lehoczky |
| |
| Affiliation: | (1) Department of Electrical and Computer Engineering, Carnegie Mellon University, 15213 Pittsburgh, PA, USA;(2) Department of Computer Science, Carnegie Mellon University, 15213 Pittsburgh, PA, USA;(3) Software Engineering Institute, Carnegie Mellon University, 15213 Pittsburgh, PA, USA;(4) Department of Statistics, Carnegie Mellon University, 15213 Pittsburgh, PA, USA |
| |
| Abstract: | A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular arrival times and hard deadlines.
Aperiodic tasks have irregular arrival times and either soft or hard deadlines. In this article, we present a new algorithm,
the Sporadic Server algorithm, which greatly improves response times for soft deadline aperiodic tasks and can guarantee hard
deadlines for both periodic and aperiodic tasks. The operation of the Sporadic Server algorithm, its performance, and schedulability
analysis are discussed and compared with previously published aperiodic service algorithms. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
