Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors

Tae Ho Shin, Hyunok Oh, Soonhoi Ha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

This paper determines a static scheduling and the minimal size of arc buffers for a given synchronous dataflow (SDF) graph, satisfying a throughput constraint. Unlike the previous work, we assume that the target architecture and the mapping information are given. In addition we consider the unfolding of the SDF graph to improve the throughput. To solve this problem, we adopt answer set programming (ASP) with constraint programming (CP) technique which always finds optimal solutions. The proposed ASP+CP formulation is compact enough to list the scheduling rules in 27 lines and could be applied to a small-but-practical size of coarse-grain SDF graphs successfully.

Original languageEnglish
Title of host publication2010 International SoC Design Conference, ISOCC 2010
Pages298-301
Number of pages4
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 International SoC Design Conference, ISOCC 2010 - Incheon, Korea, Republic of
Duration: 2010 Nov 222010 Nov 23

Other

Other2010 International SoC Design Conference, ISOCC 2010
CountryKorea, Republic of
CityIncheon
Period10/11/2210/11/23

    Fingerprint

Keywords

  • Buffer size minimization
  • Static scheduling
  • Synchronous dataflow graph
  • Throughput constraint

Cite this

Shin, T. H., Oh, H., & Ha, S. (2010). Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors. In 2010 International SoC Design Conference, ISOCC 2010 (pp. 298-301). [5682911] https://doi.org/10.1109/SOCDC.2010.5682911