Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

David Blackston

dblp:116/9281 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1997
—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 · 50% Parallel and multicore computing · 50%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › n-body simulation
barnes-hut algorithm		 0.011997
Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods · SC 1997
Parallel and multicore computing › parallel computing
parallel scientific computing		 0.011997
Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods · SC 1997
Parallel and multicore computing
task partitioning		 0.011997
Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods · SC 1997

Methods — techniques the papers use, named apart from their topics

communication partitioning · 0.0adaptive multipole methods · 0.0
YearPublicationVenuePosition
1997 Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods
abstract
We describe the design of several portable and efficient parallel implementations of adaptive N-body methods, including the adaptive Fast Multipole Method, the adaptive version of Anderson's Method, and the Barnes-Hut algorithm. Our codes are based on a communication and work partitioning scheme that allows an efficient implementation of adaptive multipole methods even on high-latency systems. Our test runs demonstrate high performance and speedup on several parallel architectures, including traditional MPPs, shared-memory machines, and networks of workstations connected by Ethernet.
David Blackston, Torsten Suel
 SC1