Xinan Tang, Guang R. Gao. How Hard is Thread Partitioning and How Bad is a List Scheduling Based Partitioning Algorithm?. In SPAA. pages 130-139, 1998. [doi]
@inproceedings{TangG98:2,
title = {How Hard is Thread Partitioning and How Bad is a List Scheduling Based Partitioning Algorithm?},
author = {Xinan Tang and Guang R. Gao},
year = {1998},
doi = {10.1145/277651.277679},
url = {http://doi.acm.org/10.1145/277651.277679},
tags = {rule-based, partitioning},
researchr = {https://researchr.org/publication/TangG98%3A2},
cites = {0},
citedby = {0},
pages = {130-139},
booktitle = {SPAA},
}