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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Job Scheduling Model with Job Sequencing and Prioritizing Strategy in Grid Computing

by A. R. Jayasudha, T. Purusothaman
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 46 - Number 24
Year of Publication: 2012
Authors: A. R. Jayasudha, T. Purusothaman
10.5120/7128-9649

A. R. Jayasudha, T. Purusothaman . Job Scheduling Model with Job Sequencing and Prioritizing Strategy in Grid Computing. International Journal of Computer Applications. 46, 24 ( May 2012), 29-32. DOI=10.5120/7128-9649

@article{ 10.5120/7128-9649,
author = { A. R. Jayasudha, T. Purusothaman },
title = { Job Scheduling Model with Job Sequencing and Prioritizing Strategy in Grid Computing },
journal = { International Journal of Computer Applications },
issue_date = { May 2012 },
volume = { 46 },
number = { 24 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 29-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume46/number24/7128-9649/ },
doi = { 10.5120/7128-9649 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:40:31.397116+05:30
%A A. R. Jayasudha
%A T. Purusothaman
%T Job Scheduling Model with Job Sequencing and Prioritizing Strategy in Grid Computing
%J International Journal of Computer Applications
%@ 0975-8887
%V 46
%N 24
%P 29-32
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In a heterogeneous distributed systems that involves parallel processing it is very significant to include its computational capability and its dynamism as a major consideration. In such a distributed and a dynamic environment, the application and usage of available resources vary in a higher magnitude. In order to perform maximum exploitation of all available resources for parallel processing, efficient and intellectual scheduling is the need of the hour. Current grid environment regards clusters as separate domains. As resources are highly heterogeneous, dynamic and are separated largely by geographical distances, efficient job scheduling is a challenge. In this paper, we have discussed about a scheduling model that performs job sequencing based on shortest processing time and earliest due date. The simulation results show a considerable improvement in the resource utilization, throughput and reduction in waiting time as compared to others.

References
  1. I. Foster, C. Kesselman, & S. Tuecke. The anatomy of the grid: enabling scalable virtual organizations, International Journal of High Performance Computing Applications,15(3), 2001, 200-222.
  2. The Anatomy of the Grid www. globus. org/alliance/publications/papers/anatomy. pdf
  3. . The 10th IEEE International Conference on High Performance Computing and Communications "A Novel Algorithm for Task Scheduling in Grid Computing Based on Game Theory" Lei Yao, Guanzhong Dai, Huixiang Zhang, Shuai Ren, Yun Niu College of Automatic, Northwestern Polytechnical University, Xi'an, China
  4. Rajkumar Buyya and Srikumar Venugopal - A Gentle Introduction to Grid Computing and Technologies -database, 2005 - gridbus. cs. mu. oz. au
  5. Seventh International Conference on Networking, "A price-based Task Scheduling for Grid Computing" Marcelo Massocco Cendron, Carlos Becker Westphall, Network and Management Laboratory, Federal University of Santa Catarina,Florianopolis, SC, Brazil
  6. K. Y. Wang, D. C. Marinescu and O. F. Carbynar, "Dynamic scheduling of process groups", Concurrency: Practice and Experience, 10(4):265-283, April 1998.
  7. "Ant Algorithm-Based Task Scheduling In Grid Computing", Zhihong XU Xiangdan HOU Jizhou SUN, Department of Computer Science, Tianjin University.
  8. S. Vadhiyar, J. Dongarra, "A Metascheduler for the Grid", 11th IEEE international Symposium on High Performance Distributed Computing HPDC-2002.
  9. B. Zhou, R. Brent, D. Walsh and K. Suzaki, "Job scheduling strategies for networks of workstations", In Job Scheduling Strategies for networks of workstations", vol. 1459 of LNCS, pp. 143-157, Berlin, 1998. Springer.
  10. Fukuda Munehiro, Tanaka Yuichiro, Suzuki naoyha, Bic Lubomir F. , Kobayashi Shinya, "A Mobile-Agent-Based PC Grid", In the 5th International Workshop on Active MiddlewareServices.
  11. Smith Warren, foster Ian, Taylor Valerie, "Scheduling with Advanced Reservations". In Proceedings of the 14th IEEE International Parallel and Distributed Processing Symposium2000.
  12. Streit Achim, "Evaluation of Scheduling-Algorithms for Metacomputing". Diploma thesis at CEI University of Dortmund, Germany (1999).
  13. Fernandez-Baca David. , "Allocating Modules to processors in a distributed System" In IEEE Transactions on Software Engineering, 15(11):1427-1436 (November 1989).
  14. "A Secure Resource and Job Scheduling Model with Job Grouping strategy in Grid Computing", Raksh Sharma, Vishnu Kant Soni, Manoj Lumar Mishra, Sarita Das School of Computer Engineering, Computer Science and Engineering KIIT, University, Est Phulnakhara, Orissa.
Index Terms

Computer Science
Information Sciences

Keywords

Resource Scheduling Job Sequencing Priority

Powered by PhDFocusTM