메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
Shobhit Gupta (Amity University Jaipur) Ranjit Rajak (Dr.Harisingh Gour Central University) Girish Kumar Singh (Dr.Harisingh Gour Central University) Sanjay Jain (Amity University Jaipur)
저널정보
한국산학기술학회 SmartCR Smart Computing Review 제5권 제3호
발행연도
2015.6
수록면
126 - 134 (9page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
Task scheduling in parallel computing is represented by a directed acyclic graph, and it is called multiprocessor task scheduling. The primary objective of task scheduling algorithm is to minimize the total execution time i.e. scheduling length. There are various types of task scheduling algorithms: Bound Number of Processor Scheduling, and Arbitrary Processor Network Scheduling Algorithms. Bound Number of Processor Scheduling algorithms are used for limited number of processors; since it does not use task duplication, link contention, and routing strategy for communication. But Arbitrary Processor Network scheduling algorithms are considered for link contention routing strategy in communication. It uses arbitrary network topology. In this paper, we have studied different Arbitrary Processor Network scheduling algorithms: Mapping Heuristic, Dynamic Level Scheduling, Bottom Up, and Bubble Scheduling and Allocation. The primary objective of this survey paper is to explain various Arbitrary Processor Network scheduling algorithms and their functionality, priority attributes, and time complexity. The performance metrics can also be used for comparison of different Arbitrary Processor Network scheduling algorithms.

목차

Abstract
Introduction
DIRECTED ACYCLIC GRAPH MODEL
CLASSIFICATION OF ARIBITRARY PROCESSOR NETWORK SCHEDULING ALGORITHMS
Performance Matrices
Conclusion
References

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0