Probability Convergence in a Multithreaded Counting Application
We introduce the PDtree, a data structure for fast counting of any specified combinations of a given set of variables. We describe a static implementation that provides speedup linear in the number of processors on the multithreaded Cray MTA-2 machine. Finally, we prove a general convergence property that bounds the nondeterministic deviation of probability estimates relative to a sequential implementation. This convergence result is relevant for any counting application that takes a multithreaded streaming approach.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 910005
- Report Number(s):
- PNNL-SA-53295; TRN: US200723%%313
- Resource Relation:
- Conference: Parallel and Distributed Processing Symposium (IPDPS 2007), 1-5
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast and Accurate Simulation of the Cray XMT Multithreaded Supercomputer
LDRD final report : massive multithreading applied to national infrastructure and informatics.
A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets
Journal Article
·
Mon Dec 31 00:00:00 EST 2012
· IEEE Transactions on Parallel and Distributed Systems, 23(12):2266-2279
·
OSTI ID:910005
+1 more
LDRD final report : massive multithreading applied to national infrastructure and informatics.
Technical Report
·
Tue Sep 01 00:00:00 EDT 2009
·
OSTI ID:910005
+8 more
A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets
Conference
·
Fri May 29 00:00:00 EDT 2009
·
OSTI ID:910005
+2 more