research-article

An efficient algorithm for custom instruction enumeration

Authors:

Chenglong Xiao,

Emmanuel CasseauAuthors Info & Claims

GLSVLSI '11: Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI

Pages 187 - 192

https://doi.org/10.1145/1973009.1973047

Published: 02 May 2011 Publication History

Abstract

In order to meet growing market demands in flexibility and performance, the use of extensible processors has been increased. Extensible processors extend the base instruction set of a general-purpose processor with a set of custom instructions. Custom instruction that can be implemented in special hardware unit is a vital component for improving performance in extensible processors. The key issue involved is to generate and select automatically custom instructions from high-level application code. In this paper, we propose a new efficient algorithm for automatic generation of all candidate instructions (or patterns). Our pattern generation algorithm identifies all feasible connected and disjoint patterns under different constraints. Compared to a previously proposed well-known algorithm, our algorithm solves the problem more efficiently by taking advantage of topological property of data flow graph (DFG) as well as overcoming the drawbacks of the previously proposed algorithm.

References

[1]

N. Clark, A. Hormati, S. Mahlke, and S. Yehia. Scalable subgraph mapping for acyclic computation accelerators. In Proceedings of the International Conference on Compilers, Architectures, and Synthesis for Embedded Systems, Seoul, South Korea, 2006.

Digital Library

[2]

P. Bonzini and L. Pozzi, Polynomial-time subgraph enumeration for automated instruction set extension, in DATE'07, pp. 1331--1336, 2007.

Digital Library

[3]

M. Arnold, H. Corporaal. Designing domain-specific processors, in: Proceedings of CODES'01-the Ninth International Symposium on Hardware/Software Codesign, 2001, pp. 61--66.

Digital Library

[4]

C. Ozturan, G. Dundar, K. Atasu. An integer linear programming approach for identifying instruction-set extensions, in: Proceedings of CODES+ISSS'05-the Third IEEE/ACM/IFIP International Conference on Hardware/ Software Codesign and System Synthesis, 2005, pp.172--177.

Digital Library

[5]

K. Martin, Ch. Wolinski, K. Kuchcinski, A. Floch, and F. Charot. Constraint-driven identification of application specific instructions in the DURASE system. In SAMOS IX: International Workshop on Systems, Architectures, Modeling and Simulation, Samos, Greece, July 20--23, 2009.

Digital Library

[6]

K. Atasu, L. Pozzi, and P. Ienne. Automatic application-specific instruction-set extensions under microarchitectural constraints. in Proc. 40th Des. Autom. Conf., Jun. 2003, pp. 256--261.

Digital Library

[7]

L. Pozzi, K. Atasu, and P. Ienne. Exact and approximate algorithms for the extension of embedded processor instruction sets. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 25, no. 7, pp. 1209--1229, Jul. 2006.

Digital Library

[8]

P. Yu and T. Mitra. Scalable custom instructions identification for instruction-set extensible processors, in Proc. Int. Conf. Compilers, Architectures, and Synth. Embed. Syst., Sep. 2004, pp. 69--78.

Digital Library

[9]

X. Chen, D.L.Maskell, and Y. Sun. Fast identification of custom instructions for extensible processors. IEEE Trans. Computer-Aided Design Integr. Circuits Syst. 26 (2007), 359--368.

Digital Library

[10]

R. Kastner, A. Kaplan, S. O. Memik, and E. Bozorgzadeh. Instruction generation for hybrid reconfigurable systems. ACM Trans. Des.Autom. Electron. Syst., 7(4), 2002.

Digital Library

[11]

N. Clark, H. Zhong, and S. Mahlke. Processor acceleration through automated instruction set customization. In MICRO36, p. 129, IEEE Computer Society, 2003.

Digital Library

[12]

Pan Yu, Tulika Mitra. Disjoint Pattern Enumeration for Custom Instructions Identification. In: FPL, 2007.

[13]

Wolinski, C., Kuchcinski, K. Identification of application specific instructions based on sub-graph isomorphism constraints. In: IEEE 18th Intl. Conference on Application-specific Systems, Architectures and Processors, Montr&#233;al, Canada (July 8-11, 2007)

[14]

R. Razdan and M. D. Smith. A high-performance microarchitecture with hardware-programmable functional units. In Proc. 27th Annu. Int. Symp.Microarchit., Nov. 1994, pp. 172--180.

Digital Library

[15]

B. Kastrup, A. Bink, and J. Hoogerbrugge. ConCISe: A compiler-driven CPLD-based instruction set accelerator, In Proc. 7th IEEE Symp. Field-Programmable Custom Comput. Mach., Apr. 1999, pp. 92--101.

Digital Library

[16]

R.E. Gonzalez. Xtensa: A Configurable and Extensible Processor, IEEE Micro, vol. 20, no. 2, pp. 60--70, Mar. 2000.

Digital Library

[17]

J. Cong et al. Application-specific instruction generation for configurable processor architectures. In FPGA, 2004.

Digital Library

[18]

C. Lee, M. Potkonjak, and W. H. Mangione-smith. Mediabench: A tool for evaluating and synthesizing multimedia and communications systems. In International Symposium on Microarchitecture, pages 330--335, 1997.

Digital Library

[19]

