The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2003)
New Orleans, Louisiana
Sept. 27, 2003 to Oct. 1, 2003
ISSN: 1089-795X
ISBN: 0-7695-2021-9
pp: 269
Santosh Pande , Georgia Institute of Technology
Xiaotong Zhuang , Georgia Institute of Technology
ABSTRACT
<p>This paper discusses a register bank assignment problem for a popular network processor — Intel's IXP. Due to limited data paths, the network processor has a restriction that the source operands of most ALU instructions must be resident in two different banks. This results in higher register pressure and puts additional burden on the register allocator. The current vendor-provided register allocator leaves the problem to users, leading to poor compilation interface and low quality code.</p> <p>This paper presents three different approaches for performing register allocation and bank assignment. Bank assignment can be performed before register allocation, can be performed after register allocation or it could be combined with the register allocation. We propose a structure called register conflict graph (RCG) to capture the dual-bank constraints. To further improve the effectiveness of the algorithm, we also propose some enabling transformations.</p> <p>Our results show the phase ordering of first doing register allocation and then assigning banks can reduce the number of spills with affordable costs of additional instructions.</p>
INDEX TERMS
null
CITATION
Santosh Pande, Xiaotong Zhuang, "Resolving Register Bank Conflicts for a Network Processor", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 269, 2003, doi:10.1109/PACT.2003.1238022
90 ms
(Ver 3.3 (11022016))