Skip to main content
SpringerLink
Log in
Book cover

International Conference on Embedded Computer Systems

SAMOS 2019: Embedded Computer Systems: Architectures, Modeling, and Simulation pp 127–141Cite as

Scalable Optimal Greedy Scheduler for Asymmetric Multi-/Many-Core Processors

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11733))

Abstract

Ubiquitous asymmetric multi-core processors such as ARM big.LITTLE combine together cores with different power-performance characteristics on a single chip. Upcoming asymmetric many-core processors are expected to combine hundreds of cores belonging to different types. However, the accompanying task-to-core mapping schedules are the key to achieving the full potential of such processors. Run-time scheduling on asymmetric processors is a much harder problem to solve optimally than scheduling on symmetric processors with equivalent cores. We present the first-ever greedy scheduler to be proven theoretically optimal (under certain constraints) for asymmetric processors. The proposed scheduler, called A-Greedy, improves throughput by 26% and reduces average response time by up to 45% when compared to the default Linux scheduler on ARM big.LITTLE asymmetric multi-core.

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

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: AFIPS (1967)

    Google Scholar 

  2. Bienia, C., et al.: Parsec 2.0: a new benchmark suite for chip-multiprocessors. In: PMBS (2009)

    Google Scholar 

  3. Cong, J., et al.: Energy-efficient scheduling on heterogeneous multi-core architectures. In: ISLPED (2012)

    Google Scholar 

  4. Corrêa, M., et al.: Operating system multilevel load balancing. In: SAC (2006)

    Google Scholar 

  5. van Dijk, T., et al.: Lace: non-bocking split deque for work-stealing. In: Euro-Par (2014)

    Google Scholar 

  6. Feitelson, D.G., et al.: Toward convergence in job schedulers for parallel supercomputers. In: JSSPP (1996)

    Google Scholar 

  7. Feitelson, D.G., et al.: Metrics and benchmarking for parallel job scheduling. In: JSSPP (1998)

    Chapter  Google Scholar 

  8. Goens, A., et al.: Analysis of process traces for mapping dynamic KPN applications to MPSoCs. In: IESS (2015)

    Google Scholar 

  9. Gulati, D.P., et al.: multitasking workload scheduling on flexible-core chip multiprocessors. In: PACT (2008)

    Google Scholar 

  10. Henkel, J., et al.: Invasive manycore architectures. In: ASP-DAC (2012)

    Google Scholar 

  11. Kumar, R., et al.: Single-ISA heterogeneous multi-core architectures: the potential for processor power reduction. In: MICRO (2003)

    Google Scholar 

  12. Libutti, S., et al.: Co-scheduling tasks on multi-core heterogeneous systems: an energy-aware perspective. Comput. Digit. Tech. 10, 77–84 (2016)

    Article  Google Scholar 

  13. Liu, G., et al.: Dynamic thread mapping for high-performance, power-efficient heterogeneous many-core systems. In: ICCD (2013)

    Google Scholar 

  14. Muthukaruppan, T.S., et al.: Hierarchical power management for asymmetric multi-core in dark silicon era. In: DAC (2013)

    Google Scholar 

  15. Muthukaruppan, T.S., et al.: Price theory based power management for heterogeneous multi-cores. In: ASPLOS (2014)

    Google Scholar 

  16. Optimization, G.: Gurobi optimizer 8.0. Gurobi (2018). http://www.gurobi.com

  17. Pathania, A.: Scalable Task Schedulers for Many-Core Architectures. Ph.D. thesis, Karlsruhe Institute of Technology, Germany (2018)

    Google Scholar 

  18. Pathania, A., et al.: Optimal greedy algorithm for many-core scheduling. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 36, 1054–1058 (2017)

    Article  Google Scholar 

  19. Pd, S.M., et al.: 3D many-core microprocessor power management by space-time multiplexing based demand-supply matching. IEEE Trans. Comput. 64, 3022–3036 (2015)

    Article  MathSciNet  Google Scholar 

  20. Ristov, S., et al.: Superlinear speedup in HPC systems: why and when? In: FedCSIS (2016)

    Google Scholar 

  21. Singh, A.K., et al.: Mapping on multi/many-core systems: survey of current and emerging trends. In: DAC (2013)

    Google Scholar 

  22. Stuber, M.D., et al.: Convex and concave relaxations of implicit functions. Optim. Methods Softw. 30, 424–460 (2015)

    Article  MathSciNet  Google Scholar 

  23. Venkataramani, V., et al.: Scalable dynamic task scheduling on adaptive many-core. In: MCSoC (2018)

    Google Scholar 

  24. Winter, J.A., et al.: Scalable thread scheduling and global power management for heterogeneous many-core architectures. In: PACT (2010)

    Google Scholar 

Download references

Acknowledgment

This work was supported by the National Research Foundation, Prime Minister’s Office, Singapore under its Industry-IHL Partnership Grant NRF2015-IIP003. We thank the anonymous reviewers for their valuable feedback and insights.

Author information

Authors and Affiliations

  1. National University of Singapore, Singapore, Singapore

    Vanchinathan Venkataramani, Anuj Pathania & Tulika Mitra

Authors
  1. Vanchinathan Venkataramani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anuj Pathania
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tulika Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vanchinathan Venkataramani .

Editor information

Editors and Affiliations

  1. Technical University of Crete and ICS - FORTH, Chania, Greece

    Dionisios N. Pnevmatikatos

  2. INSA Rennes, Rennes Cedex 7, France

    Maxime Pelcat

  3. Fraunhofer IESE, Kaiserslautern, Germany

    Matthias Jung

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Venkataramani, V., Pathania, A., Mitra, T. (2019). Scalable Optimal Greedy Scheduler for Asymmetric Multi-/Many-Core Processors. In: Pnevmatikatos, D., Pelcat, M., Jung, M. (eds) Embedded Computer Systems: Architectures, Modeling, and Simulation. SAMOS 2019. Lecture Notes in Computer Science(), vol 11733. Springer, Cham. https://doi.org/10.1007/978-3-030-27562-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27562-4_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27561-7

  • Online ISBN: 978-3-030-27562-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation