지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국정보통신학회JICCE Journal of information and communication convergence engineering Journal of information and communication convergence engineering 제9권 제4호
- 발행연도
- 2011.8
- 수록면
- 471 - 474 (4page)
이용수
초록· 키워드
오류제보하기
In parallel job scheduling, each job can be executed simultaneously on multiple machines at a time. Thus in the input instance, a job J<SUB>f</SUB> requires the number m<SUB>i</SUB> of machines on which it shall be processed. The algorithm should determine not only the execution order of jobs but also the machines on which the jobs are executed.
In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem.
We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.
In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem.
We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.
목차
Abstract
Ⅰ. INTRODUCTION
Ⅱ. RELATED WORK
Ⅲ. ALGORITHMS
Ⅳ. ANALYSIS
Ⅴ. CONCLUSIONS
REFERENCES
참고문헌 (13)
참고문헌 신청
1. [단행본] - J. Blazewicz / 2007 / Handbook on Scheduling: From Theory to Applications / Springer
2. [학술지(정기간행물)] - M. Drozdowski / 1996 / Scheduling multiprocessor tasks –an overview / European Journal of Operational Research 94 (2) : 215 ~ 230
3. [단행본] - J. Y. Leung / 2004 / Handbook of Scheduling: Algorithms, Models, and Performance Analysis / Chapman and Hall/CRC
4. [학술지(정기간행물)] - A. V. Fishkin / 2003 / An maximizing the throughput of multiprocessor tasks / Theoretical Computer Science 302 : 319 ~ 335
5. [학술지(정기간행물)] - J. Du / 1989 / Complexity of scheduling parallel task systems / SIAM J. Disc. Math 2 (4) : 473 ~ 487
2. [학술지(정기간행물)] - M. Drozdowski / 1996 / Scheduling multiprocessor tasks –an overview / European Journal of Operational Research 94 (2) : 215 ~ 230
3. [단행본] - J. Y. Leung / 2004 / Handbook of Scheduling: Algorithms, Models, and Performance Analysis / Chapman and Hall/CRC
4. [학술지(정기간행물)] - A. V. Fishkin / 2003 / An maximizing the throughput of multiprocessor tasks / Theoretical Computer Science 302 : 319 ~ 335
5. [학술지(정기간행물)] - J. Du / 1989 / Complexity of scheduling parallel task systems / SIAM J. Disc. Math 2 (4) : 473 ~ 487
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2023-004-000410808