Sciweavers

3771 search results - page 492 / 755
» Subobject Transformation Systems
Sort
View
ICASSP
2009
IEEE
15 years 8 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
APSEC
2004
IEEE
15 years 8 months ago
A Systematic Method to Identify Software Components
In component-based development (CBD), component is the basic unit for reuse and it provides a relatively coarse-grained functionality. A component typically consists of several re...
Soo Dong Kim, Soo Ho Chang
CLUSTER
2004
IEEE
15 years 8 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
DSD
2004
IEEE
111views Hardware» more  DSD 2004»
15 years 8 months ago
Memory Requirement Optimization with Loop Fusion and Loop Shifting
Loop fusion and loop shifting are well recognized loop transformations for memory requirement reduction. Stateof-the-art optimizations with loop fusion and shifting are based on h...
Qubo Hu, Martin Palkovic, Per Gunnar Kjeldsberg
ERCIMDL
2004
Springer
143views Education» more  ERCIMDL 2004»
15 years 8 months ago
Dynamic Digital Library Construction and Configuration
Abstract. This paper describes a digital library architecture and implementation that is configurable, extensible and dynamic in the way it presents content and in the services it ...
David Bainbridge, Katherine J. Don, George Buchana...