SCIENCE@home

Reducing Global Schedulers Complexity through Runtime System Decoupling

A. Santana,Vinicius Freitas,L. Pilla,M. Castro,Jean-François Méhaut

Published 2018 in Symposium on High Performance Computing Systems

ABSTRACT

Global schedulers are components used in parallel solutions, specially in dynamic applications, to optimize resource usage. Nonetheless, their development is a cumbersome process due to necessary adaptations to cope with the programming interfaces and abstractions of runtime systems. This paper proposes a model to dissociate schedulers from runtime systems to lower software complexity. Our model is based on the scheduler breakdown into modular and reusable concepts that better express the scheduler requirements. Through the use of meta-programming and design patterns, we were able to achieve fully reusable workload-aware scheduling strategies with up to 63% fewer lines of code with negligent run time overhead.

PUBLICATION RECORD

  • Publication year

    2018

  • Venue

    Symposium on High Performance Computing Systems

  • Publication date

    2018-10-01

  • Fields of study

    Computer Science, Engineering

  • Identifiers
    DOI 10.1109/WSCAD.2018.00016
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-19 of 19 references · Page 1 of 1

CITED BY