778 search results - page 67 / 156 » Efficient Code Generation for Automatic Parallelization and ... |
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multi-dimensional array. Previous techniques for multi...
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
MICRO
2002
IEEE
14 years 2 months ago
2002
IEEE
Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution ...
LCPC
1998
Springer
14 years 1 months ago
1998
Springer
Techniques for aggressive optimization and parallelization of applications can have the side-effect of introducing copy instructions, register-to-register move instructions, into t...