skip to main content
poster

Data structures for task-based priority scheduling

Published:06 February 2014Publication History
Skip Abstract Section

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.

References

  1. Y. Afek, G. Korland, and E. Yanovsky. Quasi-linearizability: Relaxed consistency for improved concurrency. In OPODIS, pages 395--410, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. M. Kirsch, M. Lippautz, and H. Payer. Fast and scalable, lock-free k-FIFO queues. In PaCT, pages 208--223, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle Scholar
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Data structures for task-based priority scheduling

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!