GA-Based Mapping and Scheduling of HSDF Graphs on Multiprocessor Platforms

  • Hao Wu
  • Nenggan Zheng
  • Hong Li
  • Zonghua GuEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11204)


Synchronous Dataflow (SDF) is a widely-used model-of-computation for signal processing and multimedia applications. We address the problem of mapping a Homogeneous Synchronous Dataflow (HSDF) graph onto a multiprocessor platform with the objective of maximizing system throughput. Since the problem is a NP-hard combinatorial optimization problem, it computationally infeasible to use exhaustive search to obtain optimal solutions for large applications. In this paper, we apply Genetic Algorithms to search the design space of all possible actor-to-processor mappings and static-order schedules on each processor to find a near-optimal solution, and compare the performance and scalability of GA with the exact solution technique based on SAT solving.


Synchronous Dataflow (SDF) Genetic Algorithms Multiprocessor systems 



This work is partially supported by NSFC Project # 61672454 and # 61602404; Zhejiang Provincial Natural Science Foundation Project # LY16F020007.


  1. 1.
    Liu, W., Yuan, M., He, X., Gu, Z.: Efficient SAT-based mapping and scheduling of homogeneous synchronous dataflow graphs for throughput optimization. In: Real-Time Systems Symposium (RTSS), pp. 492–504 (2008)Google Scholar
  2. 2.
    Liu, W., Gu, Z., Xu, J.: Efficient software synthesis for dynamic single appearance scheduling of synchronous dataflow. IEEE Embed. Syst. Lett. 1(3), 69–72 (2009)CrossRefGoogle Scholar
  3. 3.
    Liu, W., Gu, Z., Xu, J., et al.: An efficient technique for analysis of minimal buffer requirements of synchronous dataflow graphs with model checking. In: IEEE/ACM International Conference on Hardware/Software Codesign and System Synthesis (CODES-ISSS), pp. 61–70 (2009)Google Scholar
  4. 4.
    Liu, W., Gu, Z., Xu, J., et al.: Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems. IEEE Trans. Parallel Distrib. Syst. 22(8), 1382–1389 (2011)CrossRefGoogle Scholar
  5. 5.
    Liu, W., Gu, Z., Ye, Y.: Efficient SAT-based application mapping and scheduling on multiprocessor systems for throughput maximization. In: Compilers, Architecture and Synthesis for Embedded Systems (CASES), pp. 127–136 (2015)Google Scholar
  6. 6.
    Parhi, K.K., Messerschmitt, D.G.: Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding. IEEE Trans. Comput. 40(2), 178–195 (1991)CrossRefGoogle Scholar
  7. 7.
    Satish, N., Ravindran, K., Keutzer, K.: A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors. In: DATE 2007, pp. 57–62 (2007)Google Scholar
  8. 8.
    Metzner, A., Herde, C.: RTSAT–an optimal and efficient approach to the task allocation problem in distributed architectures. In: RTSS 2006, pp. 147–158 (2006)Google Scholar
  9. 9.
    Stuijk, S., Geilen, M., Basten, T.: Exploring tradeoffs in buffer requirements and throughput constraints for synchronous dataflow graphs. In: DAC 2006, pp. 899–904 (2006)Google Scholar
  10. 10.
    Stuijk, S., Basten, T., Geilen, M., Corporaal, H.: Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs. In: DAC 2007, pp. 777–782 (2007)Google Scholar
  11. 11.
    Dasdan, A., Gupta, R.K.: Faster maximum and minimum mean cycle algorithms for system-performance analysis. IEEE Trans. CAD Integr. Circ. Syst. 17(10), 889–899 (1998)Google Scholar
  12. 12.
    Stuijk, S., Geilen, M., Basten, T.: SDF3: SDF for free. In: ACSD 2006, pp. 276–278 (2006)Google Scholar
  13. 13.
    Sorensson, N., Een, N.: Minisat v1. 13-a sat solver with conflict-clause minimization. In: SAT 2005, pp. 1–2 (2005)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.College of Computer ScienceZhejiang UniversityHangzhouChina
  2. 2.Qiushi Academy for Advanced StudiesZhejiang UniversityHangzhouChina

Personalised recommendations