论文信息 - An Analytical Bound for Choosing Trivial Strategies in Co-scheduling - 字舞流文

An Analytical Bound for Choosing Trivial Strategies in Co-scheduling

Vladimir Korkhov | Ruslan Kuchumov

[1] Vladimir Korkhov,et al. Collecting HPC Applications Processing Characteristics to Facilitate Co-scheduling , 2020, ICCSA.

[2] Yves Robert,et al. Co-scheduling Amdahl applications on cache-partitioned systems , 2018, Int. J. High Perform. Comput. Appl..

[3] Yves Robert,et al. Co-scheduling HPC workloads on cache-partitioned CMP platforms , 2019, Int. J. High Perform. Comput. Appl..

[4] SnavelyAllan,et al. Symbiotic jobscheduling for a simultaneous multithreaded processor , 2000 .

[5] Yuhao Li,et al. Dynamic Colocation Policies with Reinforcement Learning , 2020, ACM Trans. Archit. Code Optim..

[6] Yves Robert,et al. Co-Scheduling High-Performance Computing Applications , 2017 .