Dynamic and Online Task Scheduling Algorithm Based on Virtual Compute Group in Many-Core Architecture

  • Ziyang Liu
  • Yuzhuo Fu
  • Jiang Jiang
  • Xing Han
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 337)


Efficient task scheduling for a series of applications on Mesh based many-core processors is very challenging, especially when resource occupation and release are required in some running task phases. In this paper, we present a dynamic and online heuristic mapping for efficient task scheduling based on Virtual Computing Group (VCG), and an algorithm managing free resources based on rectangle topology is proposed as well. This method quickly finds proper rectangle resources for a task, partitions processing elements (PEs) into a Virtual Computing Group by constructing a subnet, and maps communicating subtasks on adjacent PEs according to data dependency and communication dependency. Compared with the existing algorithms, our mapping algorithm can reduce the total execution time and enhance the system throughput by 10% in simulations.


Many-Core architecture Virtual Computing Group Dynamic and online reconfiguration Task mapping Resources management 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bhattacharjee, A., Contreras, G., Martonosi, M.: Parallelization libraries: Characterizing and reducing overheads. ACM Trans. on Architecture and Code Optimization 8(1), 5–29 (2011)Google Scholar
  2. 2.
    Maher, B.A.: Atomic block formation for explicit data graph execution architectures, PhD thesis, Department of Computer Sciences, The University of Texas at Austin (August 2010)Google Scholar
  3. 3.
    Govindan, S.M., Robatmili, Esmaeilzadeh, H., et al.: Scaling power and performance via processor composability, Technical report, 2010. UT Austin, Department of Computer Sciences TR-10-14 (2010)Google Scholar
  4. 4.
    Bazargan, K., et al.: Fast Template Placement for Reconfigurable Computing Systems. IEEE Design and Test of Computers 17, 68–83 (2000)CrossRefGoogle Scholar
  5. 5.
    Purtilo, J.M., Hofmeister, C.R.: Dynamic Reconfiguration of Distributed Programs. Distributed Computing Systems, 560–571 (1991)Google Scholar
  6. 6.
    Adamo, J.-M., Bonello, C., Trejo, L.: Programming Environment for Phase-Reconfigurable Parallel Programming on SuperNode. In: Parallel and Distributed Processing (1992)Google Scholar
  7. 7.
    Sherwood, T., Perelman, E., Hamerly, G., Sai, S., Calder, B.: Discovering and Exploiting Program phases. IEEE Micro, 84–93 (2003)Google Scholar
  8. 8.
    Hauck, S.: Reconfigurable Computing: the Theory and Practice of FPGA-Based Computing, Section 9.2.2, p. 210. Elsevier Inc. (2008) ISBN 978-0-12-370522-8Google Scholar
  9. 9.
    Murali, S., et al.: A methodology for mapping multiple use-cases onto networks on chips. Proceedings of DATE, 118–123 (2006)Google Scholar
  10. 10.
    Briao, E.W., et al.: Dynamic task allocation strategies in mpsoc for soft real-time applications. Proceedings of DATE, 1386–1389 (2008)Google Scholar
  11. 11.
    Singh, A.K., Srikanthan, T., Kumar, A., Jigang, W.: Communication-aware heuristics for online task mapping on NoC-based MPSoC platforms. Journal of Systems Architecture: the EUROMICRO Journal Archive 56(4) (July 2010)Google Scholar
  12. 12.
    Carvalho, E., Moraes, F.: Congestion-aware task mapping in heterogeneous mpsocs. In: International Symposium on SoC, pp. 1–4 (November 2008)Google Scholar
  13. 13.
    Chen, W.: Task Partitioning and Mapping Algorithms for Multi-core Packet Processing Systems, p. 255, Masters Theses (2009)Google Scholar
  14. 14.
    Cao, Y.J., Qian, D.-P., Wu, W.-G., Dong, X.-S.: Adaptive Scheduling Algorithm Based on Dynamic Core-Resource Partitions for Many-Core Processor Systems. Journal of Software 23(2), 240–252 (2012)CrossRefGoogle Scholar
  15. 15.
    Walder, H., et al.: Non-preemptive Multitasking on FPGAs: Task Placement and Footprint TransformGoogle Scholar
  16. 16.
    Li, T., Yang, Y.: Algorithm of Reconfigurable Resource Management and Hardware Task Placement. Journal of Computer Research and Development, 375–382 (2008)Google Scholar
  17. 17.
    Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9(3), 319–349 (1987)zbMATHCrossRefGoogle Scholar
  18. 18.
    Dick, R.P., et al.: Tgff: task graphs for free. In: Proceedings of Workshop on Hardware/Software Co-Design, pp. 97–101 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ziyang Liu
    • 1
  • Yuzhuo Fu
    • 1
  • Jiang Jiang
    • 1
  • Xing Han
    • 1
  1. 1.School of Micro-electronicShanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations