{"title":"Application placement using performance surfaces","authors":"A. Turgeon, Q. Snell, M. Clement","doi":"10.1109/HPDC.2000.868654","DOIUrl":null,"url":null,"abstract":"Heterogeneous parallel clusters of workstations are being used to solve many important computational problems. Scheduling parallel applications on the best collection of machines in a heterogeneous computing environment is a complex problem. Performance prediction is vital to good application performance in this environment since utilization of an ill-suited machine can slow the computation down significantly. The heterogeneity of the different pieces composing the parallel platform (network links, CPU, memory, and OS) makes it incredibly difficult to accurately predict performance. This paper addresses the problem of network performance prediction. Since communication speed is often the bottleneck for parallel application perfomance, network performance prediction is important to the overall performance prediction problem. A new methodology for characterizing network links and application's need for network resources is developed which makes use of performance surfaces (Clement et al., 1998). Mathematical operations on the performance surfaces are introduced that calculate an application's affinity for a network configuration. These affinity measures can be used for the scheduling of parallel applications.","PeriodicalId":400728,"journal":{"name":"Proceedings the Ninth International Symposium on High-Performance Distributed Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings the Ninth International Symposium on High-Performance Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPDC.2000.868654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
Heterogeneous parallel clusters of workstations are being used to solve many important computational problems. Scheduling parallel applications on the best collection of machines in a heterogeneous computing environment is a complex problem. Performance prediction is vital to good application performance in this environment since utilization of an ill-suited machine can slow the computation down significantly. The heterogeneity of the different pieces composing the parallel platform (network links, CPU, memory, and OS) makes it incredibly difficult to accurately predict performance. This paper addresses the problem of network performance prediction. Since communication speed is often the bottleneck for parallel application perfomance, network performance prediction is important to the overall performance prediction problem. A new methodology for characterizing network links and application's need for network resources is developed which makes use of performance surfaces (Clement et al., 1998). Mathematical operations on the performance surfaces are introduced that calculate an application's affinity for a network configuration. These affinity measures can be used for the scheduling of parallel applications.
异构并行工作站集群正被用于解决许多重要的计算问题。在异构计算环境中,在最佳机器集合上调度并行应用程序是一个复杂的问题。在这种环境中,性能预测对于良好的应用程序性能至关重要,因为使用不合适的机器会大大降低计算速度。组成并行平台的不同部分(网络链接、CPU、内存和操作系统)的异构性使得准确预测性能变得异常困难。本文主要研究网络性能预测问题。由于通信速度通常是并行应用程序性能的瓶颈,因此网络性能预测对于整体性能预测问题非常重要。一种利用性能面来描述网络链接和应用程序对网络资源需求的新方法被开发出来(Clement et al., 1998)。介绍了性能面上的数学运算,用于计算应用程序对网络配置的亲和力。这些关联度量可用于并行应用程序的调度。