This is a Pytorch implementation of the paper: READYS: A Reinforcement Learning Based Strategy for Heterogeneous Dynamic Scheduling

Requirements

• Python 3.7
• For the other packages, please refer to the requirements.txt.
• Some packages (PyTorch, torch-geometric) may have to be installed separately.

Usage

The main script is train.py . You can reproduce the results by:

pip install -r requirements.txt
python train.py

Options

DAG types

It is possible to train on three types of DAG: Cholesky, QR, LU, like in the following examples:

python train.py -env_type chol
python train.py -env_type QR
python train.py -env_type LU

Number of tiles T

The parameter n controls the number of tiles T. As the graphs grow rapidly with the number of tiles, the training can become slow from 10 onwards.

python train.py -env_type QR -n 4

Number of CPUs and GPUs

To change the number of processors on which the scheduling is made:

python train.py -nCPU 2 -nGPU 2

Number of CPUs and GPUs

For other hyper-parameters concerning the RL algorithm or training, please look at the parser arguments at the top of the train file.

Citation

Nathan Grinsztajn, Olivier Beaumont, Emmanuel Jeannot, Philippe Preux. READYS: A Reinforcement Learning Based Strategy for Heterogeneous Dynamic Scheduling. IEEE Cluster 2021, Sep 2021, Portland / Virtual, United States.

@inproceedings{grinsztajn:hal-03313229,
  TITLE = {{READYS: A Reinforcement Learning Based Strategy for Heterogeneous Dynamic Scheduling}},
  AUTHOR = {Grinsztajn, Nathan and Beaumont, Olivier and Jeannot, Emmanuel and Preux, Philippe},
  BOOKTITLE = {{IEEE Cluster 2021}},
  YEAR = {2021},
}