|
|
|
|
| LEADER |
01561 am a22002413u 4500 |
| 001 |
72131 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Leiserson, Charles E.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Leiserson, Charles E.
|e contributor
|
| 100 |
1 |
0 |
|a Leiserson, Charles E.
|e contributor
|
| 700 |
1 |
0 |
|a Maza, Marc Moreno
|e author
|
| 700 |
1 |
0 |
|a Li, Liyun
|e author
|
| 700 |
1 |
0 |
|a Xie, Yuzhen
|e author
|
| 245 |
0 |
0 |
|a Parallel Computation of the Minimal Elements of a Poset
|
| 260 |
|
|
|b Association for Computing Machinery (ACM),
|c 2012-08-15T12:35:22Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/72131
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a National Science Foundation (U.S.). (Grant number CNS-0615215)
|
| 520 |
|
|
|a National Science Foundation (U.S.). (Grant number CCF- 0621511)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t PASCO '10 Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
|
