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

Comparative Study of Task Duplication based Scheduling Algorithms for Parallel Systems

by Nidhi Arora
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 19
Year of Publication: 2012
Authors: Nidhi Arora
10.5120/9394-3835

Nidhi Arora . Comparative Study of Task Duplication based Scheduling Algorithms for Parallel Systems. International Journal of Computer Applications. 58, 19 ( November 2012), 46-48. DOI=10.5120/9394-3835

@article{ 10.5120/9394-3835,
author = { Nidhi Arora },
title = { Comparative Study of Task Duplication based Scheduling Algorithms for Parallel Systems },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 19 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 46-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number19/9394-3835/ },
doi = { 10.5120/9394-3835 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:02:59.011139+05:30
%A Nidhi Arora
%T Comparative Study of Task Duplication based Scheduling Algorithms for Parallel Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 19
%P 46-48
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Scheduling of tasks is done by mapping tasks on multiple processors so that it requires least time for completion of all processes. Multiprocessors are used to run real time applications that uniprocessor systems would not be competent to execute. This paper presents various scheduling algorithms that schedule an edge-weighted Directed Acyclic Graph (DAG) to a number of processors. In this paper, task duplication based scheduling algorithms like PY algorithm and DSH algorithm are analyzed and studied for various performance metrices. Also, the effect of varying number of processors is examined on these algorithms.

References
  1. Hwang, K. and Briggs, F. A. 1984 Computer architecture and Parallel Processing, McGrawHill.
  2. Ahmad, I. and Kwok, Yu-K. 1995 Performance Comparison of Algorithm for Static Scheduling of DAGs to multiprocessor, Proceedings of the Second Australian Conference on Parallel and Real-Time Systems, Perth, Australia, 185-192.
  3. Ahmad, I. and Wu, M. Y. 1996 Analysis, Evaluation and Comparison of algorithm for Scheduling Task Graph on Parallel Processor, IEEE Conference Publications, 1087-4087.
  4. Wu, M. Y. 1997 On parallelization of Static Scheduling Algorithm, IEEE, vol 23, pp. 517 – 528.
  5. Ahmad, I. and Kwok, Yu-K. 1998 Benchmarking and Comparison of the Task Graph Scheduling Algorithms, IEEE Conference Publications, pp. 1063-7133.
  6. Ahmad, I. and Kwok, Yu-K. 1999 On Parallelizing the Multiprocessor Scheduling Problem, IEEE Transactions on parallel and distributed systems, vol 10(4) 414-431.
  7. Kwok, Y. K and Ahmad, I. 1999 Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors, ACM Computing Surveys, vol. 31(4) 406-471.
  8. Hagras, T. and Janeek, J. 2003 Static Vs. Dynamic List-scheduling Performance Comparison Acta Polytechnica vol. 43(6)
  9. Chen et al. 2006 Study on Parallel Computing, Journal of Computer science and technology, vol 21(5)
  10. Shyiyuan Jin, S, Schiavone, S. and Turgut, D. 2008 A performance study of multiprocessor task scheduling algorithm, Journal of Supercomputing, vol 43(1) 77-97.
  11. Padmavathi, S. and Shalinie, S. M. 2010 Scalable low complexity task scheduling algorithm for cluster of workstations, Journal of Engineering Science and Technology, vol 5(3) 332 – 341.
  12. Arora, N. et al 2012, Performance Comparison of BNP Scheduling Algorithms in homogeneous environment, Global Journal of Computer Science and Technology, vol 12(8) 47-55.
  13. Arora, N. 2012, Analysis and performance comparison of algorithms for scheduling directed task graphs to parallel processors, International journal of emerging trends in Engineering and development, vol 4 (2) 793-802.
  14. Samriti et al. 2012 Analysis of HLFET and MCP Task Scheduling Algorithms, International Journal of Modern Engineering Research, vol 2(3) 1176-1180.
Index Terms

Computer Science
Information Sciences

Keywords

Task Scheduling DAG Parallel Processing Multiprocessor Scheduling Performance Evaluation Scalability

Powered by PhDFocusTM