Abstract

The rapid development in computing resources has enhanced the performance of computers and reduced their costs. This availability of low cost powerful computers coupled with the popularity of the Internet and high-speed networks has led the computing environment to be mapped from distributed to Grid environments. Grid is a type of distributed system that supports the sharing and coordinated use of geographically distributed and multi- owner resources independently from their physical type and location in dynamic virtual organizations that share the same goal of solving large-scale applications. A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. Grid computing is concerned with “Coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations”. The key concept is the ability to negotiate resource-sharing arrangements among a set of participating parties (providers and consumers) and then to use the resulting resource pool for some purpose.

The sharing concern is not primarily file exchange, but rather direct access to computers, software, data, and other resources, as is required by a range of collaborative problem solving and resource-brokering strategies emerging in industry, science, and engineering. This sharing is, necessarily, highly controlled, with resource providers and consumers defining clearly and carefully just what is shared, who is allowed to share, and the conditions under which sharing occurs. A set of individuals and/or institutions defined by such sharing rules form what we call a virtual organization.

Keywords
Grid Computing, Load Balancing, Architecture, Distributed
How to Cite this Article?
Rathore, N. (2017). A Review Towards: Load Balancing Techniques. i-manager’s Journal on Power Systems Engineering, 4(4), 47-60.
References
[1]. M. Dobber, G. M. Koole, and R. D. Van Der Mei, (2004). “Dynamic load balancing for a grid application”. In Proceedings of HiPC'04, pp.342-352. Springer-Verslag.
[2]. Qureshi K, and Hussain SS, (2008). “A comparative study of parallelization strategies for fractal image scompression on a cluster of workstations”. Int. J. Comput. Methods, Vol.5, No.3, pp.463-482.
[3]. Rehman A, Qureshi K, Manuel P, and Rashid H, (2008). “Resource topology aware GridSim: A step a head”. J. Comput., Vol.19, No.2, pp.13-22.
[4]. Mark Baker, Rajkumar Buyya, and Domenico Laforenza, (2000). “The Grid: International Efforts in Global Computing”. Intl. Conferences on Advances in Infrastructure for Electronic, Business, Science, and Education on the Internet, Italy.
[5]. Ian Foster, C. Kesselman, and Steve Tuecke, (2001). “The Anatomy of the Grid: Enabting Scalable Virtual Organization” International Journal of Supercomputer Applications, Vol.15, No.3. Retrieved from http://www. globus.oryfrescarch/papers/anatomy.pdf
[6]. Parveen Jain, and Daya Gupta, (2009). “An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service”. Int. J. of Recent Trends in Engineering and Technology, Vol.1, No.1, pp.232-236.
[7]. Kabalan, K.Y., W.W. Smar, and J.Y. Hakimian, (2002). “Adaptive load sharing in heterogeneous systems: Policies, modifications, and simulation”. Intl. J. Simulation, Vol.3, No.1-2, pp.89-100.
[8]. Y. Zomaya, and Yee-Hwei, (2001). “Observations on using genetic algorithms for dynamic load-balancing”. IEEE Trans. on Parallel and Distributed Systems, Vol.12, No.9, pp.899-911.
[9]. Y. Lan, and T. Yu, (1995). “A Dynamic Central Scheduler Load-Balancing Mechanism”. Proc. 14th IEEE Conf. on Computers and Communication, Tokyo, Japan, pp.734- 740.
[10]. H.C. Lin and C.S. Raghavendra, (1992). “A Dynamic Load-Balancing Policy with a Central Job Dispatcher (LBC)”, IEEE Transaction on Software Engineering, Vol.18, No.2, pp.148-158.
[11]. Z. Zeng and B. Veeravalli, (2004). “Rate-Based and Queue-Based Dynamic Load Balancing Algorithms in Distributed Systems”. Proc. 10th IEEE Int. Conf. on Parallel and Distributed Systems, pp.349- 356.
[12]. M. Amini and H. Deldari, (2006). “Grid Load Balancing using an Echo System of Ants”, Proc. of 24th IASTED Int. Conf., Innsbruck, Austria, pp.47-52.
[13]. Jerrell Watts, and Stephen Taylor, (1998). “A Practical Approach to Dynamic Load Balancing”. Journal of Computer Science, Vol.3, No.3, pp.186-194.
[14]. Yagoubi and Y. Slimani, (2007). “Task Load Balancing Strategy for Grid Computing”. IEEE Transactions on Parallel and Distributed Systems, Vol.9, No.3, PP.235-248.
[15]. Alaoui, Frieder and El-hzawi, (1999). “A parallel genetic algorithm for task mapping on parallel machine”. IPPS 1999: Parallel and Distributed Processing, pp 201-209.
[16]. Belabbas Yagoubi and Yahya Slimani, “Dynamic Load Balancing Strategy for Grid Computing”. Proc. of World Academy of Science, Engineering and Technology, Vol.13, pp.260-265.
[17]. Foster, and C. Kesselman, (1998). “The Globus Project: a Status Report”. In Proc. of Seventh Heterogeneous Computing Workshop (HCW 98), pp.4-18.
[18]. Chervenak, A., I. Fosterand C. Kesselman, C . Salisbury, and S. Tuecke, (2000). “The data Grid: Towards architecture for the distributed management and analysis of large scientific datasets”. J. Network and Computer Applications, Vol.23, No.3, pp.187-200.
[19]. Xu, C.Z. and F.C.M. Lau, (1997). Load Balancing in Parallel Computers: Theory and Practice. Kluwer, Boston, MA.
[20]. Berman, F., G. Fox, and Y. Hey, (2003). Grid Computing: Making the Global Infrastructure a Reality. Wiley Series in Comm. Networking & Distributed System.
[21]. Yanmin Zhu, and Lionel M. Ni, (2013). A Survey on Grid Scheduling Systems. Technical Report SJTU_CS_TR_ 200309001, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
[22]. Leinberger, W., G. Karypis, V. Kumar, and R. Biswas, (2000). “Load balancing across near homogeneous multi-resource servers”. In 9th Heterogeneous Computing Workshop, pp.60-71.
[23]. Buyya, R., (n.d). A Grid Simulation Toolkit for Resource Modelling and Application Scheduling for Parallel and Distributed Computing, The Gridbus Project, GRIDS Lab, The University of Melbourne,
[24]. Belabbas Yagoubi, Hadj Tayed lilia, and Halima Si Moussa, (2006). “Load Balancing in Grid Computing”. Asian Journal of Information Technology, Vol.5, No.10, pp. 1095-1103.
[25]. Foster, I, (2002). “The grid: A new infrastructure for 21st Century Science”. Physics Today, Vol.55, No.2, pp.42-47.
[26]. Foster, I., and C. Kesselman, (1998). The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufman.
[27]. Arora, M., S. K. Das, and R. Biswas, (2002). “A decentralized scheduling and load balancing algorithm for heterogeneous grid environments”. In Proc. of International Conference on Parallel Processing Workshop (ICPPW’02), Vancouver, British Columbia Canada, pp.499-505.
[28]. Fangpeng Dong, and G. Akl Selim, (2006). Scheduling Algorithm for Grid Computing: State-of-theart and Open Problems. Technical Report, No. 2006-504, School of Computing, Queen’s University Kingston, Ontario.
[29]. Florin Leon, Dan Galea, and Mihai Horia Zaharia, (2002). “Load Balancing in distributed systems using cognitive behavioral in distributed system using congnitive behavioral models”. Bulletin of Technical University of Lasi, Vol. XLVIII (LII), No.1-4, pp.119-124.
[30]. Xu, C. Z., and F. C. M. Lau, (1997). Load Balancing in Parallel Computers: Theory and Practice. Kluwer, Boston, MA.
[31]. Kristian Paul Bubendorfer, (1996). Resource based Policies for Load Distribution. (Master Thesis), Victoria University of Wellington.
[32]. Zhu, Y., (2003). A Survey on Grid Scheduling Systems. Technical Report, Department of Computer Science, Hong Kong University of Science and Technology.
[33]. Nieuwpoort, R. V., T. Kielmann, and H.E. Bal, (2001). “Efficient load balancing for wide-area divide-andconquer application”. In Proc. Eighth ACM SIGPLAN Symposium on Principales and Practice of Parallel Programming (PPoPP’01), Snowbird, UT, pp.34-43.
[34]. Ferrari, D., and S. Zhou, (1987). “An empirical investigation of load indices for load balancing application”. Proc of 12th International Symposium on Computer Performance Modeling Measurement and Evaluation, pp.515-528.
[35]. Casavant, T.L., and J. G. Kuhl, (1997). “A taxonomy of scheduling in general purpose distributed computing systems”. IEEE Trans. Software Engin., Vol.14, No.2, pp.141-153.
[36]. Rotithor, H. G., (1994). “Taxonomy of dynamic task scheduling schemes in distributed Computing Systems”. In IEEE Proc: on Computer and Digital Techniques, Vol.141, No.2, pp.1-10.
[37]. Sandeep Sharma, Sarabjit Singh, and Meenakshi Sharma, (2008). “Performance Analysis of Load Balancing Algorithms”. World Academy of Science, Engineering and Technology, Vol.38.
[38]. M. Backschat, A. Pfaffinger, and C. Zenger, (1996). “Economic Based Dynamic Load Distribution in Large Workstation Networks”. In Euro-Par'96, No.1124, pp.631- 634.
[39]. H. E. Bal, R. Bhoedjang, R. Hofman, C. Jacobs, K. Langendoen, T. Ruhl, and F. Kaashoek, (1998). “Performance Evaluation of the Orca Shared Object System”. ACM Transactions on Computer Systems, Vol.16, No.1, pp.1-40.
[40]. Rob V. van Nieuwpoort, Thilo Kielmann, and Henri E. Bal, (2001). “Efficient Load Balancing for Wide-Area Divideand- Conquer Applications”. PPoPP '01 Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, pp.33-43.
[41]. J. Baldeschwieler, R. Blumofe, and E. Brewer. (1996). “ATLAS: An Infrastructure for Global Computing”. In Seventh ACM SIGOPS European Workshop on System Support for Worldwide Applications, pp.165-172.
[42]. Schopf, J., (2001). “Ten actions when super scheduling, document of Scheduling Working Group”. In Global Grid Forum.
[43]. Su., A., F. Berman, R. Wolski, and M. Mills Strout, (1999). “Using apples to achedule simple SARA on the computational grid”. In International J. of High Performance Computing Applications, Vol.13, pp.253- 262.
[44]. R.D. Blumofe and C.E. Leiserson, (1994). “Scheduling th Multithreaded Computations by Work Stealing”. In 35 Annual Symposium on Foundations of Computer Science (FOCS '94), Santa Fe, New Mexico, pp.356-368
[45]. Casanova, H., M. Kim, J.S. Plank, and J.J. Dongarra, (1999). “Adaptive scheduling for task farming with grid middleware”. In International J. of High Performance Computing Application, Vol.13, No.3, pp.231-240.
[46]. N. G. Shivaratri, P. Krueger, and M. Ginghal, (1992). “Load Distributing for Locally Distributed Systems”. IEEE Computer, Vol.25, Vol.12, pp.33-44.
[47]. Wu, M., and X. Suna, (2003). “A general self-adaptive t a s k s c h e d u l i n g s y s t e m f o r n o n - d e d i c a t e d Heterogeneous computing”. In Proc. of IEEE International Conferences on Cluster Computing (CLUSTER’03), Hong Kong, pp.354-361.
[48]. Abraham, A., R. Buyya, and B. Nath, (2000). “Nature’s heuristic for scheduling jobs on computational grids”. In Proc. of 8th IEEE Intl. Conf. Adv. Comput. Communicat. (ADCOM 2000), Cochin, India, pp.45-52.
[49]. Riky Subrata Albert Y., and Zomaya Bjorn Landfeldt, (2006). “Artificial Life Techniques for Load Balancing in Computational Grids”. Journal of Computer and System Sciences, Vol.73, No.8, pp.1176-1190.
[50]. Nazir B, Qureshi K, and Manuel P, (2008). “Adaptive fault tolerant job scheduling strategy for economy based grid”. J. Super Comput., pp.116-134.
[51]. Hussain S, Qureshi K, and Rashid H, (2009). “Local predecimation with range index communication parallelization strategy for fractal image compression on a cluster of workstations”. Int. Arab. J. Inf. Technol., Vol.6, No.3, pp.293-296.
[52]. Javier Bustos Jimenez, (2003). “Robin Hood: An Active Objects Load Balancing Mechanism for Intranet”. Proc. of Workshop de Sistemas Distribuidos y Paralelismo, Chile.
[53]. Po-Cheng Chen, Cheng-I Lin, Sheng-Wei Huang, Jyh- Biau Chang, Ce-Kuen Shieh, and Tyng-Yeu Liang, (2008). “A Performance Study of Virtual Machine Migration vs. Thread Migration for Grid Systems”. 22nd International Conference on Advanced Information Networking and Applications - Workshops (Aina Workshops 2008), Okinawa, pp. 86-91.
[54]. Parag Kulkarni, and Indranil Sengupta, (2000). “Load Balancing With Multiple Token Policy”. Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568), Iwate, pp. 99-107.
[55]. P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos, (2008). “Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks”. Eighth IEEE International Symposium on Cluster Computing and the Grid, (CCGRID), Lyon, pp.722-727.
[56]. N. Rathore, (2016). “Dynamic Threshold Based Load B a l a n c i n g A l g o r i t h m s ” . W i r e l e s s P e r s o n a l Communication, Springer Publication-New-York (USA), ISSN print 0929-6212, ISSN online 1572-834X, Vol.91, No.1, pp.151-185.
[57]. N Rathore, and I Chana, (2016). “Job Migration Policies for Grid Environment ”. Wireless Personal Communication, Springer Publication-New-York (USA), ISSN print 0929-6212, Vol.89, No.1, pp.241-269, IF -0.979.
[58]. N Rathore, and I Chana, (2015). “Variable Threshold Based Hierarchical Load Balancing Technique in Grid”. Engineering with Computers, Springer Publication- London (England (UK), ISSN: 0177-0667 (print version) ISSN: 1435-5663 (electronic version), Vol.31, No.3, pp.597-615, IF- 1.451.
[59]. N. Rathore, and I Chana, (2014). “Load Balancing and Job Migration Techniques in Grid: A Survey of Recent Trends”. Wireless Personal Communication, Springer Publication-New-York (USA), ISSN print 0929-6212, ISSN online 1572-834X, Vol.79, No.3, pp.2089-2125, IF - 0.979.
[60]. N. Rathore, and I. Chana, (2014). “Job migration with fault tolerance based QoS scheduling using hash table functionality in Social Grid Computing”. Journal of Intelligent & Fuzzy Systems, IOS Press Publication- Netherland, Vol.27, No.6, pp.2821-2833, ISSN print 1064- 1246, IF- 0.936.
[61]. Neeraj Kumar Rathore, (2016). “Faults in Grid”. International Journal of Software and Computer Science Engineering, Mantech Publiations, Vol.1, No.1, pp.1-19.
[62]. Neeraj Kumar Rathore, (2016). “Installation of Alchemi.NET in Computational Grid”. i-manager’s Journal on Computer Science (JCOM), Vol.4, No.2, June-August , 2016 Print 2347-2227, E-ISSN 2347-6141, pp.1-5..
[63]. Neeraj Kumar Rathore, (2016). “Ethical Hacking & Security Against Cyber Crime”. i-manager’s Journal on Information Technology (JIT), Vol.5, No.1, Dec 2015-Feb 2016, Print ISSN 2277-5110, E-ISSN 2277-5250, pp.7-11.
[64]. Neeraj Kumar Rathore, (2015). “Efficient Agent Based Priority Scheduling and Load Balancing Using Fuzzy Logic in Grid Computing”. i-manager’s Journal on Computer Science (JCOM), Vol.3, No.3, Sep - Nov 2015 Print ISSN 2347–2227, E-ISSN 2347–6141, pp.11-22.
[65]. Neeraj Kumar Rathore, (2015). “Map Reduce Architecture for Grid”. i-manager’s Journal on Software Engineering (JSE), Vol.10, No.1, Jul-Sep 2015, Print ISSN 0973-5151, E-ISSN 2230-7168, pp.21-30.
[66]. Neeraj Kumar Rathore, (2015). “GridSim Installation and Implementation Process”. i-manager’s Journal on Cloud Computing (JCC), Vol.2, No.4, Aug-Oct 2015, Print ISSN 2349-6835, E-ISSN 2350-1308, pp. 23-34.
[67]. Vishal Sharma, Rajesh Kumar, and Neeraj Kumar Rathore, (2015). “Topological Broadcasting using Parameter Sensitivity based Logical Proximity Graphs in Coordinated Ground-Flying Ad Hoc Networks”. Journal of Wireless Mobile Networks Ubiquitous Computing and Dependable Applications (JoWUA), Vol.6, No.3, pp.54-72.
[68]. Neeraj Kumar Rathore and Inderveer Chana, (2013). “Report on Hierarchal Load Balancing Technique in Grid Environment”. i-manager's Journal on Information Technology, Vol.2, No.4, Sep-Nov 2013, Print ISSN 2277- 5110, E-ISSN 2277-5250, pp. 26-40.
[69]. Neeraj Kumar Rathore and Inderveer Chana, (2010). “Checkpointing Algorithm in Alchemi.NET”. Pragyaan: Journal of Information Technology, IMS Dehradun. ISSN No: 0974-5513, Vol.8, No.1, pp.32-38.
[70]. Neeraj Kumar Rathore and I Chana, (2011). “A Cogitative Analysis of Load Balancing Technique with Job Migration in Grid Environment”. World Congress on Information and Communication Technology (WICT), Mumbai, pp.77-82.
[71]. Neeraj Kumar Rathore and I Chana, (2013). “A Sender Initiate based Hierarchical Load Balancing Technique for Grid using Variable Threshold Value”. In International Conference IEEE-ISPC, pp.1-6.
[72]. Neeraj Kumar Rathore, (2015). “Efficient Load Balancing Algorithm in Grid”. In 30th M.P. Young Scientist Congress, Bhopal, M.P., pp.56.
[73]. Neeraj Kumar Rathore, (2014). “Efficient Hierarchical Load Balancing Technique based on Grid”. In 29th M.P. Young Scientist Congress, Bhopal, M.P., pp.55.
[74]. Rohini Chouhan and Neeraj Kumar Rathore, (2012). “Comparision of Load Balancing Technique in Grid”. 17th Annual Conference of Gwalior Acadmy of Mathematical Science and National Symposium on Computational Mathematics & Information Technology, JUET, Guna, M.P.
[75]. Neeraj Kumar Rathore, and Inderveer Chana, (2010). “Fault Tolerance Algorithm in Alchemi.NET Middleware”, National Conference on Education & Research (ConFR10), Third CSI National Conference of CSI Division V, Bhopal Chapter, IEEE Bombay, and MPCST Bhopal.
[76]. Neeraj Kumar Rathore, and Inderveer Chana, (2009). “Checkpointing Algorithm in Alchemi.NET”. Annual Conference of Vijnana Parishad of Iindia and National S ymp o s i um Re c e n t D e v e l o pme n t i n A p p l i e d Mathematics & Information Technology, JUET, Guna, M.P.
[77]. Neeraj Kumar Rathore, and Inderveer Chana, (2008). “Comparative Analysis of Checkpointing”. In IC Gupta and Deepak Jaroliya (Ed.), IT Enabled Practices and Emerging Management Paradigm, pp.321-327.
[78]. Neeraj Kumar Rathore, and Rohini Chohan, (2016). An Enhancement of Gridsim Architecture with Load Balancing. In Scholar's Press, ISBN: 978-3-639-76989-0.
[79]. Neeraj Kumar Rathore and Anuradha Sharma, (2015). Efficient Dynamic Distributed Load Balancing Tech-nique. In Lambert Academic Publication House, Germany, ISBN no-978-3-659-78288-6.
[80]. Neeraj Kumar Rathore and Inderveer Chana, (2010). Checkpointing Algorithm in Alchemi.NET. In Lambert Academic Publication House (LBA), Germany ISBN-10: 3843361371.
[81]. Neeraj Rathore and Inderveer Chana, (2006). Implementing Checkpointing Algorithm in Alchemi .NET. (M.E. Thesis). Thapar University, Patiala.
[82]. Neeraj Rathore and Inderveer Chana, (2014). An Efficient Dynamic and Decentralized Load Balancing Technique for Grid. (Ph.D. Thesis). Thapar University, Patiala.
Username / Email
Password
Don't have an account?  Sign Up
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.

Purchase Instant Access

PDF
10
USD

250
INR

HTML
10
USD

250
INR


We strive to bring you the best. Your feedback is of great value to us. Feel free to post your comments and suggestions.