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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Efficient Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems

by Amit Chhabra, Gurvinder Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 57 - Number 23
Year of Publication: 2012
Authors: Amit Chhabra, Gurvinder Singh
10.5120/9439-3882

Amit Chhabra, Gurvinder Singh . An Efficient Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems. International Journal of Computer Applications. 57, 23 ( November 2012), 20-25. DOI=10.5120/9439-3882

@article{ 10.5120/9439-3882,
author = { Amit Chhabra, Gurvinder Singh },
title = { An Efficient Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 23 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 20-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number23/9439-3882/ },
doi = { 10.5120/9439-3882 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:01:17.094103+05:30
%A Amit Chhabra
%A Gurvinder Singh
%T An Efficient Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 23
%P 20-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The existing adaptive space-sharing scheduling algorithms mainly focus on dedicated homogeneous cluster computing systems. However community-owned clusters are naturally non-dedicated and tend to be heterogeneous over the time as cluster hardware is usually upgraded and new fast machines are also added to improve cluster performance. The existing adaptive policies for dedicated cluster systems are not suitable for such conditions. This paper extends an existing non-work-conserving adaptive space-sharing policy for dedicated heterogeneous systems to non-dedicated heterogeneous cluster systems. Evaluation results show that the proposed algorithm provide substantial improvement over existing algorithms at moderate to high system utilizations.

References
  1. J. H. Abawajy. Parallel Job Scheduling Policies on Cluster Computing Systems. Ph. D. Thesis. Ottawa-Carleton Institute for Computer Science, Carleton University, Ottawa, Canada, November, 2003.
  2. S. P. Dandamudi and Z. Zhou, "Performance of Adaptive Space-Sharing Policies in Dedicated Heterogeneous Cluster Systems", Future Generation Computer Systems, 20(5), 895-906 (2004).
  3. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, P. Wong, Theory and practice in parallel job scheduling, in: Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 1291, Springer-Verlag, Berlin, 1997, pp. 1–34.
  4. D. G. Feitelson and L. Rudolph. Parallel Job Scheduling - A Status Report. Lecture Notes in Computer Science, Springer, Vol. 3277 (2005).
  5. E. Rosti, E. Smirni, L. W. Dowdy, G. Serazzi, and B. M. Carlson. Robust Partitioning Policies for Multiprocessor Systems. Performance Evaluation, Vol. 19, 141-265 (1994).
  6. E. Rosti, E. Smirni, L. W. Dowdy, G. Serrazi, K. C. Sevcik, Processor saving scheduling policies for multiprocessor systems, IEEE Transactions on Computers 47 (2) (1998).
  7. S. P. Dandamudi and H. Yu, "Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers", Journal of Parallel and Distributed Computing, vol. 58, pp. 109-125 (1999).
  8. W. Cirne and F. Berman. Adaptive Selection of Partition Size for Supercomputer Requests. Lecture Notes in Computer Science, Springer, Vol. 1911, 187-208 (2000).
  9. W. Cirne and F. Berman. Using Moldability to Improve the Performance of Supercomputer Jobs. Journal of Parallel and Distributed Computing, Vol. 62, 1571-1601 (2002).
  10. W. Cirne and F. Berman. A Comprehensive Model of the Supercomputer Workload. Proc. of IEEE 4th Annual Workshop on Job Scheduling Strategies for Parallel Processing (2005).
  11. S. Srinivasan, V. Subramani, R. Kettimuthu, P. Holenarsipur, and P. Sadayappan. Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs. Lecture Notes In Computer Science, Springer, Vol. 2552, 174- 183 (2002).
  12. S. Srinivasan, S. Krishnamoorthy, and P. Sadayappan. A Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs. Proc. of 2003 IEEE International Conference On Cluster Computing (2003) pp. 92-99.
  13. Young-Chul Shim, "Performance evaluation of scheduling schemes for NOW with heterogeneous computing power", Future Generation Computer Systems. 20(2): 229-236 (2004).
  14. V. H. Doan. An Adaptive Space-Sharing Scheduling Algorithm for PC-Based Clusters, Modeling, Simulation and Optimization of Complex Processes, pp 225-234, 2008.
  15. J. H. Abawajy, "An Efficient Adaptive Policy for High-Performance Computing", Future Generation Computer Systems, Vol. 25, 364-370, (2009).
  16. K. Aida. (2000), "Effect of job size characteristics on job scheduling performance", In Job Scheduling Strategies for Parallel Processing, Springer Verlag, Lecture Notes in Computer Science, vol. 1911, pp. 1-17.
Index Terms

Computer Science
Information Sciences

Keywords

Adaptive space-sharing scheduling Cluster computing systems Non-dedicated heterogeneous clusters Mean response time System Utilization

Powered by PhDFocusTM