Using Task Recomputation During Application Mapping in Parallel Embedded Architectures

- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores this tradeoff by proposing and evaluating an algorithm for performing recomputations in select program points to reduce memory space occupation of data. Our algorithm targets heterogeneous computing platforms and operates with two user-specified parameters that bound performance degradation of the resulting code and its memory space demand. It explores the solution space, performing recomputations (instead of memory stores) for select tasks to reduce memory space demand.

• Type: Conference
• Year: 2006
• Where: CDES
• Authors: Suleyman Tosun, Mahmut T. Kandemir, Hakduran Koc
• Keywords: CDES 2006, CDES 2007, Memory Space, Memory Space Demand, Memory Space Requirements