Abstract
Feautrier’s scheduling algorithm is the most powerful existing algorithm for parallelism detection and extraction. But it has always been known to be suboptimal. However, the question whether it may miss some parallelism because of its design was still open. We show that this is not the case. Therefore, to find more parallelism than this algorithm does, one needs to get rid of some of the hypotheses underlying its framework.
Cite
CITATION STYLE
Vivien, F. (2002). On the optimality of feautrier’s scheduling algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 299–309). Springer Verlag. https://doi.org/10.1007/3-540-45706-2_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
