서지주요정보
다중 프로세서상에서 실제적 통신부담을 고려한 스케줄링 알로리즘과 그 응용에 관한 연구 = A study of scheduling algorithm with actual communication overheads on multi-processor system and its applications
서명 / 저자 다중 프로세서상에서 실제적 통신부담을 고려한 스케줄링 알로리즘과 그 응용에 관한 연구 = A study of scheduling algorithm with actual communication overheads on multi-processor system and its applications / 정봉준.
저자명 정봉준 ; Jung, Bong-Joon
발행사항 [대전 : 한국과학기술원, 1993].
Online Access 제한공개(로그인 후 원문보기 가능)원문

소장정보

등록번호

8003969

소장위치/청구기호

학술문화관(문화관) 보존서고

MEE 93075

SMS전송

도서상태

이용가능

대출가능

반납예정일

초록정보

In this thesis, we investigate the problem of scheduling in multi-computer system, i.e., given a set of interacting program modules, to which processor should each program module be assigned and when should each program module be executed. The scheduling problem is one of the most fundamental research topics for parallel computing, and has received much attention during the last decades. The objective of scheduling is to minimize the total execution time of the whole program, whoever, which is known to be NP-hard. Our scheduling policy has been developed under the KAPPA programming environment. KAPPA is programming aid for KAICUBE II, 5 dimentional hypercube multicomputer developed in Computer Engineering Research Laboratory. The input of KAPPA is a sequential-like program which contains sevral primitives for explicit parallelism. Dependency analysis, parallelization, scheduling, and target code generation are performed automatically in KAPPA. Experiments in KAICUBE II have shown that there is some extra execution time overhead due to communication primitives, which is ignored in previous scheduling schemes. The overhead is mainly due to the software delay for correct communication protocols and synchronization of communication data. Because of such overhead, existing scheduling algorithm result in errotic execution time analysis. In this thesis, we propose a scheduling algorithm which reflects the execution time overhead due to communication primitives and using this alogrithm we achive more accurate scheduling result. And also, it is shown that parallel program developement in KAPPA is very easy and efficient for message-passing model parallel programming environment.

서지기타정보

서지기타정보
청구기호 {MEE 93075
형태사항 iii, 66 p. : 삽도 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Bong-Joon Jung
지도교수의 한글표기 : 박규호
지도교수의 영문표기 : Kyu-Ho Park
학위논문 학위논문(석사) - 한국과학기술원 : 전기 및 전자공학과,
서지주기 참고문헌 : p. 64-66
주제 Scheduling (Management)
Multiprocessors.
Parallel computers.
NP-complete problems.
Computer network protocols.
다중 처리 장치 시스템. --과학기술용어시소러스
병렬 컴퓨터. --과학기술용어시소러스
순차 제어. --과학기술용어시소러스
NP 완전 문제. --과학기술용어시소러스
컴퓨터망. --과학기술용어시소러스
QR CODE qr code