Abstract
Efficient usage of shared high-performance computing (HPC) resources raises the problem of HPC applications co-scheduling, i.e. the problem of execution of multiple applications simultaneously on the same shared computing nodes. Each application may have different requirements for shared resources (e.g. network bandwidth or memory bus bandwidth). When these resources are used concurrently, their resource throughputs may decrease, which leads to performance degradation.
In this paper we define application behavior model in co-scheduling environment and formalize a scheduling problem. Within the model we evaluate trivial strategies and compare them with an optimal strategy. The comparison provides a simple analytical criteria for choosing between a naive strategy of running all applications in parallel or any sophisticated strategies that account for applications performance degradation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aupy, G., et al.: Co-scheduling Amdahl applications on cache-partitioned systems. Int. J. High Perform. Comput. Appl. 32(1), 123–138 (2018)
Aupy, G., Benoit, A., Goglin, B., Pottier, L., Robert, Y.: Co-scheduling HPC workloads on cache-partitioned CMP platforms. Int. J. High Perform. Comput. Appl. 33(6), 1221–1239 (2019)
Aupy, G., Benoit, A., Pottier, L., Raghavan, P., Robert, Y., Shantharam, M.: Co-scheduling high-performance computing applications. In: Big Data: Management, Architecture, and Processing, May 2017. https://hal.inria.fr/hal-02082818
Bailey, D., Harris, T., Saphir, W., Van Der Wijngaart, R., Woo, A., Yarrow, M.: The NAS parallel benchmarks 2.0. Technical report, Technical Report NAS-95-020, NASA Ames Research Center (1995)
Bienia, C.: Benchmarking Modern Multiprocessors. Ph.D. thesis, Princeton University, January 2011
Eyerman, S., Michaud, P., Rogiest, W.: Revisiting symbiotic job scheduling. In: 2015 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pp. 124–134. IEEE (2015)
Jain, R., Hughes, C.J., Adve, S.V.: Soft real-time scheduling on simultaneous multithreaded processors. In: 23rd IEEE Real-Time Systems Symposium, RTSS 2002, pp. 134–145. IEEE (2002)
Kuchumov, R., Korkhov, V.: Collecting HPC applications processing characteristics to facilitate co-scheduling. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12254, pp. 168–182. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58817-5_14
Li, Y., Sun, D., Lee, B.C.: Dynamic colocation policies with reinforcement learning. ACM Trans. Architect. Code Optim. (TACO) 17(1), 1–25 (2020)
Parekh, S., Eggers, S., Levy, H., Lo, J.: Thread-sensitive scheduling for SMT processors (2000)
Snavely, A., Mitchell, N., Carter, L., Ferrante, J., Tullsen, D.: Explorations in symbiosis on two multithreaded architectures. In: Workshop on Multi-Threaded Execution, Architecture, and Compilers (1999)
Snavely, A., Tullsen, D.M.: Symbiotic jobscheduling for a simultaneous multithreaded processor. In: Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 234–244 (2000)
Trinitis, C., Weidendorfer, J.: Co-scheduling of HPC Applications, vol. 28. IOS Press (2017)
Trinits, C., Weidendorfer, J.: First workshop on co-scheduling of HPC Applications (COSH 2016)
Zacarias, F.V., Petrucci, V., Nishtala, R., Carpenter, P., Mossé, D.: Intelligent colocation of workloads for enhanced server efficiency. In: 2019 31st International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), pp. 120–127. IEEE (2019)
Acknowledgements
Research has been supported by the RFBR grant No. 19-37-90138.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Kuchumov, R., Korkhov, V. (2021). An Analytical Bound for Choosing Trivial Strategies in Co-scheduling. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2021. ICCSA 2021. Lecture Notes in Computer Science(), vol 12956. Springer, Cham. https://doi.org/10.1007/978-3-030-87010-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-87010-2_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-87009-6
Online ISBN: 978-3-030-87010-2
eBook Packages: Computer ScienceComputer Science (R0)