Understanding Priority-Based Scheduling of Graph Algorithms on a Shared-Memory Platform

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. Whil...

Full description

Bibliographic Details

Published in:	SC19: International Conference for High Performance Computing, Networking, Storage and Analysis pp. 1 - 14
Main Authors:	Yesil, Serif, Heidarshenas, Azin, Morrison, Adam, Torrellas, Josep
Format:	Conference Proceeding
Language:	English
Published:	ACM 17.11.2019
Subjects:	Concurrent Priority Scheduling Costs Data structures Graphs High performance computing Memory Hierarchy Performance analysis Scheduling Servers Shared-Memory Multiprocessors
ISSN:	2167-4337
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!