Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Spatial and Temporal Cost Analysis on OSEK Implementations of Synchronous Reactive Semantics Preserving Communication Protocols

Guoqiang Wang, Marco Di Natale and Alberto L. Sangiovanni-Vincentelli

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2008-149
December 6, 2008

http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-149.pdf

Synchronous Reactive semantics preserving communication buffer sizing mechanisms and buffer indexing protocols are presented. Because these protocols define buffer indices for writers and readers at task activation time, generally they require a kernel-level implementation. In this paper, we present portable implementations for applications with SR semantics under the OSEK OS standard, which is widely used in automotive designs. To meet the one-alarm minimum requirement, an task called dispatcher is constructed to activate all other application tasks. For the CTDBP, the hook mechanism is used to gain atomicity of the termination code for lower-priority readers. Memory requirements are compared quantitatively for different versions of implementations of the SR semantics preserving protocols. Furthermore run time characteristics for different versions of implementations are measured with the use of the PICos18.


BibTeX citation:

@techreport{Wang:EECS-2008-149,
    Author = {Wang, Guoqiang and Di Natale, Marco and Sangiovanni-Vincentelli, Alberto L.},
    Title = {Spatial and Temporal Cost Analysis on OSEK Implementations of Synchronous Reactive Semantics Preserving Communication Protocols},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2008},
    Month = {Dec},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-149.html},
    Number = {UCB/EECS-2008-149},
    Abstract = {Synchronous Reactive semantics preserving communication buffer sizing mechanisms and buffer indexing protocols are presented. Because these protocols define buffer indices for writers and readers at task activation time, generally they require a kernel-level implementation.  In this paper, we present portable implementations for applications with SR semantics under the OSEK OS standard, which is widely used in automotive designs.  To meet the one-alarm minimum requirement, an task called dispatcher is constructed to activate all other application tasks.  For the CTDBP,
the hook mechanism is used to gain atomicity of the termination code for lower-priority readers.  Memory requirements are compared quantitatively for different versions of implementations of the SR semantics preserving protocols. Furthermore run time characteristics for different versions of implementations are measured with the use of the PICos18.}
}

EndNote citation:

%0 Report
%A Wang, Guoqiang
%A Di Natale, Marco
%A Sangiovanni-Vincentelli, Alberto L.
%T Spatial and Temporal Cost Analysis on OSEK Implementations of Synchronous Reactive Semantics Preserving Communication Protocols
%I EECS Department, University of California, Berkeley
%D 2008
%8 December 6
%@ UCB/EECS-2008-149
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-149.html
%F Wang:EECS-2008-149