Skip to Main content Skip to Navigation
New interface
Conference papers

A Tabu Search Heuristic for Scratch-Pad Memory Management

Abstract : Reducing energy consumption of embedded systems requires careful memory management. It has been shown that Scratch-Pad Memories (SPMs) are low size, low cost, efficient (i.e. energy saving) data structures directly managed at the software level. In this paper, the focus is on heuristic methods for SPMs management. A method is efficient if the number of accesses to SPM is as large as possible and if all available space (i.e. bits) is used. A Tabu Search (TS) approach for memory management is proposed which is, to the best of our knowledge, a new original alternative to the best known existing heuristic (BEH). In fact, experimentations performed on benchmarks show that the Tabu Search method is as efficient as BEH (in terms of energy consumption) but BEH requires a sorting which can be computationally expensive for a large amount of data. TS is easy to implement and since no sorting is necessary, unlike BEH, the corresponding sorting time is saved. In addition to that, in a dynamic perspective where the maximum capacity of the SPM is not known in advance, the TS heuristic will perform better than BEH.
Complete list of metadata
Contributor : Maha Idrissi Aouad Connect in order to contact the contributor
Submitted on : Thursday, June 10, 2010 - 5:54:20 PM
Last modification on : Friday, February 4, 2022 - 3:30:29 AM


  • HAL Id : inria-00491191, version 1



Maha Idrissi Aouad, René Schott, Olivier Zendra. A Tabu Search Heuristic for Scratch-Pad Memory Management. ICSET 2010 - International Conference on Software Engineering and Technology, WASET - World Academy of Science, Engineering and Technology, Apr 2010, Rome, Italy. pp.386-390. ⟨inria-00491191⟩



Record views