Automatic node selection for high performance applications on networks
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (8) , 163-172
- https://doi.org/10.1145/301104.301119
Abstract
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for execution. Automatic selection of nodes is complex as the best choice depends on the application structure as well as the expected availability of computation and communication resources. This paper presents a solution to this problem for realistic application and network scenarios. A new algorithm to jointly analyze computation and communication resources for different application demands is introduced and a framework for automatic node selection is developed on top of , which is a query interface to network information. The paper reports results from a set of applications, including Airshed pollution modeling and magnetic resonance imaging, executing on a high speed network testbed. The results demonstrate that node selection is effective in enhancing application performance in the presence of computation load as well as network traffic. Under the network conditions used for experiments, the increase in execution time due to compute loads and network congestion was reduced by half with node selection. The node selection algorithms developed in this research are also applicable to dynamic migration of long running jobs.Keywords
This publication has 16 references indexed in Scilit:
- Run-time and compile-time support for adaptive irregular problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- System support for mobile multimedia applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A framework based approach to the development of network aware applicationsIEEE Transactions on Software Engineering, 1998
- Network-aware distributed computing: A case studyPublished by Springer Nature ,1998
- The Legion vision of a worldwide virtual computerCommunications of the ACM, 1997
- Implementing a performance forecasting system for metacomputingPublished by Association for Computing Machinery (ACM) ,1997
- Application-level scheduling on distributed heterogeneous networksPublished by Association for Computing Machinery (ACM) ,1996
- Exploiting process lifetime distributions for dynamic load balancingPublished by Association for Computing Machinery (ACM) ,1996
- Optimal latency-throughput tradeoffs for data parallel pipelinesPublished by Association for Computing Machinery (ACM) ,1996
- Wide area traffic: the failure of Poisson modelingIEEE/ACM Transactions on Networking, 1995