NDLI: Improving performance by branch reordering

Content Provider	ACM Digital Library
Author	Yang, Minghui Uh, Gang-Ryung Whalley, David B.
Abstract	The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on deeper pipelines and higher multiple issue. Reducing the number of conditional branches executed can often result in a substantial performance benefit. This paper describes a code-improving transformation to reorder sequences of conditional branches. First, sequences of branches that can be reordered are detected in the control flow. Second, profiling information is collected to predict the probability that each branch will transfer control out of the sequence. Third, the cost of performing each conditional branch is estimated. Fourth, the most beneficial ordering of the branches based on the estimated probability and cost is selected. The most beneficial ordering often included the insertion of additional conditional branches that did not previously exist in the sequence. Finally, the control flow is restructured to refflect the new ordering. The results of applying the transformation were significant reductions in the dynamic number of instructions and branches, as well as decreases in execution time.
Starting Page	130
Ending Page	141
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/277652.277711
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	33
Issue Number	5
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improving semi-static branch prediction by code replication

Improving the accuracy of dynamic branch prediction using branch correlation

Code placement for improving dynamic branch prediction accuracy

Instruction reordering for fork-join parallelism

Improving the performance of runtime parallelization

Improving the accuracy of static branch prediction using branch correlation (SIGP, Vol. 29, Issue. 11)

A general framework for iteration-reordering loop transformations

Accurate static branch prediction by value range propagation

Interprocedural conditional branch elimination

Improving performance by branch reordering

Similar Documents

Improving semi-static branch prediction by code replication

Improving the accuracy of dynamic branch prediction using branch correlation

Code placement for improving dynamic branch prediction accuracy

Instruction reordering for fork-join parallelism

Improving the performance of runtime parallelization

Improving the accuracy of static branch prediction using branch correlation (SIGP, Vol. 29, Issue. 11)

A general framework for iteration-reordering loop transformations

Accurate static branch prediction by value range propagation

Interprocedural conditional branch elimination

Improving performance by branch reordering