CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Approach for Dynamic Job Scheduling in a Volunteer Desktop Grid

by Shaik Naseera, K. V. Madhu Murthy
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 61 - Number 18
Year of Publication: 2013
Authors: Shaik Naseera, K. V. Madhu Murthy
10.5120/10026-4960

Shaik Naseera, K. V. Madhu Murthy . A New Approach for Dynamic Job Scheduling in a Volunteer Desktop Grid. International Journal of Computer Applications. 61, 18 ( January 2013), 6-11. DOI=10.5120/10026-4960

@article{ 10.5120/10026-4960,
author = { Shaik Naseera, K. V. Madhu Murthy },
title = { A New Approach for Dynamic Job Scheduling in a Volunteer Desktop Grid },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 61 },
number = { 18 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 6-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume61/number18/10026-4960/ },
doi = { 10.5120/10026-4960 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:09:45.562978+05:30
%A Shaik Naseera
%A K. V. Madhu Murthy
%T A New Approach for Dynamic Job Scheduling in a Volunteer Desktop Grid
%J International Journal of Computer Applications
%@ 0975-8887
%V 61
%N 18
%P 6-11
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Nodes in a volunteer desktop grid are based on the volunteer participation of desktop nodes owned by the individual users. The volunteer nodes contribute their idle resources for public execution during their free time and withdraw during their busy time due to high priority node owner's private execution. This property makes desktop grid dynamic in nature. Job scheduling is mainly influenced by two factors: node dynamism and heterogeneity. The job generation rate at each node is different from other nodes in the desktop Grid and hence the load at each node changes with time. This situation leads to increased computational demands at some nodes than from others and makes the grid often to get into unbalanced environment. Job migration to remote nodes involves job transmission latency. Since grid is a dynamic environment, when the job reaches to the remote node for execution the node might become busy and the selected target node may not complete the execution of the job at the expected speed. Therefore, the selection of a target node for job migration plays an important role in improving the overall performance of the desktop Grid. In this paper we present a new approach for dynamic job scheduling that considers node dynamism and job transmission latency into account for making scheduling decisions. The algorithm is compared against the Resource Exclusion and non migration algorithms and the simulation results shows that the proposed algorithm has got considerable improvement over the other two.

References
  1. SungJin Choi, Rajkumar Buyya, " Group-based adaptive result certification mechanism in Desktop Grids", Future Generation Computer Systems 26 (2010) 776_786, Science Direct.
  2. V. Lo, D. Zhou, D. Zappala, Y. Liu, and S. Zhao, "Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet," The 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04), LNCS 3279, pp. 227-236, Feb. 2004.
  3. Zhou and V. Lo, "Wave Scheduler: Scheduling for Faster Turnaround Time in Peer-to-peer Desktop Grid Systems," 11th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP'05), LNCS 3834, pp. 194-218, Jun. 2005.
  4. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, "Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems, The 8th Heterogeneous Computing Workshop (HCW'99), pp. 30-44, Apr. 1999.
  5. He, X. , X-He Sun and G. V. Laszewski, "QoS guided Min-min heuristic for grid task scheduling. Journal of computer science and Technology", Vol. 18, pp. 442-451, 2003.
  6. Estiminani, K. and M. Naghibzadeh. A Min-min and Max-min selective algorithm for Grid task scheduling. The third IEEE/IFIP International conference on Internet, 2007, Uzbekistan.
  7. SETI@home, http://setiathome. ssl. berkeley. edu
  8. Y. Zhu, L. Xiao, Z. Xu, L. M. Ni, "Incentive-based scheduling in Grid computing," Concurrency and Computation: Practice and Experience, vol. 18, issue 14, pp. 1729-1746, Dec. 2006.
  9. Distributed. net, http://distributed. net
  10. R. Buyya, D. Abramson, J. Giddy, and H. Stockinger, "Economic Models for Resource Management and Scheduling in Grid Computing," Special Issue on Grid Computing Environments, The Journal of Concurrency and Computation: Practice and Experience (CCPE), vol. 14, pp. 1507-1542, 2002.
  11. S. Shetty, P. Padala, and M. Frank, "A Survey of Market Based Approaches in Distributed Computing," Technical Report TR03-13, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Volunteer nodes desktop grid job scheduling job migration node dynamism average turnaround time

Powered by PhDFocusTM