Abstract
Reconfigurable architectures have emerged as energy efficient solution to increase the performance of the current embedded systems. However, the employment of such architectures causes area and power overhead mainly due to the mandatory attachment of a memory structure responsible for storing the reconfiguration contexts, named as context memory. However, most reconfigurable architectures, besides the context memory, employ a cache memory to store regular instructions which, somehow, cause a needless redundancy. In this work, we propose a Demand-based Cache Memory Block Manager (DCMBM) that allows the storing of regular instructions and reconfigurable contexts in a single memory structure. At runtime, depending on the application requirements, the proposed approach manages the ratio of memory blocks that is allocated for each type of information. Results show that the DCMBM-DIM spends, on average, 43.4% less energy maintaining the same performance of split memories structures with the same storage capacity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldstein, S.C., et al.: PipeRench: A Reconfigurable Architecture and Compiler. Computer 33, 70–77 (2000)
Wawrzynek, J.R.H.: Garp: a MIPS processor with a reconfigurable coprocessor. In: Proceedings of IEEE Symposium on FPGA-Based Custom Computing Machines. ACM, Washington (1997)
Beck, A.C.S., et al.: Transparent reconfigurable acceleration for heterogeneous embedded applications. In: Proceedings of Design, Automation and Test in Europe, pp. 1208–1213. ACM, New York (2008)
Rutzig, M.B., et al.: Balancing reconfigurable data path resources according to application requirements. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1–8, April 14–18, 2008
Lo, T.B., et al.: Decreasing the impact of the context memory on reconfigurable architectures. In: Proceedings of HiPEAC Workshop on Reconfigurable Computing, Pisa (2010)
Hasenplaugh, W., et al.: The gradient-based cache partitioning algorithm. ACM Trans. Archit. Code Optim. 8(4), Article 44, January 2012
Qureshi, M.K., Patt, Y.N.: Utility-based cache partitioning: a low-overhead, high-performance, runtime mechanism to partition shared caches. In: 39th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO-39, pp. 423–432, December 2006
Albonesi, D.H.: Selective cache ways: on-demand cache resource allocation. In: Proceedings of the 32nd Annual International Symposium on Microarchitecture, MICRO-32, pp. 248–259 (1999)
Suh, G.E., Rudolph, L., Devadas, S.: Dynamic Partitioning of Shared Cache Memory. J. Supercomput. 28(1), 7–26 (2004)
Wilton, S.J.E., et al.: CACTI: an enhanced cache access and cycle time model. IEEE Journal of Solid-State Circuits, 677-688, May 1996
Clark, N., Tang, W., Mahlke, S.: Automatically generating Custom instruction set extensions. In: Workshop of Application-Specific Processors (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Biazus, T.B., Rutzig, M.B. (2015). Reducing Storage Costs of Reconfiguration Contexts by Sharing Instruction Memory Cache Blocks. In: Sano, K., Soudris, D., Hübner, M., Diniz, P. (eds) Applied Reconfigurable Computing. ARC 2015. Lecture Notes in Computer Science(), vol 9040. Springer, Cham. https://doi.org/10.1007/978-3-319-16214-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-16214-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16213-3
Online ISBN: 978-3-319-16214-0
eBook Packages: Computer ScienceComputer Science (R0)