skip to main content
poster

Provably good scheduling for parallel programs that use data structures through implicit batching

Published:06 February 2014Publication History
Skip Abstract Section

Abstract

This poster proposes an efficient runtime scheduler that provides provable performance guarantees to parallel programs that use data structures through the use of implicit batching.

References

  1. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5):720--748, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Braginsky and E. Petrank. A lock-free B+ tree. In SPAA, pages 58--67, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Hendler, I. Incze, N. Shavit, and M. Tzafrir. Flat combining and the synchronization-parallelism tradeoff. In SPAA, pages 355--364, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. W. J. Paul, U. Vishkin, and H. Wagener. Parallel dictionaries in 2--3 trees. In ICALP, pages 597--609, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Provably good scheduling for parallel programs that use data structures through implicit batching

            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

            • Published in

              cover image ACM SIGPLAN Notices
              ACM SIGPLAN Notices  Volume 49, Issue 8
              PPoPP '14
              August 2014
              390 pages
              ISSN:0362-1340
              EISSN:1558-1160
              DOI:10.1145/2692916
              Issue’s Table of Contents
              • cover image ACM Conferences
                PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
                February 2014
                412 pages
                ISBN:9781450326568
                DOI:10.1145/2555243

              Copyright © 2014 Owner/Author

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 6 February 2014

              Check for updates

              Qualifiers

              • poster
            • Article Metrics

              • Downloads (Last 12 months)6
              • Downloads (Last 6 weeks)1

              Other Metrics

            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!