Parallelism improvements of software pipelining by combining spilling with rematerialization

Authors:
Naohiro Ishii;Hiroaki Ogi;Tsubasa Mochizuki;Kazunori Iwata
Affiliations:
Aichi Institute of Technology, Toyota, Japan;Aichi Institute of Technology, Toyota, Japan;Aichi Institute of Technology, Toyota, Japan;Aichi University, Aichi, Japan
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Year:
2005

Citing 7
Cited 0

Bulldog: a compiler for VLSI architectures

Bulldog: a compiler for VLSI architectures
Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
A schedular-sensitive global register allocator

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Improvements to graph coloring register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Heuristics for register-constrained software pipelining

Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture
A Spill Code Placement Framework for Code Scheduling

LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Register Constrained Modulo Scheduling

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

On the instruction level parallelism architecture developed as EPIC, VLIW structure machine et al., the perforemance is affected by the compiler techniques. The integrated and convergent optimization techniques have been studied for their developments of the parallelism. In this paper, we develop a software pipelining technique for the improvement of the parallel processing in these machine structures. The software pipelining is a loop scheduling technique by overlapping the execution of several consecutive instructions of the program. Then, much registers are needed for the realization of the software pipelining. Here, spilling code and the rematerialization are implemented in the pipelining scheduling. Experimental results of the proposed method are compared with the conventional methos. The results show the improvements of the speedup of the parallel prosecssing in the bench marks.