skip to main content
research-article

A framework to schedule parametric dataflow applications on many-core platforms

Published:12 June 2014Publication History
Skip Abstract Section

Abstract

Dataflow models, such as SDF, have been effectively used to program streaming applications while ensuring their liveness and boundedness. Yet, industrials are struggling to design the next generation of high definition video applications using these models. Such applications demand new features such as parameters to express dynamic input/output rate and topology modifications. Their implementation on modern many-core platforms is a major challenge.

We tackle these problems by proposing a generic and flexible framework to schedule streaming applications designed in a parametric dataflow model of computation. We generate parallel as soon as possible (ASAP) schedules targeted to the new STHORM many-core platform of STMicroelectronics. Furthermore, these schedules can be customized using user-defined ordering and resource constraints.

The parametric dataflow graph is associated with generic or user-defined specific constraints aimed at minimizing timing, buffer sizes, power consumption, or other criteria. The scheduling algorithm executes with minimal overhead and can be adapted to different scheduling policies just by adding some constraints. The safety of both the dataflow graph and constraints can be checked statically and all schedules are guaranteed to be bounded and deadlock free. We illustrate the scheduling capabilities of our approach using a real world application: the VC-1 video decoder for high definition video streaming.

References

  1. J.-P. Banatre and D. Le Metayer. Programming by multiset transformation. Comm. of the ACM, 36(1):98--111, Jan. 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Bariani, P. Lambruschini, and M. Raggio. Vc-1 decoder on stmicroelectronics p2012 architecture. In Proc. of 8th Annual Intl. Workshop "STreaming Day", Sept 2010.Google ScholarGoogle Scholar
  3. V. Bebelis, P. Fradet, A. Girault, and B. Lavigueur. BPDF: A statically analyzable dataflow model with integer and boolean parameters. In ACM Int. Conf. Embedded Software, EMSOFT'13, pages 1--10, Montreal, Canada, Sept. 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. Benini, E. Flamand, D. Fuin, and D. Melpignano. P2012: Building an ecosystem for a scalable, modular and high-efficiency embedded computing accelerator. In Design Automation and Test in Europe, DATE'12, pages 983--987, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Bhattacharya and S. S. Bhattacharyya. Quasi-static scheduling of reconfigurable dataflow graphs for DSP systems. In IEEE International Workshop on Rapid System Prototyping, pages 84--89, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. B. Bhattacharya and S. S. Bhattacharyya. Parameterized dataflow modeling for DSP systems. IEEE Trans. on Signal Processing, 49(10):2408--2421, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete. Cyclo-static dataflow. IEEE Trans. on Signal Processing, 44(2):397--408, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Fradet, A. Girault, and P. Poplavko. SPDF: A schedulable parametric data-flow MoC. In Design Automation and Test in Europe, DATE'12, pages 769--774, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Ha and E. A. Lee. Compile-time scheduling and assignment of data-flow program graphs with data-dependent iteration. IEEE Trans. Computers, 40(11):1225--1238, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Kee, C.-C. Shen, S. S. Bhattacharyya, I. Wong, Y. Rao, and J. Kornerup. Mapping parameterized cyclo-static dataflow graphs onto configurable hardware. Signal Processing Systems, 66(3):285--301, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. E. A. Lee. Recurrences, iteration, and conditionals in statically scheduled block diagrams languages. In VLSI Signal Processing III, chapter 31, pages 330--340. IEEE Press, 1988.Google ScholarGoogle Scholar
  12. E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. Computers, 36(1):24--35, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. E. A. Lee and D. G. Messerschmitt. Synchronous data flow. IEEE Trans. Computers, 36(1):24--35, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J.-B. Lee and H. Kalva. The VC-1 and H.264 Video Compression Standards for Broadband Video Services. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. E. Leiserson and J. B. Saxe. Retiming synchronous circuitry. Algorithmica, 6(1):5--35, 1991.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. A. Munshi. The OpenCL Specification. Khronos OpenCL Working Group, 1.1 edition, June 2011.Google ScholarGoogle Scholar
  17. NVIDIA CUDA Programming Guide. NVIDIA Corp., 4.1 edition, 2012.Google ScholarGoogle Scholar
  18. J. L. Pino, S. S. Bhattacharyya, and E. A. Lee. A hierarchical multiprocessor scheduling framework for synchronous dataflow graphs. Tech. report UCB/ERL M95/36, Univ. of California at Berkeley, May 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. W. Plishker, N. Sane, and S. S. Bhattacharyya. A generalized scheduling approach for dynamic dataflow applications. In Design Automation and Test in Europe, DATE'09, pages 111--116, Nice, France, Apr. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Sriram and S. S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker, Inc., New York, NY, USA, 1st edition, 2000. ISBN 0824793188. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. B. Theelen, M. Geilen, T. Basten, J. Voeten, S. Gheorghita, and S. Stuijk. A scenario-aware data flow model for combined long-run average and worst-case performance analysis. In International Conference on Formal Methods and Models for Codesign, MEMOCODE'06, pages 185--194, Napa Valley (CA), USA, July 2006. ACM-IEEE.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. H. Wiggers, M. J. G. Bekooij, and G. J. M. Smit. Buffer capacity computation for throughput constrained streaming applications with data-dependent inter-task commnication.ACM Trans. Embedded Comput. Syst., 10(2):17, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A framework to schedule parametric dataflow applications on many-core platforms

    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 5
      LCTES '14
      May 2014
      162 pages
      ISSN:0362-1340
      EISSN:1558-1160
      DOI:10.1145/2666357
      Issue’s Table of Contents
      • cover image ACM Conferences
        LCTES '14: Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
        June 2014
        174 pages
        ISBN:9781450328777
        DOI:10.1145/2597809

      Copyright © 2014 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 12 June 2014

      Check for updates

      Qualifiers

      • research-article

    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!