skip to main content
10.1145/3242840.3242847acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicacsConference Proceedingsconference-collections
research-article

Multi-Core Processor Scheduling Algorithm under The Influence Of Process Variation

Authors Info & Claims
Published:27 July 2018Publication History

ABSTRACT

Due to process variation, different cores of multi-core processors will generate frequency heterogeneity, and the difference in frequency will cause difference in the speed of executing instructions. The existing multi-core processor scheduling algorithms do not take the process variation into account, and ignore the deviation in the manufacturing process. This paper proposes a frequency-heterogeneous scheduling algorithm MFF (Max-Fast-First), which allocates long time-consuming tasks to cores with high frequency and assigns short time-consuming tasks to cores with low frequency, thus shortening the total operation time. The experimental results show that the MFF algorithm reduces the running time by 17.87% compared to the dynamic Min-Min algorithm, and it reduces the running time by 9.10% compared to the CATS(Criticality-Aware Task Scheduler) algorithm. At the same time, the running time of the MFF algorithm is less affected by the process variation, which is better than dynamic Min-Min and CATS to process variation.

References

  1. Teodorescu R, Torrellas J. Variation-Aware Application Scheduling and Power Management for Chip Multiprocessors{C}// International Symposium on Computer Architecture. IEEE, 2008:363--374. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Borkar S, Karnik T, Narendra S, et al. Parameter variations and impact on circuits and microarchitecture{C}// Design Automation Conference, 2003. Proceedings. IEEE, 2003:338--342. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Liu Y, Jia P, Yang Y. Scheduling of fork-join tasks on multi-core processors to avoid communication conflict{C}// TENCON 2015 - 2015 IEEE Region 10 Conference. IEEE, 2016:1--6.Google ScholarGoogle Scholar
  4. H. S. Chwa, J. Lee, K.-M. Phan, A. Easwaran, and I. Shin, "Global edf schedulability analysis for synchronous parallel tasks on multicore platforms," in Proc. of ECRTS, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Melani, M. Bertogna, V. Bonifaci, A. Marchetti-Spaccamela, and G. Buttazzo, "Response-time analysis of conditional dag tasks in multiprocessor systems," in Proc. of ECRTS, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. V. Bonifaci, A. Marchetti-Spaccamela, S. Stiller, and A. Wiese, "Feasibility analysis in the sporadic dag task model," in Proc. of ECRTS, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Baruah, "Improved multiprocessor global schedulability analysis of sporadic dag task systems," in Proc. of ECRTS, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, L. Stougie, and A. Wiese, "A generalized parallel task model for recurrent real-time processes," in Proc. of RTSS, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. I. A. Moschakis and H. D. Karatza, "A meta-heuristic optimization approach to the scheduling of bag-of-tasks applications on heterogeneous clouds with multi-level arrivals and critical jobs,"Simulation Modelling Practice and Theory, vol. 57, pp. 1--25, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  10. https://baike.baidu.com/item/cloudsim/2412165?fr=aladdinGoogle ScholarGoogle Scholar
  11. Chen H, Wang F, Na H, et al. User-priority guided Min-Min scheduling algorithm for load balancing in cloud computing{C}// Parallel Computing Technologies. IEEE, 2013:1--8.Google ScholarGoogle Scholar
  12. Chronaki K, Rico A, Casas M, et al. Task Scheduling Techniques for Asymmetric Multi-core Systems{J}. IEEE Transactions on Parallel & Distributed Systems, 2017, PP(99):1--1.Google ScholarGoogle Scholar
  13. A.Srivastava, Sylvester, and D. Blaauw. Statistical Analysis and Optimization for VLSI: Timing and Power. Springer, 2005.Google ScholarGoogle Scholar

Index Terms

  1. Multi-Core Processor Scheduling Algorithm under The Influence Of Process Variation

    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
    • Published in

      cover image ACM Other conferences
      ICACS '18: Proceedings of the 2nd International Conference on Algorithms, Computing and Systems
      July 2018
      245 pages
      ISBN:9781450365093
      DOI:10.1145/3242840

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 27 July 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader