CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 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

A Novel Task Scheduling Algorithm for Heterogeneous Computing

by Vinay Kumar, C. P. Katti, P. C. Saxena
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 85 - Number 18
Year of Publication: 2014
Authors: Vinay Kumar, C. P. Katti, P. C. Saxena
10.5120/14944-3452

Vinay Kumar, C. P. Katti, P. C. Saxena . A Novel Task Scheduling Algorithm for Heterogeneous Computing. International Journal of Computer Applications. 85, 18 ( January 2014), 35-39. DOI=10.5120/14944-3452

@article{ 10.5120/14944-3452,
author = { Vinay Kumar, C. P. Katti, P. C. Saxena },
title = { A Novel Task Scheduling Algorithm for Heterogeneous Computing },
journal = { International Journal of Computer Applications },
issue_date = { January 2014 },
volume = { 85 },
number = { 18 },
month = { January },
year = { 2014 },
issn = { 0975-8887 },
pages = { 35-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume85/number18/14944-3452/ },
doi = { 10.5120/14944-3452 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:03:01.860742+05:30
%A Vinay Kumar
%A C. P. Katti
%A P. C. Saxena
%T A Novel Task Scheduling Algorithm for Heterogeneous Computing
%J International Journal of Computer Applications
%@ 0975-8887
%V 85
%N 18
%P 35-39
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The grid computing system can support the execution of computationally intensive parallel and distributive applications. The main characteristics of grid computing and heterogeneous computing system are similar. A novel scheduling algorithm, called NHEFT is proposed in this paper to enhance the functions of heterogeneous Earliest-Finish time (HEFT) algorithm. The NHEFT algorithm works for a bounded number of heterogeneous processors, the main objective of NHEFT is getting high performance and fast scheduling. The algorithm selects the tasks with a rank system at each step of execution of algorithm, which minimize earliest finish time with the minimization of cost.

References
  1. Foster I and Kesselman C (editors), 1999, The Grid: Blueprint for a Future Computing Infrastructure, Morgan Kaufmann Publishers, USA.
  2. Braun R, Siegel H, Beck N, Boloni L, Maheswaran M, Reuther A, Robertson J, Theys M, Yao B, Hensgen D and Freund R, 2001, A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems, International Journal of Parallel and Distributed Computing, Vol. 61(6): 810-837.
  3. Maheswaran M, Ali S, Siegel H. J, Hensgen D. and Freund R. F,1999, Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems, International Journal of Parallel and Distributed Computing,Vol. 59(2):107-131.
  4. Casanova H, Legrand A, Zagorodnov D and Berman F,(2000), Heuristics for Scheduling Parameter Sweep Applications in Grid Environments, In. Proc. Of the 9th heterogeneous Computing Workshop: 349-363, Cancun,Mexico.
  5. Stone H S,1977, Multiprocessor Scheduling with the aid of network flow algorithms, IEEE Trans. Software Eng. 3: 85-93.
  6. Stone H S, Bukhara S H,1978, Control of distributed Processes, Computer: 97-106.
  7. M. M. Eshaghian, ed. , 1996, Heterogeneous Computing, Artech House, Norwood, MA.
  8. A. Khokhar, V. K. Prasanna, M. Shaaban, and C. L Wang, 1993, Heterogeneous computing: Challenges and opportunities, IEEE Computer, Vol. 26, No. 6, pp. 18-27.
  9. H. J. Siegel, J. K. Antonio, R. C. Metzger, M. Tan, and Y. A. Li, 1996, Heterogeneous computing, in Parallel and Distributed Computing Handbook, A. Y. Zomaya, ed. , McGraw-Hill, New York, NY, pp. 725-761.
  10. H. J. Siegel, H. G. Dietz, and J. K. Antonio, 1997, Software support for heterogeneous computing, in The Computer Science and Engineering Handbook, A. B. Tucker, Jr. , ed. , CRC Press, Boca Raton, FL, pp. 1886-1909.
  11. G. C. Sih and E. A. Lee, 1994, A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures, IEEE Trans. Parallel and Distributed System vol. 5, no. 2, pp. 113-120.
  12. H. El-Rewini and T. G. Lewis, 1999, Scheduling Parallel Program Tasks onto Arbitrary Target Machines, Journal of Parallel and Distributed Computing, vol. 9, pp. 138-153.
  13. M. Iverson, F. Ozguner, and G. Follen, 1995, Parallelizing Existing Applications in a Distributed Hetrogeneous Environment", Proc. Hetrogeneous Computing Workshop, pp 93-100.
  14. Topcuoglu, H. Hariri, S. Min-You Wu, 2002, Performance effective and low complexity task scheduling for heterogeneous computing" IEEE Trans. Parallel and Distributed System vol. 13, no. 3, pp. 260-274.
Index Terms

Computer Science
Information Sciences

Keywords

Task Scheduling Problem NP Problems Dynamic Scheduling.

Powered by PhDFocusTM