Demo Data from EDBT 2026 / reviewers in the wild / expert
Lukasz Wielebski
dblp:46/1589
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2010
—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 |
Performance modeling and evaluation · 87% Parallel and multicore computing · 13% |
Topics — the 1 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation › parallel system performance › speedup modeling
isoefficiency analysis |
0.1 | 1 | 2010 | Isoefficiency Maps for Divisible Computations · IEEE Trans. Parallel Distributed Syst. 2010 |
Methods — techniques the papers use, named apart from their topics
performance modeling · 0.1isoefficiency maps · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Isoefficiency Maps for Divisible ComputationsabstractIn this paper, we propose a new technique of presenting performance relationships in parallel processing. Performance of parallel processing is a hard matter with many counterintuitive phenomena. It is relatively easy to obtain some numerical indicators of the performance using various performance models. However, it is far more difficult to comprehend the nature of the analyzed problem. To facilitate understanding the performance relationships, we propose a new visualization technique based on the concept of isoefficiency. In this paper, isoefficiency is represented as a relation on points in the space of system parameters for which efficiency of parallel processing is equal. We visualize this relation on two-dimensional maps analogously to isobars and isotherms on weather maps. This concept is applied to depict the performance relationships in two standard performance laws: Amdahl's speedup law and Gustafson's speedup law. Then, we use isoefficiency maps to analyze the performance relationships in divisible load processing. Divisible load model conforms with data-parallel computations in an environment with communication delays. The results we obtain give interesting insights into relationships existing in parallel processing. Maciej Drozdowski, Lukasz Wielebski |
IEEE Trans. Parallel Distributed Syst. | 2 |