The multiprocessor computing is composed of more than one central processing units (CPU) that simultaneously execute the task of a parallel application for obtain quick results, to process a massive amount of data, and to solve a problem in expected time. If Scheduling is done properly in task allocation then they are increase the performance of the system. Task scheduling in a parallel environment is one of the NP-problems, which deals with the optimal assignment of a task. In this paper, various algorithms are surveyed that apportion a parallel program impersonate by an edge-weighted Directed Acyclic Graph (DAG). These include Bounded no. of Processors (BNP), Unbounded no. of Clusters (UNC), Task Duplication Based scheduling (TDB) and Arbitrary Processor Network scheduling algorithm (APN). The objective of this paper is to study and explore several DAG based task scheduling algorithm and the performance of all of the algorithms is evaluated and compared against each other on a unified basis by using various scheduling parameters.
목차
Abstract 1. Introduction 1.1. Bounded Number of Processors (BNP) Scheduling Algorithms 1.2. Unbounded Number of Clusters (UNC) Scheduling Algorithms 1.3. Task Duplication Based (TDB) Scheduling Algorithms 1.4. Arbitrary Processor Network (APN) Scheduling Algorithms 2. The Direct Acyclic Graph (DAG) Model 2.1. Classification of DAG Scheduling Algorithm 3. Performance Metrics 4. Conclusions References
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.9 No.9