Please use this identifier to cite or link to this item:
metadata.conference.dc.title: A Theoritical Review on Static and Dynamic Scratchpad Memory
metadata.conference.dc.contributor.*: Sazly Anuar, Md. Nasir Sulaiman
Salfarina Abdullah
metadata.conference.dc.subject: Memory allocation
scratchpad memory
embedded systems 22-Nov-2013
metadata.conference.dc.description.abstract: Cache memory has been broadly used to improve the s. However, due to some weaknesses of caches, especially the unpredictability memory access latency, many embedded systems today use a small and fast on- chip memory, known as scratchpad memory (SPM). The allocation of data in scratchpad lies in the hand of software and is performed during the compilation times, which makes the memory access latency predictable. In any real-time systems, this is the major cause that will reduce the worst-case execution time (WCET) of each task. Hence, by knowing the most beneficial data to be the member of scratchpad residents, more chances there are to reduce the execution time of a task. The SPM allocation strategies can be classified into two categories static and dynamic. Both techniques aim for better timing constraint and increase performance of the execution time. Static and dynamic allocation techniques can be implemented on different types of system real-time and non real-time systems. In this paper, we present the comparison for the two types of scratchpad allocation techniques on two different types of systems.
metadata.conference.dc.description: Conference Venue : UniKL 2013
metadata.conference.dc.identifier.uri: Science Engineering Technology National Conference (SETNC) 2013
metadata.conference.dc.conference.year: 2013
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
A Theoritical Review on Static and Dynamic Scratchpad Memory.pdf186.39 kBAdobe PDFView/Open    Request a copy

Items in UniKL IR are protected by copyright, with all rights reserved, unless otherwise indicated.