Date of Publication :7th June 2016
Abstract: Scratchpad is a high-speed internal memory used for temporary storage of calculations data and other work in progress. Scratchpad refers to a special high speed memory used to hold small items of data for rapid retrieval and these are employed for simplification of caching logic. In this paper the scratchpad algorithm is designed to hold a value temporarily and for faster results LUT is considered. The whole algorithm is designed by considering LUT as a case study Each time loop continues and the execution of the internal operations are concurrently stored in scratchpad, in this paper if the sum value is greater than 9 than the value which is stored in 10th position is sent to the variable C, all the values which are stored in C is again stored in Temp before the value in C is overwritten.
Reference :
-
- Joe Sventek, Poler Dickman, Roes Mcllory. “Efficient Dynamic Heap Allocation of Scratchpad Memory in Embeded systems.” University of Glasgow,UK
- Anany Levitin.”Introduction to the Design and Analysis of Algorithms,” University of Villanova, 2003.
- Angel Dominguez, Rajeev Barua, Sumesh Udaykumaran. “Heap Data Allocation to Scratchpad Memory in Embeded Systems.”