Call for Paper - September 2020 Edition
IJCA solicits original research papers for the September 2020 Edition. Last date of manuscript submission is August 20, 2020. Read More

Scheduling Tasks in Heterogeneous System using Load Balancing Algorithm

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Pratiksha Patil, Roshani Ade
10.5120/ijca2017914538

Pratiksha Patil and Roshani Ade. Scheduling Tasks in Heterogeneous System using Load Balancing Algorithm. International Journal of Computer Applications 168(9):49-54, June 2017. BibTeX

@article{10.5120/ijca2017914538,
	author = {Pratiksha Patil and Roshani Ade},
	title = {Scheduling Tasks in Heterogeneous System using Load Balancing Algorithm},
	journal = {International Journal of Computer Applications},
	issue_date = {June 2017},
	volume = {168},
	number = {9},
	month = {Jun},
	year = {2017},
	issn = {0975-8887},
	pages = {49-54},
	numpages = {6},
	url = {http://www.ijcaonline.org/archives/volume168/number9/27906-2017914538},
	doi = {10.5120/ijca2017914538},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Innovative idea of distributing the tasks to their best processor to reduce the execution time of task by using various scheduling techniques is given in this paper. This paper presents hybrid scheduling techniques which provide better solution of scheduling task that means combination of different scheduling provides better performance without degrading the result quality. Scheduling algorithms such as MinMin+, MaxMin+ and Sufferage+ are suitable for overcomes the drawback of previously used scheduling methods such as MinMin, MaxMin and Sufferage as well as scheduling in this paper provides better complexity as compare to previous scheduling methods. This scheduling are also suitable for heterogeneous environment more effectively to execute different set of task on different processors with different configurations. To get better the show of the existing system we have to improve existing algorithm with the load balancing.So same load should overloaded to all processors.The future algorithm have implement with detailed pseudocodes.

References

  1. E. Kartal Tabak, B. Barla Cambazoglu, and Cevdet Aykanat, “Improving the Performance of Independent Task Assignment Heuristics MinMin, MaxMin and Sufferage”,IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 25, NO. 5, MAY 2014.
  2. T. D. Braun,H. J. Siegel,N. Beck, L. L. Boloni, “A comparison of eleven static scheduling for mapping a class of independent tasks onto heterogeneous distributed computing systems”, J. Parallel Distrib. Comput., vol. 61, no. 6, pp. 810837, 2001.
  3. Kamali Gupta, Manpreet Singh, “Scheduling Based Task Scheduling In Grid”, International Journal of Engineering and Technology (IJET), vol. 4, pp. 254260,Aug-Sep 2012.
  4. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R.F. Freund, “Dynamic mapping of a class of independent tasks onto heterogeneous computing systems”, J. Parallel Distrib.Comput., vol. 59, pp.107131, 1999.
  5. H. J. Siegel and S. Ali, “Techniques for mapping tasks to machines in heterogeneous computing systems”, J. Syst. Archit., vol. 46, no. 8, pp. 627639, 2000.
  6. T. Kokilavani, Dr. D.I. George Amalarethinam, “Load Balanced Min-Min Algorithm for Static Meta-Task Scheduling in Grid Computing”, International Journal of Computer Applications, vol. 20, April 2011.
  7. George Amalarethinam. D.I, VaaheedhaKfatheen .S, “Max-min Average Algorithm for Scheduling Tasks in Grid Computing Systems”, International Journal of Computer Science and Information Technologies, Vol. 3, pp.3659-3663, 2012.
  8. Balasangameshwara J. ,Raju N, “Performance-Driven Load Balancing with a Primary-Backup Approach for Computational Grids with Low Communication Cost and Replication Cost”, IEEE Transactions on Computers,Volume:62, Issue: 5.
  9. Shah R, Veeravalli B. ,Misra, M, “On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments”, IEEE Transactions on Parallel and Distributed Systems,Volume:18,Issue: 12.
  10. He. X, X-He Sun, and Laszewski. G.V, “QoS Guided Minmin Scheduling for Grid Task Scheduling”, Journal of Computer Science and Technology, Vol. 18, pp. 442-451,2003.
  11. T. D. Braun,H. J. Siegel,N. Beck, L. L. Boloni, “A comparison of eleven static scheduling for mapping a class of independent tasks 810837, 2001.
  12. Sameer Singh Chauhan,R. Joshi. C, “QoS Guided Scheduling Algorithms for Grid Task Scheduling”, International Journal of Computer Applications (09758887), pp 24-31, Volume 2, No.9, June 2010.
  13. Singh. M and Suri. P.K, “QPS A QoS Based Predictive Max-Min, Min-Min, Switcher Algorithm for Job Scheduling in a Grid”, Information Technology Journal, Vol. 7, pp. 1176-1181, 2008.
  14. Yagoubi. B, and Slimani. Y, “Task Load Balancing Strategy for Grid Computing”, Journal of Computer Science, Vol. 3, No. 3, pp. 186-194, 2007.

Keywords

Task Scheduling, MinMin, MaxMin, Sufferage, Standard Deviation, Load Balancing.