원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm in order to achieve load balancing. Gap filling or backfilling is one of the techniques used to optimize First Come First Serve (FCFS) and have been used widely in scheduling area. This paper introduced an improved backfilling technique which not only applied to FCFS but to others Priority Rule algorithms. Experimental results have shown significant improvement compared to the original Priority Rule algorithms.
목차
Abstract
1. Introduction
2. Priority Rule Algorithms
2.1 First Come First Serve (FCFS)
2.2 Earliest Deadline First (EDF)
2.3 Shortest Job First (SJF)
2.4 Longest Job First (LJF)
2.5 Earliest Release Date (ERD)
2.6 Minimum Time to Due Date (MTTD)
3. Backfilling Strategies
4. Earliest Gap-Priority Rule (EG-PR) Algorithms
5. Biggest Hole-Priority Rule (BG-PR) Algorithms
6. Experimental Results
6.1 Earliest Gap with Priority Rules Algorithms
6.2 Performance Comparison of Priority Rule Algorithms With and Without EG Under Heavy Load
6.3 Comparison of Priority Rule Algorithms With EG and With BH
7. Conclusions
References
1. Introduction
2. Priority Rule Algorithms
2.1 First Come First Serve (FCFS)
2.2 Earliest Deadline First (EDF)
2.3 Shortest Job First (SJF)
2.4 Longest Job First (LJF)
2.5 Earliest Release Date (ERD)
2.6 Minimum Time to Due Date (MTTD)
3. Backfilling Strategies
4. Earliest Gap-Priority Rule (EG-PR) Algorithms
5. Biggest Hole-Priority Rule (BG-PR) Algorithms
6. Experimental Results
6.1 Earliest Gap with Priority Rules Algorithms
6.2 Performance Comparison of Priority Rule Algorithms With and Without EG Under Heavy Load
6.3 Comparison of Priority Rule Algorithms With EG and With BH
7. Conclusions
References
저자정보
참고문헌
자료제공 : 네이버학술정보