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

Minimum CDT based Scheduling Algorithm versus FCFS in Grid Environment

Print
PDF
International Journal of Computer Applications
© 2013 by IJCA Journal
Volume 68 - Number 11
Year of Publication: 2013
Authors:
Deepti Malhotra
10.5120/11622-6505

Deepti Malhotra. Article: Minimum CDT based Scheduling Algorithm versus FCFS in Grid Environment. International Journal of Computer Applications 68(11):18-24, April 2013. Full text available. BibTeX

@article{key:article,
	author = {Deepti Malhotra},
	title = {Article: Minimum CDT based Scheduling Algorithm versus FCFS in Grid Environment},
	journal = {International Journal of Computer Applications},
	year = {2013},
	volume = {68},
	number = {11},
	pages = {18-24},
	month = {April},
	note = {Full text available}
}

Abstract

To achieve the promising potentials of tremendous distributed resources, effective and efficient scheduling algorithms are fundamentally important. Unfortunately, scheduling algorithms in traditional parallel and distributed systems, which usually run on homogeneous and dedicated resources, e. g. computer clusters, cannot work well in the new circumstances. In this research paper, MJ_CDTmin [1] (multiple jobs based on the minimum cumulative departure time) algorithm is compared with the already existing FCFS (First Come First Serve) algorithm in terms of the execution time (in secs). Since there were no results for minimizing the execution time in for existing algorithms. Hence the comparison is done only for the proposed algorithms. This is achieved with the experimental test bed by specifying deadline, while submitting the jobs. Simulation was carried out by different number of jobs varying from 1000 to 10,000. In the experimental testing heterogeneous machines were used and tested for different number of tasks/jobs. During the experiment, the comparison was carried out by considering the six different values for the Service time (? ST?_k) of the jobs. The main aim of proposed scheduling algorithm is to increase the system efficiency and to satisfy the job requirements from the available resources. The experimental results showed a significant improvement in terms of a smaller makespan time as compared to the already existing FCFS scheduling algorithm.

References

  • Deepti Malhotra, Devanand and Anik Gupta. 2012. Simulation of MJ_CDTmin Based Scheduling Algorithm in Grid Environment,International Journal of Computer Applications (0975 – 8887) Vol 42– No. 11,pp. 24-29 March 2012.
  • I. Foster and C. Kesselman (editors). 1999. The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, USA.
  • Rajkummar Buyya. 2002. Economic-based Distributed Resource Management and Scheduling for grid computing. PhD thesis, Monash university, Melborn, Australia.
  • K. Al-Saqabi, S. Sarwar, and K. Saleh. 1997. Distributed gang scheduling in networks of heterogeneous workstations, Computer Communications Journal, pp. 338-348.
  • Maheswaran M, Ali S, Siegel H J, et al. 1999. Dynamic mapping of a class of independent tasks on to heterogeneous computing systems. In the 8th IEEE Heterogeneous Computing Workshop (HCW '99),San Juan, Puerto Rico,(Apr. 1999), pp. 30-44.
  • XiaoShan He, XianHe Sun, and Gregor von Laszewski. 2003. QoS Guided Min-Min Heuristic for Grid Task Scheduling, Computer Science and Technology, 18(4):442-451.
  • X. He, X-He Sun, and G. V. Laszewski. 2003. QoS Guided Min-min Heuristic for Grid Task Scheduling, Journal of Computer Science and Technology, Vol. 18, pp. 442-451.
  • M. Maheswaran, Sh. Ali, H. Jay Siegel, D. Hensgen, and R. F. Freund. 1999. Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems, Journal of Parallel and Distributed Computing, Vol. 59, pp. 107-13.
  • T. D. Braun, H. Jay Siegel, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, and B. Yao. 2001. A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems,Journal of Parallel and Distributed Computing, Vol. 61, pp. 810-837.
  • F. Dong, J. Luo, L. Gao, and L. Ge. 2006. A Grid Task Scheduling Algorithm Based on QoS Priority Grouping," In the Proceedings of the Fifth International Conference on Grid and Cooperative Computing (GCC'06), IEEE.
  • E. Ullah Munir, J. Li, and Sh. Shi. 2007. QoS Sufferage Heuristic for Independent Task Scheduling in Grid. Information Technology Journal, 6 (8): 1166-1170.
  • K. Etminani, and M. Naghibzadeh. 2007. A Min-min Max-min Selective Algorithm for Grid Task Scheduling,The Third IEEE/IFIP International Conference on Internet, Uzbekistan.
  • Deepti Malhotra. 2013. SCH_ACR and SCH_LD Based Job Scheduling Algorithm in Grid Environment, International Journal of Computer Applications (0975 – 8887) Vol 64– No. 13, pp. 35-41 February 2013
  • B. T. Benjamin Khoo, B. Veeravalli, T. Hung, and C. W. Simon See. 2007. A multi-dimensional scheduling scheme in a Grid computing environment," Journal of Parallel and Distributed Computing, Vol. 67, pp. 659-673.
  • B. Yagoubi, and Y. Slimani. 2007. Task Load Balancing Strategy for Grid Computing, Journal of Computer Science, Vol. 3, No. 3, pp. 186-194.
  • Huyn zhang, chanle wu, Q. xiong, and L. Wu,G. Ye. 2006. Research on an Effective Mechanism of Task Scheduling in Grid Environment. In IEEE, Fifth International Conference on Grid and Cooperative Computing (GCC'06).
  • E. Elmroth, and J. Tordsson. 2008. Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions, Journal of Future Generation Computer Systems, Vol. 24, pp. 585-593.
  • F. Dong, J. Luo, L. Gao, and L. Ge. 2006. A Grid Task Scheduling Algorithm Based on QoS Priority Grouping, In the Proceedings of the Fifth International Conference on Grid and Cooperative Computing (GCC'06), IEEE.
  • B. Yagoubi, and Y. Slimani. 2007. Task Load Balancing Strategy for Grid Computing, Journal of Computer Science, Vol. 3, No. 3, pp. 186-194.