Parallel Computation of the Minimal Elements of a Poset
Author(s)Leiserson, Charles E.; Maza, Marc Moreno; Li, Liyun; Xie, Yuzhen
MetadataShow full item record
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimization, transversal hypergraph generation and redundant component removal, to name a few. We propose a divide-and-conquer algorithm which is not only cache-oblivious but also can be parallelized free of determinacy races. We have implemented it in Cilk++ targeting multicores. For our test problems of sufficiently large input size our code demonstrates a linear speedup on 32 cores.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
PASCO '10 Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Association for Computing Machinery (ACM)
Leiserson, Charles E. et al. “Parallel Computation of the Minimal Elements of a Poset.” PASCO '10 Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 2010. 53-62.
Author's final manuscript