Separation set partitioning: algorithm to partition nonstrict programs into sequential threads

The authors propose a separation set partitioning algorithm for partitioning nonstrict programs into threads using a participation set and separation set and extend it to global partitioning. The separation set partitioning algorithm can merge threads which the dependence set and demand set partitioning algorithm may fail to do. It deals with certain indirect dependences and potential indirect dependences uniformly and its time complexity is O(n²). Experimental results show that larger threads are made by separation set partitioning than the dependence set and demand set partitioning algorithms