Performance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems

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

Send Message

To: Author

GJCST Volume 12 Issue B12

Article Fingerprint

ReserarchID

CSTB8CTK5

Performance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems Banner
  • 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

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.

15 Cites in Articles

References

  1. Jemal Abawajy (2003). Parallel job scheduling policies on cluster computing systems.
  2. S Dandamudi,Z Zhou (2004). Performance of Adaptive Space-Sharing Policies in Dedicated Heterogeneous Cluster Systems.
  3. D Feitelson,L Rudolph,U Schwiegelshohn,K Sevcik,P Wong (1997). Theory and practice in parallel job scheduling.
  4. D Feitelson,L Rudolph (2005). Parallel Job Scheduling -A Status Report.
  5. E Rosti,E Smirni,L Dowdy,G Serazzi,B Carlson (1994). Robust partitioning policies of multiprocessor systems.
  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.
  7. Sivarama Dandamudi,Hai Yu (1999). Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers.
  8. W Cirne,F Berman (2000). Adaptive Selection of Partition Size for Supercomputer Requests.
  9. Walfredo Cirne,Francine Berman (2002). Using Moldability to Improve the Performance of Supercomputer Jobs.
  10. W Cirne,F Berman (2005). A comprehensive model of the supercomputer workload.
  11. S Srinivasan,V Subramani,R Kettimuthu,P Holenarsipur,P Sadayappan (2002). Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs.
  12. Srinivasan,Krishnamoorthy,Sadayappan (2003). A robust scheduling technology for moldable scheduling of parallel jobs.
  13. Young-Chul Shim (2004). Performance evaluation of scheduling schemes for NOW with heterogeneous computing power.
  14. V Doan (2008). An Adaptive Space-Sharing Scheduling Algorithm for PC-Based Clusters.
  15. J Abawajy (2009). An efficient adaptive scheduling policy for high-performance computing.

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.

Dr. Amit Chhabra. 2012. \u201cPerformance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems\u201d. 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

Classification
Not Found
Version of record

v1.2

Issue date

December 28, 2012

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 10251
Total Downloads: 2580
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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. Amit Chhabra
Dr. Amit Chhabra Guru Nanak Dev University, Amritsar, INDIA.
Gurvinder Singh
Gurvinder Singh

Research Journals