Interprocedural register allocation for RISC machines

Authors:
John Wood;Harold C. Grossman
Affiliations:
Clemson University, Clemson, SC;Clemson University, Clemson, SC
Venue:
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Year:
1992

Citing 5
Cited 0

Global register allocation at link time

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Register windows vs. register allocation

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
Register allocation across procedure and module boundaries

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient register allocation can significantly impact the performance of a program. Most register allocation investigations deal with intraprocedural register allocation. This paper presents two interprocedural register allocation approaches along with empirical data to judge the value of each approach on a variety of benchmark programs. The GNU C compiler is used on a Data General Aviion computer as the investigation environment.