On a load balancing algorithm based on edge coloring

作者: B.S. Joshi , S. Hosseini , K. Vairavan

DOI: 10.1109/SSST.1997.581602

关键词:

摘要: Load balancing is the process of enhancing performance a distributed system through redistribution loads among processors. In our earlier work load algorithm based on graph coloring for link-oriented structures was proposed and studied in detail. this paper we modify by introducing an important factor known as damping factor, D. This used to strike balance between runtime average response time. We observe that considerable improvement possible with application algorithm. The primary metric time system. express analytical results terms upper lower bounds

参考文章(3)
K. Vairavan, Seyed H. Hosseini, Bharat S. Joshi, Performance Evaluation of a Graph Coloring Based Load Balancing Algorithm. Parallel and distributed computing and systems. pp. 1- 4 ,(1995)
Krishna M. Kavi, Ali R. Hurson, Behrooz A. Shirazi, Scheduling and Load Balancing in Parallel and Distributed Systems IEEE Computer Society Press. ,(1995)
S.H. Hosseini, B. Litow, M. Malkawi, J. McPherson, K. Vairavan, Analysis of a graph coloring based distributed load balancing algorithm Journal of Parallel and Distributed Computing. ,vol. 10, pp. 160- 166 ,(1990) , 10.1016/0743-7315(90)90025-K