Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Resource Cost Optimization for Dynamic Load Balancing on Web Server System


Affiliations
1 Department of Computer Science and Engineering, Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India
2 Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India
     

   Subscribe/Renew Journal


The growth of technology increases user expectations at a fast pace in terms of performance and efficiency of web servers. Such user's expectations are required the number of efficient and dynamic computational resources and mechanism. Several scheduling policies have been already working on multiple web servers, but still web servers get overloaded while the access of resources has been increased. Now-adays, to increase the number of resources gets costly for the organizations so there is a need for an efficient scheduling policy which can optimize the cost of the resources as per the user’s expectation. In this paper, an efficient dynamic load balancing policy based on the activity of the processes has been proposed for reducing the cost of Grid resources and simulated on the Grid-Sim simulator to compare with existing scheduling policies. Therefore, costs of resources have been optimized through the proposed dynamic load balancing policies on web servers.

Keywords

Dynamic Load Balancing, Web Server, Grid, Grid-Sim, Scheduling Policy, Resource Costs, Condor Scheduler.
Subscription Login to verify subscription
User
Notifications
Font Size


  • Buyya, R. & Venugopal, S. (2005). A gentle introduction to grid computing and technologies. CSI Communications, 29(1), 1-19.
  • Buyya, R. & Murshed, M. (2002). GridSim: A toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing. Concurrency and Computation: Practice and Experience, 14(3-15), 1175-1220.
  • Buyya, R., Murshed, M. & Abramson, D. (2001). A Deadline and Budget Constrained Cost-Time Optimization Algorithm for Scheduling Task Farming Applications on Global Grids. Proceeding of International Conference on Parallel and Distributed Processing Techniques and Applications (pp. 1-12).
  • Cakanyildirim, M. (2014). Waiting Times. Retrieved from the University of Dallas. Retrieved from http://www.utdallas.edu/∼metin/Or6302/Folios/omqueue.pdf
  • Caol, J., Spooner, D. P., Jarvis, S. A. & Nudd, G. R. (2005). Grid load balancing using intelligent agents. Future Generation Computer Systems, 21(1), 135-149.
  • Chervenak, A., Foster, I., Kesselman, C., Salisbury, C. & Tuecke, S. (2000). The data grid: Towards an architecture for the distributed management and analysis of large scientific datasets. Journal of Network and Computer Applications: Special Issue on Network-Based Storage Services, 23(3), 187-200.
  • Chung, C. A. (2004). Simulation Modeling Handbook: A Practical Approach. CRC Press LLC, University of Houston: Washington, D.C.
  • Czajkowski, K., Foster, I. & Kesselman, C. (1999). Resource Co-Allocation in Computational Grids. Proceeding of 8th IEEE International Symposium on High Performance Distributed Computing (pp. 219-228).
  • Ferreira, L., Berstis, V., Armstrong, J., Kendzierski, M., Neukoetter, A., Takagi, M., Bing-Wo, R., Amir, A., Murakawa, R., Hernandez, O., Magowan, J. & Bieberstein, N. (2003). Introduction to Grid Computing with Globus. Redbook, IBM Corporation.
  • Foster, I., Kesselman, C. & Tuecke, S. (2001). The anatomy of the grid enabling scalable virtual organizations. International Journal of High Performance Computing Applications, 15(3), 200-222.
  • Foster, I. (2002). What is the Grid? A Three Point Checklist. Argonne National Laboratory & University of Chicago. Retrieved from http://dlib.cs.odu.edu/WhatIsTheGrid.pdf.
  • Genaud, S., Giersch, A. & Vivien, F. (2003). Loadbalancing scatter operations for grid computing. Parallel Computing, 30(8), 179-186.
  • Gu, D., Yang, L. & Welch, L. R. (2005). A Predictive, Decentralized Load Balancing Approach. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium.
  • Heiss, H. U. & Schmitz, M. (1995). Decentralized dynamic load balancing: The particles approach. Journal of Information Sciences-Informatics and Computer Science, 84(1-2), 115-128.
  • Kamarunisha, M., Ranichandra, S. & Rajagopal, T. K. P. (2011). Recitation of load balancing algorithms in grid computing environment using policies and strategies-An Approach. International Journal of Scientific & Engineering Research, 2(3), 1-7.
  • Kenthapadi, K. & Manku, G. S. (2005). Decentralized Algorithms using both Local and Random Probes for P2P Load Balancing. Proceeding of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, (pp. 135-144)
  • Krauter, K., Buyya, R. & Maheswaran, M. (2002). A taxonomy and survey of grid resource management systems for distributed computing. Software: Practice and Experience, 32(2), 135-164.
  • Laszewaski, G. V., Foster, I., Gwaor, J., Lane, P., Rehn, N. & Russell, M. (2001). Designing Grid Based Problem Solving Environments and Portals. Proceeding in 34th Annual Hawaiian International Conference on System Science (pp. 3-6)
  • Luther, A., Buyya, R., Ranjan, R. & Venugopal, S. (2006). Peer-to-Peer Grid Computing and A .NET-Based Alchemi Framework. Proceeding in High-Performance Computing: Paradigm and Infrastructure (eds. L. T. Yang & M. Guo), John Wiley & Sons, Inc., Hoboken, NJ, USA. (pp. 1-21).
  • Nieuwpoort, R. V. van, Kielmann, T., & Bal, H., E. (2001). Efficient Load Balancing for Wide Area Divide and Conquer Applications. Proceeding of the 8th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, 36(7), 34-43, 18th-20th June, Snowbird, Utah, USA.
  • Schopf, J. M. & Nitzberg, B. (2002). Grids: The top ten questions. Journal of Scientific Programming, 10(2), 103-111.
  • Shoshani, A., Sim, A. & Gu, J. (2002). Storage Resource Managers: Middleware Components for Grid Storage. Proceeding in the 19th IEEE Symposium on Mass Storage Systems, Maryland. (pp. 209-224). Retrieved from http://storageconference.org/2002/presentations/d02-arie.pdf.
  • Yagoubi, B. & Slimani, Y. (2006). Dynamic Load Balancing Strategy for Grid Computing. Proceeding of World Academy of Science, Engineering & Technology, (13, pp. 90-95).
  • Yagoubi, B. & Slimani, Y. (2007). Task load balancing strategy for grid computing. Journal of Computer Science, 3(3), 186-194.

Abstract Views: 396

PDF Views: 5




  • Resource Cost Optimization for Dynamic Load Balancing on Web Server System

Abstract Views: 396  |  PDF Views: 5

Authors

Harikesh Singh
Department of Computer Science and Engineering, Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India
Shishir Kumar
Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India

Abstract


The growth of technology increases user expectations at a fast pace in terms of performance and efficiency of web servers. Such user's expectations are required the number of efficient and dynamic computational resources and mechanism. Several scheduling policies have been already working on multiple web servers, but still web servers get overloaded while the access of resources has been increased. Now-adays, to increase the number of resources gets costly for the organizations so there is a need for an efficient scheduling policy which can optimize the cost of the resources as per the user’s expectation. In this paper, an efficient dynamic load balancing policy based on the activity of the processes has been proposed for reducing the cost of Grid resources and simulated on the Grid-Sim simulator to compare with existing scheduling policies. Therefore, costs of resources have been optimized through the proposed dynamic load balancing policies on web servers.

Keywords


Dynamic Load Balancing, Web Server, Grid, Grid-Sim, Scheduling Policy, Resource Costs, Condor Scheduler.

References