Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Distributing Graphic Rendering using Grid Computing with Load Balancing

International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 47 - Number 9
Year of Publication: 2012
El-sayed M. T. El-kenawy
Ali Ibraheem El-desoky
Mohamed F. Al-rahamawy

El-sayed M T El-kenawy, Ali Ibraheem El-desoky and Mohamed F Al-rahamawy. Article: Distributing Graphic Rendering using Grid Computing with Load Balancing. International Journal of Computer Applications 47(9):1-6, June 2012. Full text available. BibTeX

	author = {El-sayed M. T. El-kenawy and Ali Ibraheem El-desoky and Mohamed F. Al-rahamawy},
	title = {Article: Distributing Graphic Rendering using Grid Computing with Load Balancing},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {47},
	number = {9},
	pages = {1-6},
	month = {June},
	note = {Full text available}


Graphic rendering is expensive in terms of computation. We investigate distributing it by applying the powerful computing technique called grid computing, and showing how this technology has a great effectiveness and high performance. The paper shows how to develop a java drawing framework for drawing in the distributed environment by dividing the work upon nodes in grid computing and selecting the best nodes for job assignments to have the jobs executed in the least amount of time. Schedulers are limited in individual capability, but when deployed in large numbers can represent a strong force similar to a colony of ants or swarm of bees. The paper also presents a mechanism for load balancing based on swarm intelligence such as Ant colony optimization and Particle swarm Optimization.


  • R. Butler, D. Engert, I. Foster, C. Kesselman, S. Tuecke, J. Volmer, V. Welch, 2000, A National-Scale Authentication Infrastructure, IEEE Computer
  • B. M. Chapman, B. Sundaram, K. Thyagaraja, EZGrid system: A Resource broker for Grids, http://www. cs. uh. edu/~ezgrid
  • K. Czajkowski, S. Fitzgerald, I. Foster, C. Kesselman, 2001, Grid Information Services for Distributed Resource Sharing.
  • K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith, S. Tuecke, 1998, A Resource Management Architecture for Metacomputing Systems, Proc. IPPS/SPDP '98 Workshop on Job Scheduling Strategies for Parallel Processing
  • I. Foster and C. Kesselman, 1997, Globus: A metacomputing infrastructure toolkit," International Journal of Supercomputer Applications, Summer
  • I. Foster and C. Kesselman, 1999, The GRID: Blueprint for a new Computing Infrastructure, Morgan Kauffman Publishers.
  • Browne, J. C. ; 2004, Grid computing as applied distributed computation: a graduate seminar on Internet and Grid computing, Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium .
  • Darema, F. ; 2005, Grid computing and beyond: the context of dynamic data driven applications systems, Proceedings of the IEEE, Volume 93, Issue 3, pp 692 - 697
  • Wang, L. ; Kunze, M. ; 2006, On the Design of Virtual Environment Based Workflow System for Grid Computing, Grid and Cooperative Computing Workshops, 2006. GCCW '06. Fifth International Conference, pp 212 - 218
  • Ali, A. ; McClatchey, R. ; Anjum, A. ; Habib, I. ; Soomro, K. ; Asif, M. ; Adil, A. ; Mohsin, A. ; 2006, From Grid Middleware to a Grid Operating System, Grid and Cooperative Computing, 2006. GCC 2006. Fifth International Conference, pp. 9 - 16
  • Frank Klawonn, 2008 , Introduction to Computer Graphics: Using Java 2D and 3D (Undergraduate Topics in Computer Science), Springer Publishing Company
  • Levoy M. , 2002, The digital michelangelo project: 3d scanning of large statues, Dept. Computer Science, University of Standford.
  • Hogg D. , 1999, The resolv project, Dept. Computer Studies, University of Leeds. , eu-project.
  • Fisher R. B. 2001, Div. Informatics, University of Edinburgh. The camera project (cad modelling of built environments from range analysis), eu tmr-project. .
  • U. Castellani, S. Livatino, and R. B. Fisher. , 2002, Improving environment modelling by edge occlusion surface completion. In 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT), Padova, Italy.
  • U. Castellani and S. Livatino. , 2001, Scene reconstruction: Occlusion understanding and recovery. In Robert B. Fisher, editor, CVonline: The Evolving, Distributed, Non-Proprietary, On-Line Compendium of Computer Vision. School of Informatics, University of Edinburgh.
  • F. Stulp. , 2001, Completion of Occluded Surfaces. , PhD thesis, Rijksun Universiteit, Groningen, Holland.
  • J. Davis, S. M. Marschner, M. Garr, and M. Levoy. , 2002, Filling holes in complex surfaces using volumetric diffusion. In 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT), Padova, Italy.
  • T. Kanade, P. Narayanan, and P. Rander. , 1995, Virtualized reality: Concepts and early results. In IEEE Workshop on Representation of Visual Scenes, pp 69-76.
  • H. Fuchs, G. Bishop, K. Arthur, L. McMillan, R. Bajcsy, S. Lee, H. Farid, and T. Kanade. , 1994, Virtual space teleconferencing using a sea of cameras. In First International Symposium on Medical Robotics and Computer Assisted Surgery, pages 161-167.
  • B. Tseng and D. Anastassiou, 1994. Compatible video coding of stereoscopic sequences using mpeg-2's scalability and interlaced structure. In International Workshop on HDTV'94, Torino, Italy.
  • Singhal M. , Shivaratri N. , 1994, Advanced Concepts In Operating Systems, McGraw Hill
  • Tanenbaum, A. , 1995, Distributed Operating Systems, Prentice Hall
  • Yang X. S. , 2008, Nature-Inspired Metaheuristic Algorithms. Frome: Luniver Press
  • Karaboga, Dervis, 2010, Artificial bee colony algorithm Scholarpedia, , volume 5. Pages 6915
  • Driving Lessons from Leafcutter Ants at http://www. autoevolution. com/news/driving-lessons-from-leafcutter-ants-3950. html
  • Spirograph http://www. wordsmith. org/~anu/java/spirograph. html
  • http://www. theserverside. com/news/thread. tss?thread_id=48681
  • Vladimir G. Ivancevic,Tijana T. Ivancevic?, 2007, Computational mind: a complex dynamics perspective, page 251
  • Parsopoulos, K. E. ; Vrahatis, M. N. , 2002, Recent Approaches to Global Optimization Problems Through Particle Swarm Optimization. Natural Computing, volume 1, pages 235–306.
  • A. Colorni, M. Dorigo, V. Maniezzo, M. Trubian, 1994, Ant system for job-shop scheduling, Belgian Journal of Operations Research, volume 34, pp. 39–53.
  • P. R. McMullen, 2001, An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives, Artificial Intelligence, in Engineering, vol. 15, pp. 309–317.
  • V. T'kindt, N. Monmarche, F. Tercinet, D. Laugt, 2002, An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem, European Journal of Operational Research, volume 142 , pp 250–257.
  • M. Gravel, W. L. Price, C. Gagne, 2002, Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic, European Journal of Operational Research, volume 143, pp 218–229.
  • K. -C. Ying, C. -J. Liao, 2004, An ant colony system for permutation flow-shop sequencing, Computers and Operations Research, volume 31, pp 791–801.
  • T. Stützle, 1998, An ant approach to the flow shop problem, in: Proceedings of the 6th European Congress on Intelligent Techniques & Soft Computing, EUFIT'98, Aachen, Germany, pp. 1560–1564.
  • S. J. Shyu, B. M. T. Lin, P. Y. Lin, 2004, Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time, Computers and Industrial Engineering, volume 47, pp 181–193.
  • C. Blum, 2005, Beam-AC: Hybridizing ant colony optimization with beam search: An application to open shop scheduling, Computers and Operations Research, volume 32, pp 1565–1591.