Static scheduling generation for multicore partitioned systems

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multicore systems are present in many sectors and arriving others, as real-time systems, traditionally reluctant to them due to the difficulty to estimate worst case execution time in multicore platforms. However, partitioned systems integrated by a partitioning kernel and a set of partitions with different levels of criticality is one of the emerging software technologies in real-time systems to deal with multi-core platforms. This paper presents a method to generate a static schedule for a multicore partitioned system. Several issues are considered: partitions with different levels of criticality, hierarchical schedule, allocation of partitions to cores and generation of the global schedule. The aim is to generate a cyclic static schedule for a multicore system which fulfils the temporal constraints of the partitions.

Cite

CITATION STYLE

APA

Crespo, A., Balbastre, P., Simo, J., & Albertos, P. (2016). Static scheduling generation for multicore partitioned systems. In Lecture Notes in Electrical Engineering (Vol. 376, pp. 511–522). Springer Verlag. https://doi.org/10.1007/978-981-10-0557-2_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free