Diz 67 cz
Scalable Scheduling Algorithms for Embedded Systems with Real-Time Requirements
Autor: Anna Minaeva
Growing user demands result in an increasing number of applications integrated into embedded systems. These applications can have real-time requirements, which means the utility of computations is sensitive to their timing behavior. To reduce the cost, manufacturers minimize the number of platform components. As a result, applications share platform resources, which causes contention and worsens their timing behavior. Applications can be scheduled on platform resources at design time to guarantee that real-time requirements are satisfied. This scheduling problem is challenging as there are exponentially many options on how to construct a schedule that satisfies real-time requirements and optimizes system performance. During design-space exploration, the system designer needs to solve the scheduling problem many times. Therefore, the computation time of the solution approach significantly influences system development time and its cost, with the latter also depending on the system performance. Thus, a solution providing reasonable computation time and quality trade-off needs to be found. Most of the existing works either propose exact solutions that cannot solve industrial-sized instances or propose heuristic algorithms without validating its efficiency with optimal solutions.