Skip to main content

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

  • Conference paper
Computer Engineering and Technology (NCCET 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 337))

Included in the following conference series:

  • 1022 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. Bazargan, K., et al.: Fast Template Placement for Reconfigurable Computing Systems. IEEE Design and Test of Computers 17, 68–83 (2000)

    Google Scholar 

  5. Purtilo, J.M., Hofmeister, C.R.: Dynamic Reconfiguration of Distributed Programs. Distributed Computing Systems, 560–571 (1991)

    Google Scholar 

  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. Sherwood, T., Perelman, E., Hamerly, G., Sai, S., Calder, B.: Discovering and Exploiting Program phases. IEEE Micro, 84–93 (2003)

    Google Scholar 

  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-8

    Google Scholar 

  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. 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. 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. Carvalho, E., Moraes, F.: Congestion-aware task mapping in heterogeneous mpsocs. In: International Symposium on SoC, pp. 1–4 (November 2008)

    Google Scholar 

  13. Chen, W.: Task Partitioning and Mapping Algorithms for Multi-core Packet Processing Systems, p. 255, Masters Theses (2009)

    Google Scholar 

  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)

    Google Scholar 

  15. Walder, H., et al.: Non-preemptive Multitasking on FPGAs: Task Placement and Footprint Transform

    Google Scholar 

  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. 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)

    MATH  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Z., Fu, Y., Jiang, J., Han, X. (2013). Dynamic and Online Task Scheduling Algorithm Based on Virtual Compute Group in Many-Core Architecture. In: Xu, W., Xiao, L., Lu, P., Li, J., Zhang, C. (eds) Computer Engineering and Technology. NCCET 2012. Communications in Computer and Information Science, vol 337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35898-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35898-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35897-5

  • Online ISBN: 978-3-642-35898-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics