A linear complexity algorithm for the automatic generation of convex multiple input multiple output instructions

Authors:
Carlo Galuzzi;Koen Bertels;Stamatis Vassiliadis
Affiliations:
Computer Engineering, EEMCS, Delft University of Technology, The Netherlands;Computer Engineering, EEMCS, Delft University of Technology, The Netherlands;Computer Engineering, EEMCS, Delft University of Technology, The Netherlands
Venue:
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
Year:
2007

Citing 15
Cited 5

MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
Synthesis of application specific instructions for embedded DSP software

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
A DAG-based design approach for reconfigurable VLIW processors

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Instruction generation and regularity extraction for reconfigurable processors

CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
Instruction generation for hybrid reconfigurable systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Synthesis of custom processors based on extensible platforms

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
HW/SW partitioning and code generation of embedded control applications on a reconfigurable architecture platform

Proceedings of the tenth international symposium on Hardware/software codesign
Automatic application-specific instruction-set extensions under microarchitectural constraints

Proceedings of the 40th annual Design Automation Conference
Automatic generation of application specific processors

Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems
Processor Acceleration Through Automated Instruction Set Customization

Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
Application-specific instruction generation for configurable processor architectures

FPGA '04 Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
Scalable custom instructions identification for instruction-set extensible processors

Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
The MOLEN Polymorphic Processor

IEEE Transactions on Computers
An integer linear programming approach for identifying instruction-set extensions

CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Automatic selection of application-specific instruction-set extensions

CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis

The Instruction-Set Extension Problem: A Survey

ARC '08 Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications
Modern development methods and tools for embedded reconfigurable systems: A survey

Integration, the VLSI Journal
A linear complexity algorithm for the generation of multiple input single output instructions of variable size

SAMOS'07 Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation
Algorithms for the automatic extension of an instruction-set

Proceedings of the Conference on Design, Automation and Test in Europe
The Instruction-Set Extension Problem: A Survey

ACM Transactions on Reconfigurable Technology and Systems (TRETS)

Quantified Score

Hi-index	0.00

Visualization

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.