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

Jean-Philippe Brunet

dblp:01/1827 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 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
2 papers
High-performance computing · 42% Parallel and multicore computing · 40% Interconnection networks and networks-on-chip · 18%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › scientific computing systems
computational fluid dynamics
0.011991
Computing turbulent flow in complex geometries on a massively parallel processor · SC 1991
Parallel and multicore computing
parallel algorithms
0.011991
Computing turbulent flow in complex geometries on a massively parallel processor · SC 1991
High-performance computing
scientific computing systems
0.011991
Computing turbulent flow in complex geometries on a massively parallel processor · SC 1991
Parallel and multicore computing › parallel algorithms › distributed-memory parallel algorithms
hypercube algorithms
0.011990
An optional hypercube direct N-body solver on the connection machine · SC 1990
Visualization and visual analytics
scientific visualization
0.011991
Computing turbulent flow in complex geometries on a massively parallel processor · SC 1991

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

vortex-in-cell method · 0.0random vortex method · 0.0hamiltonian path routing · 0.0communication bandwidth optimization · 0.0
YearPublicationVenuePosition
1991 Computing turbulent flow in complex geometries on a massively parallel processor
abstract
In this paper, we present parallel implementations of two methods for computing turbulent flow in complex geometries.Both methods are based on the random vortex method, which is particularly suited for computing complex, viscous, incompressible flow across a wide range of flow regimes and characteristics.The lirst method is a full vortex method, designed to accurately simulate such fluid phenomenon as vortex shedding, merger, and rollup, as well quantitative features of the flow.The second method, based on a "vortexin-cell" method, is an extremely fast version which can offer qualitative portrayal of the dominant fluid structures and mechanisms useful in the design stage.Both methods are non-standard, containing few of the positive attributes commonly associated with methods that easily lend themselves to massively parallel implementations.They are Lagrangian schemes, in which the position of each computational element is affeeted by all others at each time step.The efficient execution of these methods on a Connection Machine CM-2 requires parallel N-body solvers, parallel elliptic solvers, and pamllel data structures for the adaptive creation of computational elements on the boundary of the confining region.provide timing runs.Both are connected to the Realtime Interactive Visualization Environment described in [10].
James A. Sethian, Jean-Philippe Brunet, Adam Greenberg, Jill P. Mesirov
SC2
1990 An optional hypercube direct N-body solver on the connection machine
abstract
The authors have designed and implemented a hypercube algorithm for direct N-body solvers on the Connection Machine CM-2. The algorithm is optimal in the sense that, as long as there is sufficient data, it uses the full communication bandwidth of a hypercube of any dimension. When the number of bodies per node is large enough, the communication time for the implementation is negligible, i.e., less than 2%. In particular, this means that one obtains close to optimal speedup in the regime. To obtain this performance, 'rotated and translated Gray codes' which result in time-wise edge disjoint Hamiltonian paths on the hypercube are used. Timings are presented for a collection of interacting point vortices in two dimensions. The computation of the velocities of 14,000 vortices in 32-bit precision takes 2 seconds on a 16K CM-2.>
Jean-Philippe Brunet, Alan Edelman, Jill P. Mesirov
SC1