Towards systematic parallel programming of graph problems via tree decomposition and tree parallelism.


https://doi.org/10.1145/2502323.2502331
@inproceedings{DBLP:conf/icfp/WangCLH13, author = {Qi Wang and Meixian Chen and Yu Liu and Zhenjiang Hu}, editor = {Clemens Grelck and Fritz Henglein and Umut A. Acar and Jost Berthold}, title = {Towards systematic parallel programming of graph problems via tree decomposition and tree parallelism}, booktitle = {Proceedings of the 2nd {ACM} {SIGPLAN} workshop on Functional high-performance computing, Boston, MA, USA, FHPC@ICFP 2013, September 25-27, 2013}, pages = {25--36}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2502323.2502331}, doi = {10.1145/2502323.2502331}, timestamp = {Tue, 06 Nov 2018 16:59:24 +0100}, biburl = {https://dblp.org/rec/conf/icfp/WangCLH13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21