skip to main content
10.1145/3377049.3377135acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccaConference Proceedingsconference-collections
research-article

Qalitative Study of Contention-aware Scheduling Algorithm for Asymmetric Multicore Processors

Authors Info & Claims
Published:20 March 2020Publication History

ABSTRACT

For last few decades, multitasking is at its highest demand. To achieve multitasking, symmetric & asymmetric multi-core processors system is a popular technology. Asymmetric multi-core processors (AMPs) use the same instruction set architecture (ISA) but different clock frequency. It is shown that AMPs deliver better performance per watt comparing to its symmetric counterpart. The future multi-core system will combine a few fast cores & many slow cores. Fast core means high power consumption with complex pipelines and high clock frequency, where the slow core will have low power consumption with simple pipelines and low clock frequency. To get the best performance from the asymmetric multi-core processors, the best scheduling policy will play an important role. Scheduling co-running applications in the most suitable core types are very vital for AMPs to get its best performance. Various policies like contention-aware, parallelism-aware & asymmetric-aware need to be considered when developing a scheduling algorithm. For AMPs, contention for resource sharing is a key performance-limiting factor. Despite noteworthy research efforts, the contention for resource sharing in the multi-core processor remains unsolved. In this paper, we discuss the latest five contention-aware scheduling algorithms of AMPs. We present a comparative study exploiting the technique, parameter & performance improvement so that the future computer scientist can develop a contention-aware solution more precisely.

References

  1. Saeid Barati and Hank Hoffmann. 2016. Providing fairness in heterogeneous multicores with a predictive, adaptive scheduler. In 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 38--49.Google ScholarGoogle ScholarCross RefCross Ref
  2. Dhruba Chandra, Fei Guo, Seongbeom Kim, and Yan Solihin. 2005. Predicting inter-thread cache contention on a chip multi-processor architecture. In 11th International Symposium on High-Performance Computer Architecture. IEEE, 340--351.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Genti Daci and Megi Tartari. 2013. A comparative review of contention-aware scheduling algorithms to avoid contention in multicore systems. In Proceedings of the third international conference on trends in information, telecommunication and computing. Springer, 99--106.Google ScholarGoogle ScholarCross RefCross Ref
  4. Tanima Dey, Wei Wang, Jack Davidson, and Mary Lou Soffa. [n.d.]. A Study of the Effect of Prefetching in Shared-Memory Resource Contention. Memory 1, L1 ([n.d.]), L1.Google ScholarGoogle Scholar
  5. Jiun-Hung Ding, Ya-Ting Chang, Zhou-dong Guo, Kuan-Ching Li, and Yeh-Ching Chung. 2014. An efficient and comprehensive scheduler on Asymmetric Multicore Architecture systems. Journal of Systems Architecture 60, 3 (2014), 305--314.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Xiaokang Fan, Yulei Sui, and Jingling Xue. 2015. Contention-aware scheduling for asymmetric multicore processors. In 2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 742--751.Google ScholarGoogle Scholar
  7. Alexandra Fedorova, Margo Seltzer, and Michael D Smith. 2007. Improving performance isolation on chip multiprocessors via an operating system scheduler. In 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007). IEEE, 25--38.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Avner Friedman. 1992. Interprocessor memory contention. In Mathematics in Industrial Problems. Springer, 112--121.Google ScholarGoogle Scholar
  9. Adrian Garcia-Garcia, Juan Carlos Saez, and Manuel Prieto-Matias. 2017. Delivering Fairness on Asymmetric Multicore Systems via Contention-Aware Scheduling. In European Conference on Parallel Processing. Springer, 610--622.Google ScholarGoogle Scholar
  10. Muneeb Khan, Andreas Sandberg, and Erik Hagersten. 2014. A case for resource efficient prefetching in multicores. In 2014 43rd International Conference on Parallel Processing. IEEE, 101--110.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Rakesh Kumar, Keith I Farkas, Norman P Jouppi, Parthasarathy Ranganathan, and Dean M Tullsen. 2003. Single-ISA heterogeneous multi-core architectures: The potential for processor power reduction. In Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture. IEEE Computer Society, 81.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Rakesh Kumar, Dean M Tullsen, Parthasarathy Ranganathan, Norman P Jouppi, and Keith I Farkas. 2004. Single-ISA heterogeneous multi-core architectures for multithreaded workload performance. In Proceedings. 31st Annual International Symposium on Computer Architecture, 2004. IEEE, 64--75.Google ScholarGoogle ScholarCross RefCross Ref
  13. Nagesh B Lakshminarayana, Jaekyu Lee, and Hyesoon Kim. 2009. Age based scheduling for asymmetric multiprocessors. In Proceedings of the conference on high performance computing networking, storage and analysis. IEEE, 1--12.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Tong Li, Dan Baumberger, David A Koufaty, and Scott Hahn. 2007. Efficient operating system scheduling for performance-asymmetric multi-core architectures. In SC'07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing. IEEE, 1--11.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Simone Libutti, Giuseppe Massari, and William Fornaciari. 2016. Co-scheduling tasks on multi-core heterogeneous systems: An energy-aware perspective. IET Computers & Digital Techniques 10, 2 (2016), 77--84.Google ScholarGoogle ScholarCross RefCross Ref
  16. Tipp Moseley, Joshua L Kihm, Daniel A Connors, and Dirk Grunwald. 2005. Methods for modeling resource contention on simultaneous multithreading processors. In 2005 International Conference on Computer Design. IEEE, 373--380.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Sergey Zhuravlev, Sergey Blagodurov, and Alexandra Fedorova. 2010. Addressing shared resource contention in multicore processors via scheduling. In ACM Sigplan Notices, Vol. 45. ACM, 129--142.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Qalitative Study of Contention-aware Scheduling Algorithm for Asymmetric Multicore Processors

    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
      ICCA 2020: Proceedings of the International Conference on Computing Advancements
      January 2020
      517 pages
      ISBN:9781450377782
      DOI:10.1145/3377049

      Copyright © 2020 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 the author(s) 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: 20 March 2020

      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