Performance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems

§ Guru Nanak Dev University, Amritsar, INDIA. Guru Nanak Dev University, Amritsar, INDIA.

Send Message

To: Author

Performance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems

Article Fingerprint

ReserarchID

CST8CTK5

Performance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Cluster computing systems have recently generated enormous interest for providing easily scalable and cost-effective parallel computing solution for processing large-scale applications. Various adaptive space-sharing scheduling algorithms have been proposed to improve the performance of dedicated and homogeneous clusters. But commodity clusters are naturally nondedicated 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 homogeneous and heterogeneous parallel systems are not suitable for such conditions. Most of the existing adaptive policies assume a priori knowledge of certain job characteristics to take scheduling decisions. However such information is not readily available without incurring great cost. This paper fills these gaps by designing robust and effective space-sharing scheduling algorithm for non-dedicated heterogeneous cluster systems, assuming no job characteristics to reduce mean job response time. Evaluation results show that the proposed algorithm provide substantial improvement over existing algorithms at moderate to high system utilizations.

References

15 Cites in Article
  1. 1. Jemal Abawajy (2003). Parallel job scheduling policies on cluster computing systems. Parallel job scheduling policies on cluster computing systems
  2. 2. S Dandamudi,Z Zhou (2004). Performance of Adaptive Space-Sharing Policies in Dedicated Heterogeneous Cluster Systems. Future Generation Computer Systems, 20(5), 895-906.
  3. 3. D Feitelson,L Rudolph,U Schwiegelshohn,K Sevcik,P Wong (1997). Theory and practice in parallel job scheduling.
  4. 4. D Feitelson,L Rudolph (2005). Parallel Job Scheduling -A Status Report.
  5. 5. E Rosti,E Smirni,L Dowdy,G Serazzi,B Carlson (1994). Robust partitioning policies of multiprocessor systems. Performance Evaluation, 19(2-3), 141-165.
  6. 6. E Rosti,E Smirni,L Dowdy,G Serrazi,K Sevcik (1998). Processor saving scheduling policies for in figure 2. These two policies suffer from processor Year multiprocessor systems. IEEE Transactions on Computers, 47(2)
  7. 7. Sivarama Dandamudi,Hai Yu (1999). Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers. Journal of Parallel and Distributed Computing, 58(1), 109-125.
  8. 8. W Cirne,F Berman (2000). Adaptive Selection of Partition Size for Supercomputer Requests.
  9. 9. Walfredo Cirne,Francine Berman (2002). Using Moldability to Improve the Performance of Supercomputer Jobs. Journal of Parallel and Distributed Computing, 62(10), 1571-1601.
  10. 10. W Cirne,F Berman (2005). A comprehensive model of the supercomputer workload. Proceedings of the Fourth Annual IEEE International Workshop on Workload Characterization. WWC-4 (Cat. No.01EX538), 140-148.
  11. 11. S Srinivasan,V Subramani,R Kettimuthu,P Holenarsipur,P Sadayappan (2002). Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs.
  12. 12. Srinivasan,Krishnamoorthy,Sadayappan (2003). A robust scheduling technology for moldable scheduling of parallel jobs. Proceedings IEEE International Conference on Cluster Computing CLUSTR-03, 92-99.
  13. 13. Young-Chul Shim (2004). Performance evaluation of scheduling schemes for NOW with heterogeneous computing power. Future Generation Computer Systems, 20(2), 229-236.
  14. 14. V Doan (2008). An Adaptive Space-Sharing Scheduling Algorithm for PC-Based Clusters. Modeling, Simulation and Optimization of Complex Processes, 225-234.
  15. 15. J Abawajy (2009). An efficient adaptive scheduling policy for high-performance computing. Future Generation Computer Systems, 25(3), 364-370.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. Amit Chhabra, Gurvinder Singh. 2012. "Performance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems". Global Journal of Computer Science and Technology - B: Cloud & Distributed GJCST-B Volume 12 (GJCST Volume 12 Issue B12).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-B Classification C.1.4
Version of record

v1.2

Issue date
December 28, 2012

Language
English
Order Article Reprint
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 4.2K
Total Downloads: 320
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Performance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems

Dr. Chhabra
Dr. Chhabra Guru Nanak Dev University, Amritsar, INDIA.
Gurvinder Singh
Gurvinder Singh