1294 search results - page 37 / 259 » FFT Compiler Techniques |
PACT
1997
Springer
14 years 24 days ago
1997
Springer
A technique for estimating the cost of executing a loop nest in parallel (parallel start-up overhead) is described in this paper. This technique is of utmost importance for paralle...
DEXA
2007
Springer
14 years 18 days ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
DATE
2005
IEEE
14 years 2 months ago
2005
IEEE
Scratch-pad memory is becoming an important fixture in embedded multimedia systems. It is significantly more efficient than the cache, in performance and power, and has the add...
IEEEPACT
2009
IEEE
14 years 3 months ago
2009
IEEE
With advances in hardware, instruction set architectures are undergoing continual evolution. As a result, compilers are under constant pressure to adapt and take full advantage of...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...