Please use this identifier to cite or link to this item:
Title: A decoupled architecture of processors with scratch-pad memory hierarchy
Authors: Michail, Harris 
Milidonis, Athanasios S.
Alachiotis, Nikolaos
Keywords: Data processing;Software architecture;Synchronization;Application software
Issue Date: 2007
Publisher: IEEE
Source: Design, Automation and Test in Europe Conference and Exhibition, 2007, Nice, France
Abstract: We present a decoupled architecture of processors with a memory hierarchy of only scratch-pad memories, and a main memory. The decoupled architecture also exploits the parallelism between address computation and processing the application data. The application code is split in two programs the first for computing the addresses of the data in the memory hierarchy and the second for processing the application data. The first program is executed by one of the decoupled processors called Access which uses compiler methods for placing data in the memory hierarchy. In parallel, the second program is executed by the other processor called Execute. The synchronization of the memory hierarchy and the Execute processor is achieved through simple handshake protocol. The Access processor requires strong communication with the memory hierarchy which strongly differentiates it from traditional uniprocessors. The architecture is compared in performance with the MIPS IV architecture of SimpleScalar and with the existing decoupled architectures showing its higher normalized performance. Experimental results show that the performance is increased up to 3.7 times. Compared with MIPS IV the proposed architecture achieves the above performance with insignificant overheads in terms of area
ISSN: 15301591
DOI: 10.1109/DATE.2007.364661
Rights: © 2007 EDAA
Type: Conference Papers
Appears in Collections:Δημοσιεύσεις σε συνέδρια/Conference papers

Show full item record

Citations 50

checked on Feb 7, 2019

Page view(s)

Last Week
Last month
checked on Feb 18, 2019

Google ScholarTM



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