Article

Free access

Increasing the size of atomic instruction blocks using control flow assertions

Authors:

Sanjay J. Patel,

Tony Tung,

Satarupa Bose,

Matthew M. CrumAuthors Info & Claims

MICRO 33: Proceedings of the 33rd annual ACM/IEEE international symposium on Microarchitecture

Pages 303 - 313

https://doi.org/10.1145/360128.360160

Published: 01 December 2000 Publication History

PDF eReader Publisher Site

Supplementary Material

PS File (p303-patel.ps)

Download
631.10 KB

References

[1]

V. Bala, E. Duesterwald, and S. Banerjia. Transparent dynamic optimization: The design and implementation of Dynamo. Technical Report HPL-1999-78, Hewlett-Packard Laboratories, June 1999.

Google Scholar

[2]

M. Evers, S. J. Patel, R. S. Chappell, and Y. N. Patt. An analysis of correlation and predictability: What makes twolevel branch predictors work. In Proceedings of the 25th Annual International Symposium on Computer Architecture, pages 52-61, 1998.

Digital Library

Google Scholar

[3]

J. A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, C- 30(7):478-490, July 1981.

Digital Library

Google Scholar

[4]

B. Grant, M. Mock, M. Phillipose, C. Chambers, and S. J. Eggers. DyC: An expressive annotation-directed dynamic compiler for C. Technical Report UW-CSE-97-03-03, University of Washington, May 1999.

Google Scholar

[5]

A. Klaiber. The technology behind Crusoe processors. Technical report, Transmeta Corporation, Jan. 2000.

Google Scholar

[6]

S. Melvin and Y. Patt. Enhancing instruction scheduling with a block-structured ISA. International Journal of Parallel Programming, 23(3):221-243, June 1995.

Digital Library

Google Scholar

[7]

M. C. Merten, A. R. Trick, E. M. Nystrom, R. D. Barnes, and W. W. Hwu. A hardware mechanism for dynamic extraction and relayout of program hot spots. In Proceedings of the 27th Annual International Symposium on Computer Architecture, 2000.

Digital Library

Google Scholar

[8]

S. J. Patel, M. Evers, and Y. N. Patt. Improving trace cache effectiveness with branch promotion and trace packing. In Proceedings of the 25th Annual International Symposium on Computer Architecture, 1998.

Digital Library

Google Scholar

[9]

S. J. Patel, D. H. Friendly, and Y. N. Patt. Evaluation of design options for the trace cache fetch mechanism. IEEE Transactions on Computers, 48(2):435-446, Feb. 1999.

Digital Library

Google Scholar

[10]

S. J. Patel and S. S. Lumetta. rePLay : a hardware framework for dynamic program optimization. Technical Report CRHC-99-16, University of Illinois Technical Report, Dec. 1999.

Google Scholar

[11]

A. Peleg and U. Weiser. Dynamic flow instruction cache memory organized around trace segments independent of virtual address line. U.S. Patent Number 5,381,533, 1994.

Google Scholar

[12]

E. Rotenberg, S. Bennett, and J. E. Smith. Trace cache: a low latency approach to high bandwidth instruction fetching. In Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture, 1996.

Digital Library

Google Scholar

[13]

J. Stark, M. Evers, and Y. N. Patt. Variable length path branch prediction. In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 170 - 179, 1998.

Digital Library

Google Scholar

[14]

T.-Y. Yeh and Y. N. Patt. Two-level adaptive branch prediction. In Proceedings of the 24th Annual ACM/IEEE International Symposium on Microarchitecture, pages 51-61, 1991.

Digital Library

Google Scholar

[15]

C. Young and M. D. Smith. Improving the accuracy of static branch prediction using branch correlation. In Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 232-241, 1994.

Digital Library

Google Scholar

Cited By

View all

Jeong ILee CKim KRo W(2019)OverCome: Coarse-Grained Instruction Commit with Handover Register RenamingIEEE Transactions on Computers10.1109/TC.2019.293655768:12(1802-1816)Online publication date: 1-Dec-2019
https://doi.org/10.1109/TC.2019.2936557
Padmanabha SLukefahr ADas RMahlke SHunter HMoreno JEmer JSanchez D(2017)Mirage coresProceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3123939.3123969(745-758)Online publication date: 14-Oct-2017
https://dl.acm.org/doi/10.1145/3123939.3123969
Padmanabha SLukefahr ADas RMahlke SPrvulovic M(2015)DynaMOSProceedings of the 48th International Symposium on Microarchitecture10.1145/2830772.2830791(322-333)Online publication date: 5-Dec-2015
https://dl.acm.org/doi/10.1145/2830772.2830791
Show More Cited By

