We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
Reseach Article

BGPS: A Scheduling Algorithm for Batch Pipeline Resources using GA

by Arash Ghorbannia Delavar, Ayden Halakouie
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 57 - Number 15
Year of Publication: 2012
Authors: Arash Ghorbannia Delavar, Ayden Halakouie
10.5120/9192-3617

Arash Ghorbannia Delavar, Ayden Halakouie . BGPS: A Scheduling Algorithm for Batch Pipeline Resources using GA. International Journal of Computer Applications. 57, 15 ( November 2012), 25-31. DOI=10.5120/9192-3617

@article{ 10.5120/9192-3617,
author = { Arash Ghorbannia Delavar, Ayden Halakouie },
title = { BGPS: A Scheduling Algorithm for Batch Pipeline Resources using GA },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 15 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 25-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number15/9192-3617/ },
doi = { 10.5120/9192-3617 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:00:34.090034+05:30
%A Arash Ghorbannia Delavar
%A Ayden Halakouie
%T BGPS: A Scheduling Algorithm for Batch Pipeline Resources using GA
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 15
%P 25-31
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we will present a scheduling algorithm for batch pipeline resources using GA. BGPS algorithms for resource allocation with variable processing power to the jobs is offered. In previous algorithms, a source could select and run one job at a time. New techniques can batch jobs and perform them in parallel. so after the first job is completed, second job is started simultaneously. The BGPS algorithm can reduce wasting time of sweeping jobs. And we can have the optimal use of existing resources. The new algorithm, in comparison to a similar algorithm with a bunch of jobs, can run them in a pipline. It will be able to request and confirmation of job after the end of previous job, and also allocate resources to perform jobs in parallel. The system is capable to accelerate of processing tasks with different parameters in function and increase system efficiency.

References
  1. An ant algorithm for balanced job scheduling in grids Ruay-Shiung Chang_, Jih-Sheng Chang, Po-Sheng Lin Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng Hualien, 974 Taiwan, ROC
  2. New Self-Scheduling Schemes for Internet-Based Grids of Computers Javier Díaz, Sebastián Reyes, Alfonso Niño, and Camelia Muñoz-Caro
  3. A general model for the generation and scheduling of parameter sweep experiments in Computational Grid Environments- International Conference on Computational Science, ICCS 2010- Javier Díaza,?, Sebastián Reyesa, Rosa M. Badiab, Alfonso Niñoa, Camelia Muñoz-Caroa
  4. I. Foster and C. Kesselman(editors), The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, USA, 1999.
  5. DSQGG: An optimized genetic-based algorithm for scheduling in distributed grid Delavar, A. G. ; Rahmany, M. ; Halaakouie, A. ; Sookhtsaraei, R. ; Payam Noor Univ. , Tehran, Iran 29 November 2010
  6. An improved rank-based genetic algorithm with limited iterations for grid scheduling Abdulal, W. CSE Dept. , Osmania Univ. , Hyderabad, India Al Jadaan, O. ; Jabas, A. ; Ramachandram, S. Industrial Electronics & Applications, 2009. ISIEA 2009. IEEE Symposium on
  7. On the Design of Fault-Tolerant Scheduling Strategies Using Primary-Backup Approach for Computational Grids with Low Replication Costs Qin Zheng Inst. of High Performance Comput. , Agency for Sci. , Singapore Veeravalli, B. ; Chen-Khong Tham March 2009
  8. A genetic algorithm for task scheduling in network computing environment Dongmei Liu State Key Lab. of Software Eng. , Wuhan Univ. , China Yuanxiang Li ; Mingzhao Yu 23-25 Oct. 2002
  9. GABased Job Scheduling Strategies for FaultTolerant Grid Systems Chao-Chin Wu; Kuan-Chou Lai; Ren-Yi Sun Asia-Pacific Services Computing Conference, 2008. APSCC '08. IEEE
  10. Arash Ghorbannia Delavar, Ali Reza Khalili Boroujeni and Javad Bayrampoor. Article: A Balanced Scheduling Algorithm with Fault Tolerant and Task Migration based on Primary Static Mapping (PSM) in Grid. International Journal of Computer Applications52(8):10-21, August 2012. Published by Foundation of Computer Science, New York, USA.
Index Terms

Computer Science
Information Sciences

Keywords

Grid Computing Genetic Algorithm Distributed System Scheduling Batching pipelining