Academic Commons

Articles

Buffer Sharing in Rendezvous Programs

Vasudevan, Nalini; Edwards, Stephen A.

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. This paper presents a memory reduction technique for rendezvous communication, which is applied to the deterministic concurrent programming language SHIM. It focuses on reducing memory consumption by sharing communication buffers among tasks. It determines 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 is then analyzed to find buffers that are never occupied simultaneously. Experiments show the technique runs quickly on modest-sized programs and can sometimes reduce memory requirements by half.

Subjects

Files

Also Published In

Title
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
DOI
https://doi.org/10.1109/TCAD.2010.2052840

More About This Work

Academic Units
Computer Science
Published Here
August 9, 2011
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.