M. R. Guthaus, J. S. Ringenberg, D. Ernst, T. M.Austin, T. Mudge, and R. B. Brown. Mibench: A free,commercially representative embedded benchmark suite. In IEEE 4th Annual Workshop on Workload Characterization, 2001, pp.3--14

Digital Library

[20]

GeCoS: Generic compiler suite - http://gecos.gforge.inria.fr/

Cited By

Kamal MAfzali-Kusha ASafari SPedram M(2015)OPLEACM Transactions on Embedded Computing Systems10.1145/276445814:4(1-23)Online publication date: 9-Sep-2015
https://dl.acm.org/doi/10.1145/2764458
Wang SXiao CLiu WCasseau EYang X(2015)Selecting most profitable instruction-set extensions using ant colony heuristic2015 Conference on Design and Architectures for Signal and Image Processing (DASIP)10.1109/DASIP.2015.7367250(1-7)Online publication date: Sep-2015
https://doi.org/10.1109/DASIP.2015.7367250
Haaß MBauer LHenkel JChatha KErnst RRaghunathan AIyer R(2014)Automatic custom instruction identification in memory streaming algorithmsProceedings of the 2014 International Conference on Compilers, Architecture and Synthesis for Embedded Systems10.1145/2656106.2656114(1-9)Online publication date: 12-Oct-2014
https://dl.acm.org/doi/10.1145/2656106.2656114
Show More Cited By

Index Terms

An efficient algorithm for custom instruction enumeration
1. Computer systems organization
  1. Architectures
    1. Other architectures

Recommendations

Scalable custom instructions identification for instruction-set extensible processors
CASES '04: Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems

Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automatically select the optimal set of custom instructions. Therefore, heuristic ...
Automatic custom instruction identification for application-specific instruction set processors

The application-specific instruction set processors (ASIPs) have received more and more attention in recent years. ASIPs make trade-offs between flexibility and performance by extending the base instruction set of a general-purpose processor with custom ...
Exact custom instruction enumeration for extensible processors

In recent years, the use of extensible processors has been increased. Extensible processors extend the base instruction set of a general-purpose processor with a set of custom instructions. Custom instructions that can be implemented in special hardware ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GLSVLSI '11: Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI

May 2011

496 pages

ISBN:9781450306676

DOI:10.1145/1973009

General Chairs:
David Atienza
EPFL, Switzerland
,
Yuan Xie
Penn State University, USA
,
Program Chairs:
Jose L. Ayala
Federal University of Pernambuco, Brazil
,
Ken Stevens
University of Utah, USA

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGDA: ACM Special Interest Group on Design Automation

In-Cooperation

IEEE CEDA
IEEE CASS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 May 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GLSVLSI '11

Sponsor:

SIGDA

GLSVLSI '11: Great Lakes Symposium on VLSI 2011

May 2 - 4, 2011

Lausanne, Switzerland

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%

Upcoming Conference

GLSVLSI '25

Sponsor:
sigda

Great Lakes Symposium on VLSI 2025

June 30 - July 2, 2025

New Orleans , LA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
195
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kamal MAfzali-Kusha ASafari SPedram M(2015)OPLEACM Transactions on Embedded Computing Systems10.1145/276445814:4(1-23)Online publication date: 9-Sep-2015
https://dl.acm.org/doi/10.1145/2764458
Wang SXiao CLiu WCasseau EYang X(2015)Selecting most profitable instruction-set extensions using ant colony heuristic2015 Conference on Design and Architectures for Signal and Image Processing (DASIP)10.1109/DASIP.2015.7367250(1-7)Online publication date: Sep-2015
https://doi.org/10.1109/DASIP.2015.7367250
Haaß MBauer LHenkel JChatha KErnst RRaghunathan AIyer R(2014)Automatic custom instruction identification in memory streaming algorithmsProceedings of the 2014 International Conference on Compilers, Architecture and Synthesis for Embedded Systems10.1145/2656106.2656114(1-9)Online publication date: 12-Oct-2014
https://dl.acm.org/doi/10.1145/2656106.2656114
Xiao CCasseau E(2014)Improving high-level synthesis effectiveness through custom operator identification2014 IEEE International Symposium on Circuits and Systems (ISCAS)10.1109/ISCAS.2014.6865090(161-164)Online publication date: Jun-2014
https://doi.org/10.1109/ISCAS.2014.6865090
Fathy AIsshiki TLi DKunieda H(2014)Custom instruction search for application specific instruction-set processor using guided simulated annealing2014 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)10.1109/APCCAS.2014.7032796(367-370)Online publication date: Nov-2014
https://doi.org/10.1109/APCCAS.2014.7032796
Xiao CCasseau EWang SLiu W(2014)Automatic custom instruction identification for application-specific instruction set processorsMicroprocessors & Microsystems10.1016/j.micpro.2014.09.00138:8(1012-1024)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.micpro.2014.09.001
Chenglong Xiao Casseau E(2011)Efficient custom instruction enumeration for extensible processorsProceedings of the ASAP 2011 - 22nd IEEE International Conference on Application-specific Systems, Architectures and Processors10.1109/ASAP.2011.6043270(211-214)Online publication date: 11-Sep-2011
https://dl.acm.org/doi/10.1109/ASAP.2011.6043270

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten