Sciweavers

1415 search results - page 59 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
127
Voted
ICASSP
2009
IEEE
15 years 6 months ago
Generating high performance pruned FFT implementations
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...
Franz Franchetti, Markus Püschel
PDCN
2004
15 years 3 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
ARC
2012
Springer
317views Hardware» more  ARC 2012»
13 years 10 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
ICPP
1999
IEEE
15 years 6 months ago
Trace-Level Reuse
Trace-level reuse is based on the observation that some traces (dynamic sequences of instructions) are frequently repeated during the execution of a program, and in many cases, th...
Antonio González, Jordi Tubella, Carlos Mol...
STTT
2011
195views more  STTT 2011»
14 years 9 months ago
Parallel probabilistic model checking on general purpose graphics processors
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the tradit...
Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski,...