현재 위치
Home
An Efficient Task Priority Measurement for List-Scheduling in Multiprocessor Environments
-
- 발행기관
- 보안공학연구지원센터(IJSEIA) 바로가기
-
- 간행물
- International Journal of Software Engineering and Its Applications SCOPUS 바로가기
-
- 통권
- Vol.9 No.5 (2015.05)바로가기
-
- 페이지
- pp.233-246
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A249692
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- Optimized task scheduling is one the most important factors to achieve high-performance in multiprocessor environments such as parallel and distributed systems. A large number of proposed approaches to solve this problem use list-scheduling technique in which a list of tasks is created based on the some priority measurements, and then in each step, the most priority task in the list is selected to schedule on the processor that allows the earliest start time. Therefore, the achieved schedule length is highly coherent with how order the tasks are selected to execute. Whereas selected task priority measurement determines which task order would be extracted, in this paper, we survey five traditional task priority measurements named height-level (HL), top-level (TL), bottom-level (BL), static-level (SL) and as- late-as-possible (ALAP) which have been extensively used in the different list-scheduling approaches. In addition, a new efficient task priority measurement based on the number-of-offspring (NOO) of tasks in task-graph is introduced and evaluated beside the others. The evaluation is made by doing various experiments on random task-graphs with different shape parameters and task-graphs of real-world programs using measures such as normalized schedule length (NSL), pair-wise and global comparison and best solution. Based on the results, it can generally be seen that the proposed NOO is the best, HL, BL, SL and ALAP are temperate (their ranks are slightly changed based on the selected comparison measure), and TL has the worst performance.
목차
Abstract
1. Introduction
2. Multiprocessor Task Scheduling
3. List-Scheduling Technique
4. Task Priority Measurements
4.1. Height-Level (HL)
4.2. Top-Level (TL)
4.3. Bottom-Level (BL)
4.4. Static-Level (SL)
4.5. As-Late-As-Possible (ALAP)
5. The Proposed Priority Measurement
6. Implementation and Experimental Details
7. Results and Comparisons
8. Conclusion
References
키워드
Parallel and distributed systems list-scheduling multiprocessor task-graph scheduling task priority measurements저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Software Engineering and Its Applications
- 간기
- 월간
- pISSN
- 1738-9984
- 수록기간
- 2008~2016
- 등재여부
- SCOPUS
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.9 No.5
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.