Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel I. Okunbor
dblp:67/2313
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1996
—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 · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing › parallel numerical algorithms
parallel fast multipole method |
0.0 | 1 | 1996 | A Massively Parallel Fast Multipole Algorithm in Three Dimensions · HPDC 1996 |
High-performance computing
cluster computing |
0.0 | 1 | 1996 | A Massively Parallel Fast Multipole Algorithm in Three Dimensions · HPDC 1996 |
High-performance computing › cluster computing
network of workstations |
0.0 | 1 | 1996 | A Massively Parallel Fast Multipole Algorithm in Three Dimensions · HPDC 1996 |
Methods — techniques the papers use, named apart from their topics
message passing interface · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | A Massively Parallel Fast Multipole Algorithm in Three DimensionsabstractThe simulation of many-body, many-particle systems has a wide range of applications in areas such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes 90% of the simulation time. This is mainly due to the fact that the total number of interactions in the force is O(N/sup 2/), where N is the number of particles in the system. The fast multipole algorithm proposed by Greengard and Rokhlin (1987) reduces the time complexity to O(N). In this paper, we design an efficient, parallel fast multipole algorithm in 3D. For portability, our parallel program is implemented using the Message Passing Interface. Is it possible to obtain high performance for a computationally-intensive application using a LAN of workstations? In this paper, we attempt to answer this question, which is commonly asked by those researchers who have no access to parallel computers or supercomputers. Eric Jui-Lin Lu, Daniel I. Okunbor |
HPDC | 2 |