Buffer Sharing in CSP-Like Programs

Free registration required

Executive Summary

Most compilers focus on optimizing performance, often at the expense of memory, but efficient memory use can be just as important in constrained environments such as embedded systems. In this paper, the authors present a memory reduction technique for the deterministic concurrent programming language SHIM. They focus on reducing memory consumption by sharing buffers among tasks, which use them to communicate using CSP-style rendezvous. They determine pairs of buffers that can never be in use simultaneously and use a shared region of memory for each pair. The technique produces a static abstraction of a SHIM program's dynamic behavior, which the authors then analyze to find buffers that can share memory.

  • Format: PDF
  • Size: 107.8 KB