Probability Convergence in a Multithreaded Counting Application

The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree data structure, which avoids exponential time and space complexity associated with prior work by allowing user specification of the tree structure. A straightforward parallelization approach using a Cray MTA-2 provides a speedup that is linear in the number of processors, but introduces nondeterminism into probability estimates. We prove a general convergence result that bounds the nondeterministic deviation of probability estimates relative to a sequential implementation. Beyond PDtrees, this convergence result applies to any counting application that takes a multithreaded streaming approach.

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha, Andrès Márquez, John Feo, Daniel G. Chavarría-Miranda
• Keywords: Distributed And Parallel Computing, IPPS 2007, PDtree Data Structure, Probability Estimates, Straightforward Parallelization Approach