NDLI: Link-time optimization of address calculation on a 64-bit architecture

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

Is continuation-passing useful for data flow analysis?

Separate compilation for Standard ML

Lazy functional state threads

VLIW compilation techniques in a superscalar environment

Link-time optimization of address calculation on a 64-bit architecture

Division by invariant integers using multiplication

Precise compile-time performance prediction for superscalar-based computers

Accurate static estimators for program optimization

Improving semi-static branch prediction by code replication

GIVE-N-TAKE—a balanced code placement framework

Counting solutions to Presburger formulas: how and why

Parallelizing complex scans and reductions

Partial dead code elimination

Effective partial redundancy elimination

The program structure tree: computing control regions in linear time

Memory access coalescing: a technique for eliminating redundant memory accesses

ATOM: a system for building customized program analysis tools

Cache performance of garbage-collected programs

A general data dependence test for dynamic, pointer-based data structures

Interprocedural may-alias analysis for pointers: beyond k-limiting

Context-sensitive interprocedural points-to analysis in the presence of function pointers

Zero-cost range splitting

Debugging of globally optimized programs using data flow analysis

Efficient detection of all pointer and array access errors

On slicing programs with jump statements

Optimal tracing and incremental reexecution for debugging long-running programs

Optimizing dynamically-dispatched calls with run-time type feedback

Type analysis of Prolog using type graphs

Backtracking without trailing in CLP $(R_{Lin})$

Link-time optimization of address calculation on a 64-bit architecture

Content Provider	ACM Digital Library
Author	Wall, David W. Srivastava, Amitabh
Abstract	Compilers for new machines with 64-bit addresses must generate code that works when the memory used by the program is large. Procedures and global variables are accessed indirectly via global address tables, and calling conventions include code to establish the addressability of the appropriate tables. In the common case of a program that does not require a lot of memory, all of this can be simplified considerably, with a corresponding reduction in program size and execution time.We have used our link-time code modification system OM to perform program transformations related to global address use on the Alpha AXP. Though simple, many of these arewhole-program optimizations that can be done only when we can see the entire program at once, so link-time is an ideal occasion to perform them.This paper describes the optimizations performed and shows their effects on program size and performance. Relatively modest transformations, possible without moving code, improve the performance of SPEC benchmarks by an average of 1.5%. More ambitious transformations, requiring an understanding of program structure that is thorough but not difficult at link-time, can do even better, reducing program size by 10% or more, and improving performance by an average of 3.8%.Even a program compiled monolithically with interprocedural optimization can benefit nearly as much from this technique, if it contains statically-linked pre-compiled library code. When the benchmark sources were compiled in this way, we were still able to improve their performance by 1.35% with the modest transformations and 3.4% with the ambitious transformations.
Starting Page	49
Ending Page	60
Page Count	12
File Format	PDF
ISBN	089791662X
DOI	10.1145/178243.178248
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1994-08-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

Link-Time Optimization of Address Calculation on a 64-bit Architecture (1994)

Link-time optimization of address calculation on a 64-bit architecture

Opal: A Single Address Space System for 64-bit Architectures (0)

Compiling for a 64-Bit Single Address Space Architecture (1993)

Opal: a single address space system for 64-bit architecture address space

2006. Performance characterization of SPEC CPU2006 integer benchmarks on x86-64 architecture

A new page table for 64-bit address spaces

How to Use a 64-Bit Virtual Address Space (1992)

2006. Performance characterization of SPEC CPU2006 integer benchmarks on x86-64 architecture

Link-time optimization of address calculation on a 64-bit architecture

Similar Documents

Link-Time Optimization of Address Calculation on a 64-bit Architecture (1994)

Link-time optimization of address calculation on a 64-bit architecture

Opal: A Single Address Space System for 64-bit Architectures (0)

Compiling for a 64-Bit Single Address Space Architecture (1993)

Opal: a single address space system for 64-bit architecture address space

2006. Performance characterization of SPEC CPU2006 integer benchmarks on x86-64 architecture

A new page table for 64-bit address spaces

How to Use a 64-Bit Virtual Address Space (1992)

2006. Performance characterization of SPEC CPU2006 integer benchmarks on x86-64 architecture

Link-time optimization of address calculation on a 64-bit architecture