Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Sharon M. Sacco

dblp:120/2356 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 67% Parallel and multicore computing · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
fast fourier transform		 0.112012
A transpose-free in-place SIMD optimized FFT · ACM Trans. Archit. Code Optim. 2012
High-performance computing
scientific computing systems		 0.112012
A transpose-free in-place SIMD optimized FFT · ACM Trans. Archit. Code Optim. 2012
Parallel and multicore computing › data parallelism
SIMD vectorization		 0.112012
A transpose-free in-place SIMD optimized FFT · ACM Trans. Archit. Code Optim. 2012

Methods — techniques the papers use, named apart from their topics

transpose-free algorithm · 0.1data movement optimization · 0.1
YearPublicationVenuePosition
2012 A transpose-free in-place SIMD optimized FFT
abstract
A transpose-free in-place SIMD optimized algorithm for the computation of large FFTs is introduced and implemented on the Cell Broadband Engine. Six different FFT implementations of the algorithm using six different data movement methods are described. Their relative performance is compared for input sizes from 2 17 to 2 21 complex floating point samples. Large differences in performance are observed among even theoretically equivalent data movement patterns. All six implementations compare favorably with FFTW and other previous FFT implementations.
James R. Geraci, Sharon M. Sacco
 ACM Trans. Archit. Code Optim.2