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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Performance Analysis of List Scheduling on Homogeneous Multiprocessors System

by Sunita Kushwaha, Sanjay Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 152 - Number 7
Year of Publication: 2016
Authors: Sunita Kushwaha, Sanjay Kumar
10.5120/ijca2016911897

Sunita Kushwaha, Sanjay Kumar . Performance Analysis of List Scheduling on Homogeneous Multiprocessors System. International Journal of Computer Applications. 152, 7 ( Oct 2016), 29-32. DOI=10.5120/ijca2016911897

@article{ 10.5120/ijca2016911897,
author = { Sunita Kushwaha, Sanjay Kumar },
title = { Performance Analysis of List Scheduling on Homogeneous Multiprocessors System },
journal = { International Journal of Computer Applications },
issue_date = { Oct 2016 },
volume = { 152 },
number = { 7 },
month = { Oct },
year = { 2016 },
issn = { 0975-8887 },
pages = { 29-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume152/number7/26334-2016911897/ },
doi = { 10.5120/ijca2016911897 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:57:34.873328+05:30
%A Sunita Kushwaha
%A Sanjay Kumar
%T Performance Analysis of List Scheduling on Homogeneous Multiprocessors System
%J International Journal of Computer Applications
%@ 0975-8887
%V 152
%N 7
%P 29-32
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Nowadays multiprocessor system has received a lot of attention because of its efficiency and reliability, which play an important role in success of multiprocessor systems. Hence, there is a necessity for developing efficient scheduling algorithms. Therefore, various researches have been done in different areas of scheduling of multiprocessor system. This paper evaluates the performance of homogeneous multiprocessor system on the basis of Throughput.

References
  1. Albert Y. Zomaya, Chris Ward, (1999). ”Genetic scheduling for parallel processor systems: comparative studies and performance issues”, IEEE Transaction on Parallel and Distributed System, vol. 10,pp 795-812.
  2. T. Hagias and J. Janacek, (2003). “Static vs. Dynamic List-Scheduling Performance Comparison”, ActaPolytechnica, Vol.3 No. 6/2003, pp 16-21.
  3. Chapin, Steven J. and Weismann Jon B, (2002). “Distributed and Multiprocessor Scheduling”, Electrical Engineering and Computer Science, Head book, Paper 40.
  4. Thomas casavant, Jong.kuhl, (1988). “A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems”,IEEE Trans. onSoftware Engineering, vol. 14, no. 2,pp 141-154.
  5. Sunita Kushwaha, Sanjay Kumar, (2014). “Analysis of List Scheduling Algorithms for Parallel System”, IEEE International conference on High Performance Computing and Applications (ICHPCA), 22-24 dec., Bhubaneswar, India.
  6. H. Topcuoglu, S. Hariri, and M.Y. Wu, (2002). “Performance-Effective and Low- Complexity Task Scheduling for Heterogeneous Computing”, IEEE Trans. Parallel and Distributed Systems, Vol. 13, No. 3, pp. 260-274.
  7. Y.K. Kwok and I. Ahmad, (1999). “Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors”, ACM Computing Surveys, Vol. 31, No. 4, pp. 406-471.
  8. Richard Linn and Wei Zhang (1999), “HYBRID FLOW SHOP SCHEDULING: A SURVEY’, Computers & Industrial Engineering 37, pp 57-61.
  9. S. Guirchoun, P. Martineau, J.-C. Billaut (2005), “Total completion time minimization in a computer system with a server and two parallel processors”, Computers & Operations Research 32, Elsevier, pp 599–611.
  10. Eric Angel, Evripidis Bampis, Fanny Pascual (2009), “Truthful algorithms for scheduling selfish tasks on parallel machines”, Theoretical Computer Science, Elsevier (press article), pp 1-12.
  11. Hamid Aranejad and Jorqe G. Barbosa (2014), “List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table”, IEEE tran. On Parallel and Distributed systems, Issue No.03, vol.25, pp: 682-694.
  12. Nidhi Rajak and Anurag Dixit and Ranjit Rajak (2014)” Classification of List Task Scheduling Algorithms: A Short Review Paper”, Journal of Industrial and Intelligent Information Vol. 2, No. 4, December, pp320-323.
  13. Total completion time minimization in a computer system with a server and two parallel processors S. Guirchoun, P. Martineau, J.-C. Billaut, elsevier Computers & Operations Research 32 (2005) 599–611 .
Index Terms

Computer Science
Information Sciences

Keywords

Throughput List Scheduling Static Scheduling

Powered by PhDFocusTM