APPLYING MULTIPLE MULTIDIMENSIONAL KNAPSACK PROBLEM TO DYNAMIC LOAD BALANCING IN DISTRIBUTED EXASCALE COMPUTING ENVIRONMENT

Ulphat Bakhishoff


Department of General and Applied Mathematics, Azerbaijan State Oil and Industry University, Baku, Azerbaijan, ulfat.baxıThis email address is being protected from spambots. You need JavaScript enabled to view it.


Abstract

Dynamic and Interactive nature of the processes in the Distributed Exascale computing system requires the system to be able to make Load Balancing in runtime. In this paper proposed applying Multiple Multidimensional Knapsack Problem for overcome imbalance at time of occurrence of the dynamic and interactive event at Distributed Exascale computing environment.

Keywords:

distributed exascale computing, load balancing, dynamic and interactive event, multiple knapsack problem.

DOI: https://doi.org/10.32010/26166127.2018.1.2.214.218

 

Reference 

[1] Shalf, J., Dosanjh, S., & Morrison, J. (2010, June). Exascale computing technology challenges. In International Conference on High Performance Computing for Computational Science (pp. 1-25). Springer, Berlin, Heidelberg.

[2] Mirtaheri, S. L., & Grandinetti, L. (2017). Dynamic load balancing in distributed exascale computing systems. Cluster Computing, 20(4), 3677-3689.

[3] Sharma, S., Singh, S., & Sharma, M. (2008). Performance analysis of load balancing algorithms. World Academy of Science, Engineering and Technology, 38(3), 269-272.

[4] Khaneghah, E. M., Mollasalehi, F., Aliev, A. R., Ismayilova, N., Bakhishoff, U. (2018, July-August) Challenges of Load Balancing to Support Distributed Exascale Computing Environment. In the 24th International Conference on Parallel and Distributed Processing Techniques & Applications, Parallel and Distributed Processing + HPC and Data Science (pp. 100-106), Las Vegas, Nevada.

[5] Sinha, P., & Zoltners, A. A. (1979). The multiple-choice knapsack problem. Operations Research, 27(3), 503-515.

[6] Balachandar, S. R., & Kannan, K. (2008). A new polynomial time algorithm for 0–1 multiple knapsack problem based on dominant principles. Applied Mathematics and Computation, 202(1), 71-77.

[7] Chekuri, C., & Khanna, S. (2005). A polynomial time approximation scheme for the multiple knapsack problem. SIAM Journal on Computing, 35(3), 713-728.

[8] Raja Balachandar, S., & Kannan, K. (2011). A Heuristic Algorithm for Resource Allocation/Reallocation Problem. Journal of Applied Mathematics, 2011.

[9] Sharifi, M., Mirtaheri, S. L., & Khaneghah, E. M. (2010). A dynamic framework for integrated management of all types of resources in P2P systems. The Journal of Supercomputing, 52(2), 149-170.

[10] Khaneghah, E. M. (2017). U.S. Patent No. 9,613,312. Washington, DC: U.S. Patent and Trademark Office.

[11] Khaneghah, E. M., & Sharifi, M. (2014). AMRC: an algebraic model for reconfiguration of high performance cluster computing systems at runtime. The Journal of Supercomputing, 67(1), 1-30.

[12] Khaneghah, E. M., ShowkatAbad, A. R., & Ghahroodi, R. N. (2018, February). Challenges of Process Migration to Support Distributed Exascale Computing Environment. In Proceedings of the 2018 7th International Conference on Software and Computer Applications (pp. 20-24). ACM.