IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v24y2021i5d10.1007_s10951-021-00685-8.html
   My bibliography  Save this article

Scheduling periodic I/O access with bi-colored chains: models and algorithms

Author

Listed:
  • Emmanuel Jeannot

    (Inria, LaBRI, Univ. Bordeaux)

  • Guillaume Pallez

    (Inria, LaBRI, Univ. Bordeaux)

  • Nicolas Vidal

    (Inria, LaBRI, Univ. Bordeaux)

Abstract

Observations show that some HPC applications periodically alternate between (i) operations (computations, local data accesses) executed on the compute nodes, and (ii) I/O transfers of data and this behavior can be predicted before-hand. While the compute nodes are allocated separately to each application, the storage is shared, and thus, I/O access can be a bottleneck leading to contention. To tackle this issue, we design new static I/O scheduling algorithms that prescribe when each application can access the storage. To design a static algorithm, we emphasize on the periodic behavior of most applications. Scheduling the I/O volume of the different applications is repeated over time. This is critical since often the number of application runs is very high. In the following article, we develop a formal background for I/O scheduling. First, we define a model, bi-colored chain scheduling, and then, we go through related results existing in the literature and explore the complexity of this problem variants. Finally, to match the HPC context, we perform experiments based on use cases matching highly parallel applications or distributed learning framework

Suggested Citation

  • Emmanuel Jeannot & Guillaume Pallez & Nicolas Vidal, 2021. "Scheduling periodic I/O access with bi-colored chains: models and algorithms," Journal of Scheduling, Springer, vol. 24(5), pages 469-481, October.
    • Handle: RePEc:spr:jsched:v:24:y:2021:i:5:d:10.1007_s10951-021-00685-8
    DOI: 10.1007/s10951-021-00685-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00685-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-021-00685-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:24:y:2021:i:5:d:10.1007_s10951-021-00685-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.