loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Computer Society Annual Symposium on VLSI: Emerging VLSI Technologies and Architectures (ISVLSI'06)
Reducing Memory Requirements through Task Recomputation in Embedded Multi-CPU Systems
Karlsruhe, Germany
March 02-March 03
ISBN: 0-7695-2533-4
H. Koc, Syracuse University
S. Tosun, Syracuse University
O. Ozturk, Pennsylvania State University
M. Kandemir, Pennsylvania State University
As embedded applications are processing increasingly larger data sets, keeping their memory space consumptions under control is becoming a very pressing issue. Observing this, several prior efforts have considered memory space reduction techniques (in both hardware and software) based on data compression and lifetime-based memory recycling (garbage collection). In this work, we propose and evaluate an alternate approach to memory space saving in multi- CPU embedded systems such as chip multiprocessors. The unique characteristic of our approach is that it recomputes the results of select tasks in a given task graph (which represents the application), instead of storing these results in memory and accessing them from there as needed.
Citation:
H. Koc, S. Tosun, O. Ozturk, M. Kandemir, "Reducing Memory Requirements through Task Recomputation in Embedded Multi-CPU Systems," isvlsi, pp.448-449, IEEE Computer Society Annual Symposium on VLSI: Emerging VLSI Technologies and Architectures (ISVLSI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.