Home

Buffer Sharing in CSP-like Programs

Nalini Vasudevan; Stephen A. Edwards

Title:
Buffer Sharing in CSP-like Programs
Author(s):
Vasudevan, Nalini
Edwards, Stephen A.
Date:
Type:
Articles
Department:
Computer Science
Persistent URL:
Book/Journal Title:
2009 7th IEEE/ACM International Conference on Formal Methods and Models for Codesign (Memocode 2009)
Publisher:
IEEE
Publisher Location:
Piscataway, N.J.
Abstract:
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, we present a memory reduction technique for the deterministic concurrent programming language SHIM. We focus on reducing memory consumption by sharing buffers among the tasks, which use them to communicate using CSP-style rendezvous. We determine pairs of buffers that can never be in use simultaneously and use a shared region of memory for each pair. Our technique produces a static abstraction of a SHIM program’s dynamic behavior, which we then analyze to find buffers that can share memory. Experimentally, we find our technique runs quickly on modest-sized programs and often reduces memory requirements by half.
Subject(s):
Computer science
Publisher DOI:
http://dx.doi.org/10.1109/MEMCOD.2009.5185391
Item views
172
Metadata:
text | xml
Suggested Citation:
Nalini Vasudevan, Stephen A. Edwards, 2009, Buffer Sharing in CSP-like Programs, Columbia University Academic Commons, http://hdl.handle.net/10022/AC:P:10980.

Center for Digital Research and Scholarship at Columbia University Libraries | Terms of Use | Copyright