Home

Buffer Sharing in Rendezvous Programs

Nalini Vasudevan; Stephen A. Edwards

Title:
Buffer Sharing in Rendezvous Programs
Author(s):
Vasudevan, Nalini; Edwards, Stephen A.
Date:
Type:
Articles
Department:
Computer Science
Volume:
29
Permanent URL:
Book/Journal Title:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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. 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.
Subject(s):
Computer science
Publisher DOI:
http://dx.doi.org/10.1109/TCAD.2010.2052840
Item views:
352
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use