Abstract
The Instruction-Set Extensions problem has been one of the major topic in the last years and it consists of the addition of a set of new complex instructions to a given Instruction-Set. This problem in its general formulation requires an exhaustive search of the design space to identify the candidate instructions. This search turns into an exponential complexity of the solution. In this paper we propose an efficient linear complexity algorithm for the automatic generation of convex Multiple Input Multiple Output (MIMO) instructions, whose convexity is theoretically guaranteed. The proposed approach is not restricted to basic-block level and does not impose limitations either on the number of input and/or output, or on the number of new instructions generated. Our results show a significant overall application speedup (up to x2.9 for ADPCM decoder) considering the linear complexity of the proposed solution and which therefore compares well with other state-of-art algorithms for automatic instruction set extensions.
This is a preview of subscription content, log in via an institution to check access.
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
Vassiliadis, S., et al.: The molen polymorphic processor. IEEE Trans. Comput. 53(11), 1363–1375 (2004)
Alippi, C., et al.: A dag-based design approach for reconfigurable vliw processors. In: Proceedings of DATE ’99 (1999)
Cong, J., et al.: Application-specific instruction generation for configurable processor architectures. In: Proceedings of FPGA ’04 (2004)
Atasu, K., Pozzi, L., Ienne, P.: Automatic application-specific instruction-set extensions under microarchitectural constraints. In: Proceedings of DAC ’03 (2003)
Yu, P., Mitra, T.: Scalable custom instructions identification for instruction-set extensible processors. In: Proceedings of CASES ’04 (2004)
Atasu, K., Dündar, G., Özturan, C.: An integer linear programming approach for identifying instruction-set extensions. In: Proceedings of CODES+ISSS ’05 (2005)
Galuzzi, C., et al.: Automatic selection of application-specific instruction-set extensions. In: Proceedings of CODES+ISSS ’06 (2006)
Kastner, R., et al.: Instruction generation for hybrid reconfigurable systems. ACM Trans. Des. Autom. Electron. Syst. 7(4), 605–627 (2002)
Sun, F., et al.: Synthesis of custom processors based on extensible platforms. In: Proceedings of ICCAD ’02 (2002)
Brisk, P., et al.: Instruction generation and regularity extraction for reconfigurable processors. In: Proceedings of CASES ’02 (2002)
Baleani, M., et al.: Hw/sw partitioning and code generation of embedded control applications on a reconfigurable architecture platform. In: Proceedings of CODES ’02 (2002)
Clark, N., Zhong, H., Mahlke, S.: Processor acceleration through automated instruction set customization. In: Proceedings of MICRO 36, p. 129 (2003)
Goodwin, D., Petkov, D.: Automatic generation of application specific processors. In: Proceedings of CASES ’03 (2003)
Choi, H., et al.: Synthesis of application specific instructions for embedded dsp software. In: Proceedings of ICCAD ’98 (1998)
Lee, C., Potkonjak, M., Mangione-Smith, W.H.: Mediabench: a tool for evaluating and synthesizing multimedia and communicatons systems. In: Proceedings of MICRO 30, pp. 330–335 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Galuzzi, C., Bertels, K., Vassiliadis, S. (2007). A Linear Complexity Algorithm for the Automatic Generation of Convex Multiple Input Multiple Output Instructions. In: Diniz, P.C., Marques, E., Bertels, K., Fernandes, M.M., Cardoso, J.M.P. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2007. Lecture Notes in Computer Science, vol 4419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71431-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-71431-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71430-9
Online ISBN: 978-3-540-71431-6
eBook Packages: Computer ScienceComputer Science (R0)