Towards Guidelines for a Development Process for Component-Based Embedded Systems
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Refining SIRAP with a dedicated resource ceiling for self-blocking
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Towards hierarchical scheduling in AUTOSAR
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
RT-Xen: towards real-time hypervisor scheduling in xen
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
This paper presents algorithms that (1) facilitatesystem-independent synthesis of timing-interfaces for subsystems and(2) system-level selection of interfaces to minimize CPU load. Theresults presented are developed for hierarchical fixed-priorityscheduling of subsystems that may share logical recourses (i.e.,semaphores). We show that the use of shared resources results in atradeoff problem, where resource locking times can be traded for CPUallocation, complicating the problem of finding the optimalinterface configuration subject to scheduability.This paper presents a methodology where such a tradeoff can beeffectively explored. It first synthesizes a bounded set ofinterface-candidates for each subsystem, independently of the finalsystem, such that the set contains the interface that minimizessystem load for any given system. Then, integrating subsystems intoa system, it finds the optimal selection of interfaces. Ouralgorithms have linear complexity to the number of tasks involved.Thus, our approach is also suitable for adaptable andreconfigurable systems.