Optimizing stack memory requirements for real-time embedded applications

Haibo Zeng*, Marco Di Natale, Qi Zhu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

In the development of some real-time embedded applications, especially systems-on-chip, an efficient use of RAM memory is as important as the effective scheduling of the computation resources. The design problem is to find a schedulable solution that fits within the memory budget. In a real-time concurrent system, preemption plays an important role in the exploration of these tradeoffs. Several schemes, including preemption thresholds and non-preemption groups, have been developed to improve schedulability and saving stack memory space by selectively disabling preemption. However, the design synthesis problem for such systems and protocols is still an open problem. We target at the efficient assignment of the scheduling parameters for systems scheduled according to these policies in several cases of practical interest, including those that are compliant with automotive standards.

Original languageEnglish (US)
Title of host publicationProceedings of 2012 IEEE 17th International Conference on Emerging Technologies and Factory Automation, ETFA 2012
DOIs
StatePublished - Dec 1 2012
Event2012 IEEE 17th International Conference on Emerging Technologies and Factory Automation, ETFA 2012 - Krakow, Poland
Duration: Sep 17 2012Sep 21 2012

Other

Other2012 IEEE 17th International Conference on Emerging Technologies and Factory Automation, ETFA 2012
CountryPoland
CityKrakow
Period9/17/129/21/12

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Optimizing stack memory requirements for real-time embedded applications'. Together they form a unique fingerprint.

Cite this