Title
Buffer Sharing in Rendezvous Programs
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.
Year
DOI
Venue
2010
10.1109/TCAD.2010.2052840
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions
Keywords
DocType
Volume
concurrency control,embedded systems,program diagnostics,storage management,SHIM program dynamic behavior,buffer sharing,compilers,deterministic concurrent programming language SHIM,embedded systems,memory reduction technique,rendezvous communication,rendezvous program,static abstraction,Buffers,SHIM,concurrency,optimization,static analysis
Journal
29
Issue
ISSN
Citations 
10
0278-0070
0
PageRank 
References 
Authors
0.34
24
2
Name
Order
Citations
PageRank
Nalini Vasudevan1503.88
Stephen A. Edwards21443109.65