Name
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 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 can sometimes reduce memory requirements by half. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/MEMCOD.2009.5185391 | Cambridge, MA, USA |
Keywords | Field | DocType |
deterministic concurrent programming language,csp-style rendezvous,buffer sharing,memory reduction technique,dynamic behavior,memory consumption,memory requirement,efficient memory use,compilers focus,shim program,csp-like program,embedded system,concurrency,concurrent computing,constraint optimization,computer languages,synchronization,automata,shared memory,memory management,radiation detectors,merging,static analysis,computer science,shim,optimization,data mining | Interleaved memory,Uniform memory access,Shared memory,Computer science,Parallel computing,Distributed memory,Real-time computing,Memory management,Memory map,Distributed shared memory,Flat memory model,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4244-4806-7 | 4 | 0.42 |
References | Authors | |
25 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nalini Vasudevan | 1 | 50 | 3.88 |
| Stephen A. Edwards | 2 | 1443 | 109.65 |