지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2007.12
- 수록면
- 1,741 - 1,751 (11page)
이용수
초록· 키워드
오류제보하기
The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with a/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.
목차
ABSTRACT
1. INTRODUCTION
2. IMPRECISE ON-LINE REAL-TIME TASK SYSTEM MODEL
3. RELATED WORKS
4. MPRECISE ON-LINE TASK SCHEDULING ALGORITHM
5. SIMULATION STUDY
6. CONCLUSION
REFERENCES
참고문헌 (13)
참고문헌 신청
1. [단행본] - André M. van Tilborg / 1991 / Foundations of Real-Time Computing Scheduling and Resource Management / Kluwer Academic Publishers
2. [학술지(정기간행물)] - K. H. Song / 1997 / A Heuristic Scheduling Algorithm for Reducing the Total Error of an Imprecise Multiprocessor System with 0/1 Constraint / Journal of Electrical Engineering and Information Science 2 (6) : 1 ~ 6
3. [학술대회논문] - C. H. Lee / 1998 / On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks / Proceedings of Fifth International Conference on Real-Time Computing Systems and Applications : 137 ~ 144
4. [학술지(정기간행물)] - Wei-Kuan Shih / 1996 / On-Line Scheduling of Imprecise Computations to Minimize Error / SIAM J. COMPUT 25 (5) : 1105 ~ 1121
5. [학술지(정기간행물)] - Sanjoy K. Baruah / 1998 / Competitive On-Line Scheduling of Imprecise Computations / IEEE Transactions on Computers 47 (9) : 1027 ~ 1032
2. [학술지(정기간행물)] - K. H. Song / 1997 / A Heuristic Scheduling Algorithm for Reducing the Total Error of an Imprecise Multiprocessor System with 0/1 Constraint / Journal of Electrical Engineering and Information Science 2 (6) : 1 ~ 6
3. [학술대회논문] - C. H. Lee / 1998 / On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks / Proceedings of Fifth International Conference on Real-Time Computing Systems and Applications : 137 ~ 144
4. [학술지(정기간행물)] - Wei-Kuan Shih / 1996 / On-Line Scheduling of Imprecise Computations to Minimize Error / SIAM J. COMPUT 25 (5) : 1105 ~ 1121
5. [학술지(정기간행물)] - Sanjoy K. Baruah / 1998 / Competitive On-Line Scheduling of Imprecise Computations / IEEE Transactions on Computers 47 (9) : 1027 ~ 1032
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
An On-line Algorithm to Search Minimum Total Error for Imprecise Real-time Tasks with 0/1 Constraint
멀티미디어학회논문지
2005 .12
-
A Heuristic Scheduling Algorithm for Reducing the Total Error of an Imprecise Multiprocessor System with 0/1 Constraint
Journal of Electrical Engineering and Information Science
1997 .10
-
An Improved Online Algorithm to Minimize Total Error of the Imprecise Tasks with 0/1 Constraint
정보과학회논문지 : 시스템 및 이론
2007 .10
-
A Heuristic Scheduling Algorithm for Reducing the Total Error of an Imprecise Multiprocessor System with 0/1 Constraint
Journal of Electrical Engineering and information Science
1997 .12
-
An Efficient Algorithm to Minimize Total Error of the Imprecise Real Time Tasks with 0/1 Constraint
컴퓨터산업학회논문지
2006 .01
-
Static Task Scheduling Algorithm with Minimum Distance for Multiprocessor System (STMD)
SmartCR
2015 .04
-
부정확 타스크의 최대가중치 오류를 최소화 시키는 온라인 스케쥴링 알고리즘 ( On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks )
한국통신학회논문지
1999 .06
-
A Novel Approach for Task Scheduling in Parallel Computing using Priority Attributes
SmartCR
2015 .08
-
GRID 시스템을 위한 온라인 스케쥴링 알고리즘
정보과학회논문지 : 시스템 및 이론
2004 .02
-
A NOTE ON AN INTERVAL-VALUED CHOQUET EXPECTED UTILITY AND THEIR APPLICATIONS
한국지능시스템학회 학술발표 논문집
2015 .10
-
Arbitrary Processor Network Scheduling Algorithms in Parallel Computing
SmartCR
2015 .06
-
A Prescriptive Group Decision Making Method with Imprecise Preference Data
한국지능정보시스템학회 학술대회논문집
2004 .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
-
실시간 시스템에서 큐잉 이론을 이용한 부정성 확률의 계산 기법
(구)정보과학회논문지
1994 .12
-
Performance Evaluation of Imprecise Region Delineation Algorithms Based on City-Scale Ground-Truth
한국통신학회 학술대회논문집
2017 .06
-
MPCore Based Task Scheduling under Peak Power Constraint
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2007 .07
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2012-004-004431297