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

추천
검색
질문

논문 기본 정보

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

이용수

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

초록· 키워드

오류제보하기
The major objective of any task-scheduling algorithm in parallel computing is to minimize the overall scheduling length. In this research paper, we present a task-scheduling algorithm in parallel computing called the Critical Path and b-level Based Task Scheduling algorithm. This algorithm is based on a new attribute, which is called the CPB attribute, which is based on two well-known priority attributes: Critical Path and B-Level. This algorithm uses entry tasks as duplicates in all of the available processors. The major objective of any task-scheduling algorithm is to minimize the overall scheduling length. Here, an application program in task scheduling is represented by a directed acyclic graph. We consider all processors to be homogenous in nature and fully connected. The Critical Path and b-level Based Task Scheduling algorithm gives a minimum scheduling length when compared to heuristic task-scheduling algorithms like the HLFET, MCP, DLS, and ETF. We have also done an analysis of the proposed algorithm and heuristic algorithms based on other priority attributes: Speedup, Efficiency, Scheduling Length Ratio, Load Balancing, and Cost.

목차

Abstract
Introduction
Task Scheduling Problem
Proposed Algorithm
Performance Analysis
Conclusion
References

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

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

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2016-505-001836030