Abstract
In many complex embedded systems, real-time workload is generated conforming certain structural constraints. In this paper we study how to analyze the delay of real-time workloads of which the generation pattern can be modeled by task graph models. We first show that directly combining path abstraction technique (PAT) in real-time scheduling theory and real-time calculus (RTC) can provide safe delay bounds, but the results are typically over-pessimistic. Then we propose new algorithms to efficiently and precisely solve the delay analysis problem. Experiments with randomly generated task systems are conducted to evaluate the performance of the proposed methods.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015 |
Publisher | IEEE |
Pages | 223-228 |
Number of pages | 6 |
Volume | 2015-April |
ISBN (Electronic) | 9783981537048 |
Publication status | Published - 1 Jan 2015 |
Externally published | Yes |
Event | 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015 - Alpexpo Congress Center, Grenoble, France Duration: 9 Mar 2015 → 13 Mar 2015 |
Conference
Conference | 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015 |
---|---|
Country/Territory | France |
City | Grenoble |
Period | 9/03/15 → 13/03/15 |
ASJC Scopus subject areas
- General Engineering