A memory-optimal buffering protocol for preservation of synchronous semantics under preemptive scheduling

  • Authors:
  • Christos Sofronis;Stavros Tripakis;Paul Caspi

  • Affiliations:
  • Verimag Laboratory, Gières, France;CNRS/Verimag and Cadence Design Systems, Berkeley, CA;CNRS/Verimag, Gières, France

  • Venue:
  • EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, we have proposed a set of buffering schemes to preserve the semantics of a synchronous program when the latter is implemented as a set of multiple tasks running under preemptive scheduling. These schemes, however, are not optimal in terms of memory (buffer usage). In this paper we propose a new protocol which generalizes the previous schemes. The new protocol is not only semantics-preserving but also memory-optimal in two senses: first, in terms of the number of buffers required to preserve semantics in the worst case (i.e.,for the "worst" possible arrival/execution pattern of the tasks); second, in terms of the number of buffers required to preserve semantics for any arrival/execution pattern and at any time, assuming no knowledge of future arrivals.