Demo Data from SIGIR 2026 / reviewers in the wild / expert
Björn Mossberg
dblp:87/171
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author
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 · 77% Processor architecture and microarchitecture · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing › code optimization
vectorization |
0.0 | 1 | 1987 | Vectorization of the Calculation of a Moving Sum · IEEE Trans. Computers 1987 |
Processor architecture and microarchitecture
vector processing |
0.0 | 1 | 1987 | Vectorization of the Calculation of a Moving Sum · IEEE Trans. Computers 1987 |
Methods — techniques the papers use, named apart from their topics
timing comparison · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1987 | Vectorization of the Calculation of a Moving SumabstractA moving sum calculation creates a vector B, such that bk is the sum of the elements ak-d through ak+d of an input vector A. It is shown that this procedure can be completely vectorized, resulting in substantial increases in execution speed. Timing comparisons for scalar and vector algorithms executed on both a 2-and a 4-pipe CYBER 205 are presented. Using 32-bit data on the 4-pipe version, the vector algorithm runs almost 10 times faster than the scalar does. Björn Mossberg |
IEEE Trans. Computers | 1 |