i-manager Publications

Efficient Greedy Algorithm for Multi-Processor Scheduling

Ruwanthini Siyambalapitiya*, M. Sandirigama**

* Department of Statistics and Computer Science, University of Peradeniya, Sri Lanka.

** Department of Computer Engineering, University of Peradeniya, Sri Lanka.

Periodicity:April - June'2010
DOI : https://doi.org/10.26634/jse.4.4.1178

Abstract

In this study, we propose some simple greedy algorithms for the multi-processor job scheduling problem. Given list of jobs are arranged according to the time duration for processing. The results of the proposed algorithms are compared with the first-come first-serve (FCFS) job scheduling approach and shown to be superior.

Keywords

Multi-Processor, Greedy, Scheduling, Greedy.

How to Cite this Article?

Ruwanthini Siyambalapitiya and M. Sandirigama (2010). Efficient Greedy Algorithm for Multi-Processor Scheduling. i-manager’s Journal on Software Engineering, 4(4),50-54. https://doi.org/10.26634/jse.4.4.1178

References

[1]. Feitelson, D.G. (1994). “A Survey of Scheduling in Multiprogrammed Parallel Systems”, Research Report RC 19790 (87657), IBM T.J. Watson Research Centre, October.

[2]. Feitelson, D.G., Rudolph, L., and Schwiegelshohn, U. (2004). “Parallel Job Scheduling- a Status Report”, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, Vol. 3834, pp.1-16.

[3]. Jonathan Weinberg, (2006). “Job scheduling on Parallel Systems”, Ph.D. Research Examination, University of California, San Diego.

[4]. Lenstra, J.K., and Rinnooy Kan, A.H.G. (1988). “An Introduction to Multiprocessor Scheduling”, Technical report, CWI, Amsterdam.

[5]. Schwiegelshohn, U., and Yahyapour, R. (1998). “Analysis of First-Come-First-Serve parallel Job Scheduling”, Proceedings of the 9 SIAM Symposium on Discrete Algorithms, pp.629-638, July.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.