Referenced Items are not available for this document.
A model that uses knowledge about program structure to guide global register allocation explicitly is proposed. Restrictions that must be met by the live ranges of loops and conditionals such that the corresponding portion of the register conflict graph is an interval graph are defined. Interval graphs are desirable because they can be colored optimally in polynomial time and because clique separators can be located systematically in interval graphs. Clique separated components of the conflict graph can be colored individually and recombined to an overall coloring, a platform for parallel global register allocation. The method has been implemented and results are presented for a benchmark of C kernels. It was possible to map most conflict graphs of the benchmark to an equivalent interval graph. In each conflict graph, it was possible to identify a large number of clique separators; the parallelization of global register allocation is then straightforward
Published in:
Computer Languages, 1992., Proceedings of the 1992 International Conference on
Date of Conference: 20-23 Apr 1992
- Page(s):
- 262 - 271
- Meeting Date :
- 20 Apr 1992-23 Apr 1992
- Print ISBN:
- 0-8186-2585-6
- INSPEC Accession Number:
- 4297281
- Conference Location :
- Oakland, CA
- Digital Object Identifier :
- 10.1109/ICCL.1992.185490
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