Recommendations

Block enlargement optimizations for increasing the instruction fetch rate in block-structured instruction set architectures
Increasing the instruction fetch rate via block-structured instruction set architectures
MICRO 29: Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture

To exploit larger amounts of instruction level parallelism, processors are being built with wider issue widths and larger numbers of functional units. Instruction fetch rate must also be increased in order to effectively exploit the performance ...
Increasing the Instruction Fetch Rate via Block-Structured Instruction Set Architectures

To exploit larger amounts of instruction level parallelism, processors are being built with wider issue widths and larger numbers of functional units. Instruction fetch rate must also be increased in order to effectively exploit the performance ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MICRO 33: Proceedings of the 33rd annual ACM/IEEE international symposium on Microarchitecture

December 2000

357 pages

ISBN:1581131968

DOI:10.1145/360128

Chairmen:
Andrew Wolfe
S3 Incorporated
,
Michael Schlansker
Hewlett-Packard

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

MICRO00

Sponsor:

IEEE TC - MICRO
SIGMICRO

MICRO00: 33rd Annual International Symposium on Microarchitecture

California, Monterey, USA

Acceptance Rates

MICRO 33 Paper Acceptance Rate 31 of 110 submissions, 28%;

Overall Acceptance Rate 484 of 2,242 submissions, 22%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
419
Total Downloads

Downloads (Last 12 months)59
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jeong ILee CKim KRo W(2019)OverCome: Coarse-Grained Instruction Commit with Handover Register RenamingIEEE Transactions on Computers10.1109/TC.2019.293655768:12(1802-1816)Online publication date: 1-Dec-2019
https://doi.org/10.1109/TC.2019.2936557
Padmanabha SLukefahr ADas RMahlke SHunter HMoreno JEmer JSanchez D(2017)Mirage coresProceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3123939.3123969(745-758)Online publication date: 14-Oct-2017
https://dl.acm.org/doi/10.1145/3123939.3123969
Padmanabha SLukefahr ADas RMahlke SPrvulovic M(2015)DynaMOSProceedings of the 48th International Symposium on Microarchitecture10.1145/2830772.2830791(322-333)Online publication date: 5-Dec-2015
https://dl.acm.org/doi/10.1145/2830772.2830791
Gligoric MGroce AZhang CSharma RAlipour MMarinov D(2015)Guidelines for Coverage-Based Comparisons of Non-Adequate Test SuitesACM Transactions on Software Engineering and Methodology10.1145/266076724:4(1-33)Online publication date: 2-Sep-2015
https://dl.acm.org/doi/10.1145/2660767
Wang CWu Y(2013)TSO_ATOMICITYACM SIGPLAN Notices10.1145/2499368.245117248:4(509-520)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2499368.2451172
McFarlin DTucker CZilles C(2013)Discerning the dominant out-of-order performance advantageACM SIGPLAN Notices10.1145/2499368.245114348:4(241-252)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2499368.2451143
Wang CWu Y(2013)TSO_ATOMICITYACM SIGARCH Computer Architecture News10.1145/2490301.245117241:1(509-520)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2490301.2451172
McFarlin DTucker CZilles C(2013)Discerning the dominant out-of-order performance advantageACM SIGARCH Computer Architecture News10.1145/2490301.245114341:1(241-252)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2490301.2451143
Wang CWu YSarkar VBodik R(2013)TSO_ATOMICITYProceedings of the eighteenth international conference on Architectural support for programming languages and operating systems10.1145/2451116.2451172(509-520)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2451116.2451172
McFarlin DTucker CZilles CSarkar VBodik R(2013)Discerning the dominant out-of-order performance advantageProceedings of the eighteenth international conference on Architectural support for programming languages and operating systems10.1145/2451116.2451143(241-252)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1145/2451116.2451143
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Block enlargement optimizations for increasing the instruction fetch rate in block-structured instruction set architectures

Increasing the instruction fetch rate via block-structured instruction set architectures

Increasing the Instruction Fetch Rate via Block-Structured Instruction Set Architectures