지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2015.4
- 수록면
- 113 - 125 (13page)
이용수
초록· 키워드
오류제보하기
Task scheduling in the multiprocessor environment is considered to be a NP-complete problem. It is also called a multiprocessor scheduling. Here, a parallel program is divided into a number of subtasks and it is mapped on the processors for concurrent execution. The objective of task scheduling is to reduce scheduling length of a given application program. Considering that task scheduling is represented by Directed Acyclic Grape (DAG). There are two types of task scheduling algorithms: static task scheduling and dynamic task scheduling algorithms. In this paper, we propose a new task scheduling algorithm based on minimum distance and an entry task duplicated on the processors. The minimum distance computes between an entry task and its successors. It includes, minimum distance of parent task, execution time and communication time Here , also considering a priority list (PL) attribute that contains tasks information of a given application program whose distance is minimum from an entry task. Finally, we will do comparative study of the proposed algorithm with Bounded Number of Processors (BNP) class of scheduling algorithms. It has done based on the following matrices: Scheduling Length, Speedup, Efficiency, Load Balancing and Normalized Scheduling Length (NSL). It showed proposed algorithm gives better result than BNP class of scheduling algorithms.
목차
Abstract
Introduction
Task scheduling problem
BNP CLASS OF SCHEDULING ALGORITHMS
Proposed Algorithm: STMD Algorithm
COMPARISON METRICS
PERFORMANCE EVALUATION
CONCLUSION
References
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
A Novel Approach for Task Scheduling in Parallel Computing using Priority Attributes
SmartCR
2015 .08
-
Arbitrary Processor Network Scheduling Algorithms in Parallel Computing
SmartCR
2015 .06
-
Review of Task Duplication Based (TDB) Scheduling Algorithms
SmartCR
2015 .02
-
Real-Time Scheduling for Periodic Tasks on Uniform Multiprocessors
Journal of Computing Science and Engineering
2020 .09
-
A genetic algorithm for scheduling problem in cell culturing
대한산업공학회 춘계공동학술대회 논문집
2023 .05
-
A Task Scheduling Method after Clustering for Data Intensive Jobs in Heterogeneous Distributed Systems
Journal of Computing Science and Engineering
2016 .03
-
Project scheduling with multiple agents
대한산업공학회 춘계공동학술대회 논문집
2017 .04
-
무선 애드혹 네트워크에서 우선순위를 고려한 분산 노드 스케줄링
제어로봇시스템학회 논문지
2020 .02
-
Complexity of Resource-Based Measures and Multi-Directional Scheduling Schemes
Industrial Engineering & Management Systems
2018 .12
-
국내 주요 산업별 스케줄링 기법의 연구동향
산업경영시스템학회지
2018 .01
-
Task Scheduling System Based on Consensus Algorithm in P2P Network
한국통신학회 APNOMS
2020 .09
-
계시별 요금제에서 State-Task Network를 이용한 단기 일괄작업 부하계획 모형
조명·전기설비학회논문지
2023 .12
-
도시 시나리오에서 지리적 거리 기반 Time Scheduling을 통한 공정한 V2I 통신에 관한 연구
한국통신학회 학술대회논문집
2022 .06
-
A Multi-Objective Evolutionary Algorithm for Scheduling Flexible Manufacturing Systems
Industrial Engineering & Management Systems
2017 .06
-
Application of Forest Optimization Algorithm for the Resource Constraint Project Scheduling
Industrial Engineering & Management Systems
2022 .06
-
시각물체 추적 시스템을 위한 멀티코어 프로세서 기반 태스크 스케줄링 방법
한국자동차공학회논문집
2016 .03
-
Dynamic Priority Assignment for Aperiodic Tasks in Limited Preemptive Scheduling
IEIE Transactions on Smart Processing & Computing
2020 .10
-
Near-Optimal Algorithm for Group Scheduling in OBS Networks
[ETRI] ETRI Journal
2015 .10
-
국내 주요 산업별 스케줄링 기법의 연구동향
대한산업공학회 춘계공동학술대회 논문집
2015 .04
-
An improved algorithm on two-stage scheduling with an outsourcing option
대한산업공학회 춘계공동학술대회 논문집
2017 .04
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2016-505-001393996