Computer Science – Programming Languages
Scientific paper
2007-10-25
Dans Design, Automation and Test in Europe - DATE'05, Munich : Allemagne (2005)
Computer Science
Programming Languages
Submitted on behalf of EDAA (http://www.edaa.com/)
Scientific paper
The aggressive application of scalar replacement to array references substantially reduces the number of memory operations at the expense of a possibly very large number of registers. In this paper we describe a register allocation algorithm that assigns registers to scalar replaced array references along the critical paths of a computation, in many cases exploiting the opportunity for concurrent memory accesses. Experimental results, for a set of image/signal processing code kernels, reveal that the proposed algorithm leads to a substantial reduction of the number of execution cycles for the corresponding hardware implementation on a contemporary Field-Programmable-Gate-Array (FPGA) when compared to other greedy allocation algorithms, in some cases, using even fewer number of registers.
Baradaran Nastaran
Diniz Pedro C.
No associations
LandOfFree
A Register Allocation Algorithm in the Presence of Scalar Replacement for Fine-Grain Configurable Architectures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Register Allocation Algorithm in the Presence of Scalar Replacement for Fine-Grain Configurable Architectures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Register Allocation Algorithm in the Presence of Scalar Replacement for Fine-Grain Configurable Architectures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-431879