Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm

  • Published:
Journal of Zhejiang University SCIENCE C Aims and scope Submit manuscript

Abstract

Load balancing is an important stage of a system using parallel computing where the aim is the balance of workload among all processors of the system. In this paper, we introduce a new load balancing algorithm with new capabilities for parallel systems, among which is the independence of a separate route-finder algorithm between the load receiver and sender nodes. In addition to simulation of the new algorithm, due to similarity in behavior to the proposed algorithm, the central algorithm is simulated. Simulation results show that, the system performance increases with the increase of the degree of neighborhood between the processors. These results also indicate the algorithm’s high compatibility with environment changes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Berger, E., Browne, J., 1999. Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs. Proc. Int. Workshop on Cluster-Based Computing, p.1–5.

  • Borovska, P., Lazarova, M., 2007. Token-Based Adaptive Load Balancing for Dynamically Parallel Computations on Multicomputer Platforms. Int. Conf. on Computer Systems and Technologies, p.31–36. [doi:10.1145/1330 598.1330611]

  • Chhabra, A., Singh, G., Waraich, E., Sidhu, B., Kumar, G., 2006. Qualitative Parametric Comparison of Load Balancing Algorithms in Parallel and Distributed Computing Environment. Proc. World Academy of Science, Engineering and Technology, p.39–42.

  • Cruz, F.R.B., Mateus, G.R., 2003. Parallel algorithms for a multi-level network optimization problem. Parall. Algor. Appl., 18(3):121–137.

    MathSciNet  MATH  Google Scholar 

  • de Ronde, J.F., Schoneveld, A., Sloot, P.M.A., Floras, N., Reeve, J., 1996. Load balancing by redundant decomposition and mapping. LNCS, 1067:555–561. [doi:10.1007/3-540-61142-8_596]

    Google Scholar 

  • Fonlupt, C., Marquet, P., Dekeyser, J., 1995. Analysis of Synchronous Dynamic Load Balancing Algorithms. In: Parallel Computing: State-of-the-Art Perspective Advances in Parallel Computing, p.1–8.

  • Fonlupt, C., Marquet, P., Dekeyser, J., 1996. Data-parallel load balancing strategies. Parall. Comput., 24(11):1665–1684. [doi:10.1016/S0167-8191(98)00049-0]

    Article  Google Scholar 

  • Garcia, T., Semé, D., 2006. A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms. 21st Int. Conf. on Computers and Their Applications, p.301–306.

  • Giusti, A.D., Naiouf, M., Giusti, L.D., Chichizola, F., 2005. Dynamic load balancing in parallel processing on non-homogeneous clusters. J. Comput. Sci. Technol., 5(4): 272–278.

    Google Scholar 

  • Grama, A., Gupta, A., Karypis, G., Kumar, V., 2003. Introduction to Parallel Computing (2nd Ed.). Addison Wesley, USA.

    Google Scholar 

  • Kuchen, H., Wagener, A., 1990. Comparison of Dynamic Load Balancing Strategies. Technical Report, RWTH Aachen, Department of Computer Science, Aachener Informatik-Berichte (AIB).

  • Lai, A., Shieh, C., Ueng, J., Kok, Y., Kung, L., 1997. Load Balancing in Software Distributed Shared Memory Systems. IEEE Int. Performance, Computing, and Communications Conf., p.152–158.

  • Legrand, A., Renard, H., Robert, Y., Vivien, F., 2004. Mapping and load-balancing iterative computations. IEEE Trans. Parall. Distr. Syst., 15(6):546–558. [doi:10.1109/TPDS.2004.10]

    Article  Google Scholar 

  • Lüling, R., Monien, B., Ramme, F., 1991. A Study on Dynamic Load Balancing Algorithms. Proc. 3rd IEEE SPDP, p.686–689.

  • Osman, A., Ammar, H., 2002. Dynamic load balancing strategies for parallel computers. Sci. Ann. J. Cuza Univ., 11:110–120.

    Google Scholar 

  • Wu, M., 1997. On runtime parallel scheduling for processor load balancing. IEEE Trans. Parall. Distr. Syst., 8(2): 173–186. [doi:10.1109/71.577261]

    Article  Google Scholar 

  • Zamanifar, K., Nematbakhsh, N., Sadjady, R.S., 2010. A New Load Balancing Algorithm in Parallel Computing. 2nd Int. Conf. on Communication Software and Networks, p.449–453. [doi:10.1109/ICCSN.2010.27]

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Razieh Sadat Sadjady.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sadjady, R.S., Zamanifar, K. A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm. J. Zhejiang Univ. - Sci. C 12, 455–463 (2011). https://doi.org/10.1631/jzus.C1000211

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.C1000211

Key words

CLC number

Navigation