skip to main content
research-article

User-assisted storage reuse determination for dynamic task graphs

Published:27 February 2016Publication History
Skip Abstract Section

Abstract

Models based on task graphs that operate on single-assignment data are attractive in several ways, but also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs, and present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks.

References

  1. L. Gérard, A. Guatto, C. Pasteur, and M. Pouzet. A modular memory optimization for synchronous data-flow languages: application to arrays in a Lustre compiler. In LCTES, pages 51--60, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. C. Kurt, S. Krishnamoorthy, K. Agrawal, and G. Agrawal. Fault-tolerant dynamic task graph scheduling. In SC, pages 719--730, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. V. Raychev, M. Vechev, and M. Sridharan. Effective race detection for event-driven programs. In OOPSLA, pages 151--166, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Sbirlea, Z. Budimlic, and V. Sarkar. Bounded memory scheduling of dynamic task graphs. In PACT, pages 343--356, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Sbirlea, K. Knobe, and V. Sarkar. Folding of tagged single assignment values for memory-efficient parallelism. In Euro-Par, pages 601--613, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Schnorf, M. Ganapathi, and J. L. Hennessy. Compile-time copy elimination. Softw., Pract. Exper., 23(11):1175--1200, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. User-assisted storage reuse determination for dynamic task graphs

      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 51, Issue 8
        PPoPP '16
        August 2016
        405 pages
        ISSN:0362-1340
        EISSN:1558-1160
        DOI:10.1145/3016078
        Issue’s Table of Contents
        • cover image ACM Conferences
          PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
          February 2016
          420 pages
          ISBN:9781450340922
          DOI:10.1145/2851141

        Copyright © 2016 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 27 February 2016

        Check for updates

        Qualifiers

        • research-article
      • Article Metrics

        • Downloads (Last 12 months)2
        • 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!