Abstract
We present three lock-free data structures for priority task scheduling: a priority work-stealing one, a centralized one with ρ-relaxed semantics, and a hybrid one combining both concepts. With the single-source shortest path (SSSP) problem as example, we show how the different approaches affect the prioritization and provide upper bounds on the number of examined nodes. We argue that priority task scheduling allows for an intuitive and easy way to parallelize the SSSP problem, notoriously a hard task. Experimental evidence supports the good scalability of the resulting algorithm. The larger aim of this work is to understand the trade-offs between scalability and priority guarantees in task scheduling systems. We show that ρ-relaxation is a valuable technique for improving the first, while still allowing semantic constraints to be satisfied: the lock-free, hybrid $k$-priority data structure can scale as well as work-stealing, while still providing strong priority scheduling guarantees, which depend on the parameter k. Our theoretical results open up possibilities for even more scalable data structures by adopting a weaker form of ρ-relaxation, which still enables the semantic constraints to be respected.
- Y. Afek, G. Korland, and E. Yanovsky. Quasi-linearizability: Relaxed consistency for improved concurrency. In OPODIS, pages 395--410, 2010. Google Scholar
Digital Library
- C. M. Kirsch, M. Lippautz, and H. Payer. Fast and scalable, lock-free k-FIFO queues. In PaCT, pages 208--223, 2013.Google Scholar
Digital Library
- Wimmer, Cederman, Traff, and Tsigas}ppopp13M. Wimmer, D. Cederman, J. L. Traff, and P. Tsigas. Work-stealing with configurable scheduling strategies. In 18th ACM Symposium on Principles & Practice of Parallel Programming (PPoPP), pages 315--316, 2013. Google Scholar
Digital Library
- M. Wimmer, D. Cederman, F. Versaci, J. L. Traff, and P. Tsigas. Data structures for task-based priority scheduling. CoRR abs/1312.2501, 2013.Google Scholar
- M. Wimmer, M. Pöter, and J. L. Traff. The Pheet task-scheduling framework on the Intel® Xeon Phi#8482; coprocessor and other multicore architectures. In MTAAP (IPDPS) Workshop, 2013. Google Scholar
Digital Library
Index Terms
Data structures for task-based priority scheduling
Recommendations
Data structures for task-based priority scheduling
PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programmingWe present three lock-free data structures for priority task scheduling: a priority work-stealing one, a centralized one with ρ-relaxed semantics, and a hybrid one combining both concepts. With the single-source shortest path (SSSP) problem as example, ...
Performance analysis of a single-server ATM queue with a priority scheduling
In this paper, we consider a discrete-time queueing system with head-of-line priority. First, we will give some general results on a GI-1-1 queue with priority scheduling. In particular, we will derive expressions for the probability generating function ...
QED limits for many-server systems under a priority policy
A multi-class many-server priority system operating in the quality-and-efficiency-driven regime is considered. Both arrival processes and service times are general. The many-server heavy-traffic diffusion asymptotic is characterized in terms of the ...







Comments