Understanding priority-based scheduling of graph algorithms on a shared-memory platform-Reference-Cited by-同舟云学术

Understanding priority-based scheduling of graph algorithms on a shared-memory platform

Published:2019-11-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
language:
Short-container-title:

Author:

Yesil Serif¹,Heidarshenas Azin¹,Morrison Adam²,Torrellas Josep¹

Affiliation:

1. University of Illinois at Urbana-Champaign

2. Tel Aviv University

Funder

Israel Science Foundation

National Science Foundation

Publisher

ACM

Link

Reference37 articles.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multi Bucket Queues: Efficient Concurrent Priority Scheduling;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Conflict-free Replicated Priority Queue: Design, Verification and Evaluation;Proceedings of the 14th Asia-Pacific Symposium on Internetware;2023-08-04

3. Orinoco: Ordered Issue and Unordered Commit with Non-Collapsible Queues;Proceedings of the 50th Annual International Symposium on Computer Architecture;2023-06-17

5. A scalable architecture for reprioritizing ordered parallelism;Proceedings of the 49th Annual International Symposium on Computer Architecture;2022-06-11