Demo Data from EDBT 2026 / reviewers in the wild / expert
Dominique Bernardi
dblp:58/132
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2006
—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 |
Parallel and multicore computing · 44% Distributed systems · 28% Storage systems · 22% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing
data distribution |
0.1 | 1 | 2006 | Geometrical Interpretation for Data partitioning on a Grid Architecture · HPDC 2006 |
Distributed systems
grid computing |
0.1 | 1 | 2006 | Geometrical Interpretation for Data partitioning on a Grid Architecture · HPDC 2006 |
Parallel and multicore computing
load balancing |
0.1 | 1 | 2006 | Geometrical Interpretation for Data partitioning on a Grid Architecture · HPDC 2006 |
Storage systems
sorting algorithms |
0.1 | 1 | 2006 | Geometrical Interpretation for Data partitioning on a Grid Architecture · HPDC 2006 |
Distributed systems
communication optimization |
0.0 | 1 | 2006 | Geometrical Interpretation for Data partitioning on a Grid Architecture · HPDC 2006 |
High-performance computing › cluster computing
heterogeneous clusters |
0.0 | 1 | 2006 | Geometrical Interpretation for Data partitioning on a Grid Architecture · HPDC 2006 |
Methods — techniques the papers use, named apart from their topics
partitioning · 0.1geometrical interpretation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Geometrical Interpretation for Data partitioning on a Grid ArchitectureabstractWe study, in this work, the load balancing of sort algorithm executed on a two cluster grid. Our solution is based on data partitioning. We use mainly geometrical interpretations to find out the optimal partition that reduces both communication and computing times in an heterogeneous context Dominique Bernardi, Christophe Cérin, Hazem Fkaier, Mohamed Jemni, Michel Koskas |
HPDC | 1 |