Time-Triggered Co-Scheduling of Computation and Communication with Jitter Requirements
| Autor: | Dakshina Dasari, Anna Minaeva, Zdenek Hanzalek, Benny Akesson |
|---|---|
| Přispěvatelé: | Repositório Científico do Instituto Politécnico do Porto |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
FOS: Computer and information sciences
Computer science Distributed computing Modulo Computation 02 engineering and technology Jitter control Theoretical Computer Science Scheduling (computing) 0202 electrical engineering electronic engineering information engineering Integer programming Real-time systems Jitter Interconnection Resource scheduling 020208 electrical & electronic engineering Satisfiability modulo theory 020202 computer hardware & architecture Integer linear programming Computer Science - Distributed Parallel and Cluster Computing Computational Theory and Mathematics Hardware and Architecture Distributed Parallel and Cluster Computing (cs.DC) Automotive systems Software |
| Zdroj: | IEEE Transactions on Computers Repositório Científico de Acesso Aberto de Portugal Repositório Científico de Acesso Aberto de Portugal (RCAAP) instacron:RCAAP |
| Popis: | The complexity of embedded application design is increasing with growing user demands. In particular, automotive embedded systems are highly complex in nature, and their functionality is realized by a set of periodic tasks. These tasks may have hard real-time requirements and communicate over an interconnect. The problem is to efficiently co-schedule task execution on cores and message transmission on the interconnect so that timing constraints are satisfied. Contemporary works typically deal with zero-jitter scheduling, which results in lower resource utilization, but has lower memory requirements. This article focuses on jitter-constrained scheduling that puts constraints on the tasks jitter, increasing schedulability over zero- jitter scheduling. The contributions of this article are: 1) Integer Linear Programming and Satisfiability Modulo Theory model exploiting problem-specific information to reduce the formulations complexity to schedule small applications. 2) A heuristic approach, employing three levels of scheduling scaling to real-world use-cases with 10000 tasks and messages. 3) An experimental evaluation of the proposed approaches on a case-study and on synthetic data sets showing the efficiency of both zero-jitter and jitter- constrained scheduling. It shows that up to 28% higher resource utilization can be achieved by having up to 10 times longer computation time with relaxed jitter requirements. IEEE Transactions on Computers (2017) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|