VLDB 2026 Research / reviewers in the wild / expert
Martin Rofheart
dblp:39/1117
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1990
—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 |
Parallel and multicore computing · 87% Interconnection networks and networks-on-chip · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1990 | A Parallel Algorithm for 2-D DFT Computation with No Interprocessor Communication · IEEE Trans. Parallel Distributed Syst. 1990 |
Parallel and multicore computing › parallel algorithms
parallel algorithm design |
0.0 | 1 | 1990 | A Parallel Algorithm for 2-D DFT Computation with No Interprocessor Communication · IEEE Trans. Parallel Distributed Syst. 1990 |
Interconnection networks and networks-on-chip › network topology › tree networks
binary tree network |
0.0 | 1 | 1990 | A Parallel Algorithm for 2-D DFT Computation with No Interprocessor Communication · IEEE Trans. Parallel Distributed Syst. 1990 |
Methods — techniques the papers use, named apart from their topics
performance estimation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | A Parallel Algorithm for 2-D DFT Computation with No Interprocessor CommunicationabstractA parallel algorithm is proposed for the two-dimensional discrete Fourier transform (2-D DFT) computation which eliminates interprocessor communications and uses only O(N) processors. The mapping of the algorithm onto architectures with broadcast and report capabilities is discussed. Expressions are obtained for estimating the speed performance on these machines as a function of the size N*N of the 2-D DFT, the bandwidth of the communications channel, the time for an addition, the time T(F/sub N/) for a single processing element to perform an N-point DFT, and the degree of parallelism. For single I/O channel machines that are capable of exploiting the full degree of parallelism of the algorithm, attainable execution times are as low as the time T(F/sub N/) plus the I/O time for data upload and download. An implementation on a binary tree computer is discussed.> Izidor Gertner, Martin Rofheart |
IEEE Trans. Parallel Distributed Syst. | 2 |