Download now Free registration required
Flexible real-time applications have predefined temporal limits within which they can operate. Real-time systems that support flexible scheduling need a mechanism to distribute spare capacity in a predictable way among the running applications with respect to the applications' temporal limits and available system resources. This paper introduces a greedy algorithm for spare capacity distribution in flexible real-time systems to increase resource utilization during run-time. The efficiency of the proposed algorithm is evaluated by empirical tests. Additionally, performance measurements were carried out on embedded hardware to draw conclusions about the applicability of the proposed algorithm in real applications.
- Format: PDF
- Size: 1592.1 KB