서지주요정보
효율적인 워크플로우 처리를 위한 체재시간 기반의 여유시간 할당 방법 = A sojourn time-based slack time assignment method for efficient workflow processing
서명 / 저자 효율적인 워크플로우 처리를 위한 체재시간 기반의 여유시간 할당 방법 = A sojourn time-based slack time assignment method for efficient workflow processing / 김정훈.
발행사항 [대전 : 한국과학기술원, 1999].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8009817

소장위치/청구기호

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

MCS 99013

휴대폰 전송

도서상태

이용가능(대출불가)

사유안내

반납예정일

등록번호

9006002

소장위치/청구기호

서울 학위논문 서가

MCS 99013 c. 2

휴대폰 전송

도서상태

이용가능(대출불가)

사유안내

반납예정일

리뷰정보

초록정보

Since timely completion of business process in system-oriented workflow environment is important for Quality of Services(QOS), the Workflow Management System needs to provide the facility to define and manage the deadline of workflow processes. A workflow consists of a set of activities that are individual process steps and agents executing these activities. Many escalations may occur if some agents are highly loaded and require much time to complete the activity. To prevent this situation and improve performance, we can consider the deadline of each activity and invoke, if necessary, early escalation to minimize escalation cost and allow more system resources to other processes. Some mechanisms for managing activity deadlines during process execution have been proposed. They commonly assume the deadline of each activity is pre-defined by business analysts. Typically, business analysts, however, only focus on the entire process deadline, and may not know about the information of the deadline of each activity. In this paper, we propose a new slacktime allocation method that allocates slacktime proportional to the sojourn time of each activity. We estimate the mean sojurn time of each activity and analyze workflow control structures such as And, Or, Iteration to estimate the mean sojourn time in workflow. We use queueing theory and the probability density function of each activity's sojourn time to obtain the expected value of the additional slacktime. We only consider the case that each branch is composed of just one server, but we also present a mechanism to transform multiple servers to one server approximately. In our experiments, we validate the estimates of sojourn times and show our method is more efficient than other slacktime assignment methods

서지기타정보

서지기타정보
청구기호 {MCS 99013
형태사항 iii, 37 p. : 삽화 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Jung-Hoon Kim
지도교수의 한글표기 : 김명호
지도교수의 영문표기 : Myoung-Ho Kim
학위논문 학위논문(석사) - 한국과학기술원 : 전산학과,
서지주기 참고문헌 : p. 36-37
QR CODE

책소개

전체보기

목차

전체보기

이 주제의 인기대출도서