Abstract
The trend in the semiconductor industry toward multicore processors poses a significant challenge to many suppliers of safety-critical real-time embedded software. Having certified their systems for use on single-core processors, these companies may be forced to migrate their installed base of software onto multicore processors as single-core processors become harder to obtain. These companies naturally want to minimize the potentially high costs of recertifying their software for multicore processors. In support of this goal, we propose an approach to solving a fundamental problem in migrating legacy software applications to multicore systems, namely that of preventing conflicts among I/O transactions from applications residing on different cores. We formalize the problem as a partition scheduling problem that serializes I/O partitions. Although this problem is strongly NP-complete, we formulate it as a Constraint Programming (CP) problem. Since the CP approach scales poorly, we propose a heuristic algorithm that outperforms the CP approach in scalability.
Original language | English (US) |
---|---|
Article number | 6899233 |
Pages (from-to) | 321-331 |
Number of pages | 11 |
Journal | Proceedings - International Computer Software and Applications Conference |
DOIs | |
State | Published - Sep 15 2014 |
Event | 38th Annual IEEE Computer Software and Applications Conference, COMPSAC 2014 - Vasteras, Sweden Duration: Jul 21 2014 → Jul 25 2014 |
Keywords
- Conflict-free I/O
- Integrated Modular Avionics (IMA)
- Multicore Avionics Systems
ASJC Scopus subject areas
- Software
- Computer Science Applications