Distributed Parallel Particle Advection using Work Requesting
Conference
·
OSTI ID:1165077
Particle advection is an important vector field visualization technique that is difficult to apply to very large data sets in a distributed setting due to scalability limitations in existing algorithms. In this paper, we report on several experiments using work requesting dynamic scheduling which achieves balanced work distribution on arbitrary problems with minimal communication overhead. We present a corresponding prototype implementation, provide and analyze benchmark results, and compare our results to an existing algorithm.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 1165077
- Report Number(s):
- LBNL-6467E
- Resource Relation:
- Conference: IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV) 2013
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Lifeline-Based Approach for Work Requesting and Parallel Particle Advection
Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering
Parallel Particle Advection Bake-Off for Scientific Visualization Workloads
Conference
·
Tue Oct 01 00:00:00 EDT 2019
·
OSTI ID:1165077
Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering
Conference
·
Mon Dec 18 00:00:00 EST 2017
·
OSTI ID:1165077
Parallel Particle Advection Bake-Off for Scientific Visualization Workloads
Conference
·
Tue Sep 01 00:00:00 EDT 2020
·
OSTI ID:1165077