Register allocation technique using register existence graph

A. Koseki, H. Komastu, Y. Fukazawa

Research output: Contribution to journalConference article

Abstract

Optimizing compilation is very important for generating code sequences in order to utilize the characteristics of processor architectures. One of the most essential optimization techniques is register allocation. In register allocation that takes account of instruction-level parallelism, anti-dependences generated when the same register is allocated to different variables, and spill code generated when the number of registers is insufficient should be handled in such a way that the parallelism in a program is not lost. In our method, we realized register allocation using a new data structure called the register existence graph, in which the parallelism in a program is well expressed.

Original languageEnglish
Pages (from-to)404-411
Number of pages8
JournalProceedings of the International Conference on Parallel Processing
Publication statusPublished - 1997 Jan 1
EventProceedings of the 1997 International Conference on Parallel Processing - Bloomington, IL, USA
Duration: 1997 Sep 111997 Sep 15

    Fingerprint

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this