NDLI: Near-optimal intraprocedural branch alignment

Please wait, while we are loading the content...

Simple translation of goal-directed evaluation

Automatic inline allocation of objects

A member lookup algorithm for C++

Incremental analysis of real programming languages

Flick: a flexible, optimizing IDL compiler

Reverse interpretation + mutation analysis = automatic retargeting

Dynamic feedback: an effective technique for adaptive computing

Exploiting hardware performance counters with flow and context sensitive profiling

Generational garbage collection and the radioactive decay model

tcc: a system for fast, flexible, and high-level dynamic code generation

Interprocedural dataflow analysis in an executable optimizer

Aggressive inlining

Interprocedural conditional branch elimination

Partial dead code elimination using slicing transformations

Efficient procedure mapping using cache line coloring

Near-optimal intraprocedural branch alignment

Efficient formulation for optimal modulo schedulers

Module-sensitive program specialisation

Two for the price of one: composing partial evaluation and compilation

Automatic verification of pointer programs using monadic second-order logic

Componential set-based analysis

Program analysis using binary relations

Linear-time subtransitive control flow analysis

A new algorithm for partial redundancy elimination based on SSA form

Spill code minimization via interference region spilling

Call-cost directed register allocation

Fine-grain multithreading with minimal compiler support—a cost effective approach to implementing efficient multithreading languages

Data distribution support on distributed shared memory multiprocessors

Data-centric multi-level blocking

Code compression

Near-optimal intraprocedural branch alignment

Content Provider	ACM Digital Library
Author	Johnson, David S. Smith, Michael D. Karger, David R. Young, Cliff
Abstract	Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We present a branch alignment algorithm that usually achieves the minimum possible pipeline penalty and on our benchmarks averages within 0.3% of a provable optimum. We compare the control penalties and running times of our algorithm to an older, greedy approach and observe that both the greedy method and our method are close to the lower bound on control penalties, suggesting that greedy is good enough. Surprisingly, in actual execution our method produces programs that run noticeably faster than the greedy method. We also report results from training and testing on different data sets, validating that our results can be achieved in real-world usage. Training and testing on different data sets slightly reduced the benefits from both branch alignment algorithms, but the ranking of the algorithms does not change, and the bulk of the benefits remain.
Starting Page	183
Ending Page	193
Page Count	11
File Format	PDF
ISBN	0897919076
DOI	10.1145/258915.258932
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1997-05-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

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

Near-optimal Intraprocedural Branch Alignment (1997)

Near-optimal intraprocedural branch alignment (1997).

Near-Optimal Intraprocedural Branch Alignment (1997)

Near-Optimal Intraprocedural Branch Alignment (1997)

Near-optimal intraprocedural branch alignment

Near-optimal block alignments.

Near-optimal block alignments (2008).

Near optimal multiple alignment within a band in polynomial time

Near-optimal sequence alignment.

Near-optimal intraprocedural branch alignment

Similar Documents

Near-optimal Intraprocedural Branch Alignment (1997)

Near-optimal intraprocedural branch alignment (1997).

Near-Optimal Intraprocedural Branch Alignment (1997)

Near-Optimal Intraprocedural Branch Alignment (1997)

Near-optimal intraprocedural branch alignment

Near-optimal block alignments.

Near-optimal block alignments (2008).

Near optimal multiple alignment within a band in polynomial time

Near-optimal sequence alignment.

Near-optimal intraprocedural branch alignment