Random Articles
Reseach Article
A New Fuzzy-based Job Scheduling Algorithm for Cluster Computing
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 77 - Number 1 |
| Year of Publication: 2013 |
| Authors: Behzad Azizpour, Mehdi Effatparvar, Mohammad Sadeq Garshasbi |
10.5120/13360-0953
|
Behzad Azizpour, Mehdi Effatparvar, Mohammad Sadeq Garshasbi . A New Fuzzy-based Job Scheduling Algorithm for Cluster Computing. International Journal of Computer Applications. 77, 1 ( September 2013), 33-36. DOI=10.5120/13360-0953
Abstract
Scheduling is the process of improving the performance of a parallel and distributed system. Cluster systems are part of distributed systems. Cluster systems refers to the concept of run parallel jobs that can be run simultaneously on several processors. In this paper, introduce a method based on fuzzy logic for scheduling Parallel jobs on cluster systems. The main objective is to achieve performance and power improvement. The results of the simulations indicate our introduced method is better than comparison with the algorithm FCFS and SJF.
References
- A. Neela madheswari, R. S. D. Wahida banu, Static and Dynamic Job Scheduling with Communication aware policy in Cluster computing, Elsevier, Computers and Electrical Engineering 39 (2013) 690–696.
- Ananth Grama, Georage Karypis, Anshul Gupta, Vipin Kumar, "Introduction to parallel computing", Published by Pearson Education, 2009.
- Tran, Van Hoai, "Task Scheduling for Parallel Systems ", Faculty of Computer Science and Engineering HCMC University of Technology, 2009-2010.
- Jasbir, Gurvinder, "Improved Task Scheduling on Parallel System using Genetic Algorithm", International Journal of Computer Applications (0975 – 8887) Volume 39– No. 17, February 2012.
- Frachtenberg E, Schwiegelshohn U. New challenges of parallel job scheduling. In: Proceedings of the 13th IEEE international conference on Job scheduling strategies for parallel processing, 2007.
- Franke H, Pattnaik P, Rudolph L. Gang scheduling for highly efficient distributed multiprocessor systems. In: Sixth Symposium on the Frontiers of massively parallel computation, 1996.
- Zhou B. B. Job Relocation: A Method to Enhance the Performance of Gang Scheduling on Clusters of PCs. In: Proceedings of the 4th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2003, p. 582-586.
- Ryu K. D, Pachapurkar M, Fong L. L. Adaptive memory paging for efficient gang scheduling of parallel applications. In: Proceedings of the 18th IEEE International Parallel and Distributed Processing Symposium, 2004.
- Barbosa da silva F. A, Scherson I. D. Improving Throughput and Utilization in Parallel Machines through Concurrent Gang. In: Proceedings of the 14th IEEE International Symposium on Parallel and Distributed Processing, 2000.
- Jette M. A. Performance characteristics of Gang scheduling in multiprogrammed environments. In: Proceedings of the ACM/IEEE Conference on Super Computing, 1997.
- Song F, Static and dynamic scheduling for effective use of multicore systems. Thesis Report, University of Tennesse, Knoxville, Dec 2009.
- Gonzalez-Dominguez J, Taboada G. L, Fraguela B. B, Martin M. J, Tourino J. Automatic mapping of parallel applications on multicore architectures using the Servet benchmark suite, In: Computers and Electrical Engineering, 2012, 38, p. 258-269.
Index Terms
Keywords