Grid resource management
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Dynamic placement for clustered web applications
Proceedings of the 15th international conference on World Wide Web
Dynamic application placement under service and memory constraints
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
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 performance, 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 [3]. 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.