Understanding priority-based scheduling of graph algorithms on a shared-memory platform
Şerif Yeşil, Azin Heidarshenas, Adam Morrison, Josep Torrellas · 2019
Many task-based graph algorithms benefit from executing tasks according to some programmer-specified priority order. To support such algorithms, graph frameworks use Concurrent Priority Schedulers (CPSs), which attempt---but do not guarantee---to execute the tasks according to their priority order. While CPSs are critical to performance, there is insufficient insight on the relative strengths and weaknesses of the different CPS designs in the literature. Such insights would be valuable to design better CPSs for graph processing.