KLI

분산처리시스템에서의 업무할당에 관한 연구

Metadata Downloads
Alternative Title
Task Allocation in a Distributed Processors System
Abstract
분산처리시스템은 정보통신시스템이나 생산시스템에서 많이 나타나고 있는 시스템으로, 시스템을 설계하고 업무를 할당하는 문제는 매우 중요하며 여러가지 기준에 의해 시스템이 설계되고 있다. 본 연구에서는 평균대기길이와 평균대기시간의 기준으로 시스템을 설계하고 업무를 할당하는 것을 연구하였으며, 기존의 해법을 소개하고 이를 수정개선한 해법을 연구한다.
This paper considers a design problem for a distributed processors system. For the system, two decision levels are considered: which candidated processors to open with capacity option and how to allocate the task generated at each distributing point. Two performance measures with budget constraint are to minimize the maximum mean queue length and to minimize the maximum mean delay time. For solution, we use the parametric algorithm developed by Tcha and presented a new parametric algorithm.
This paper considers a design problem for a distributed processors system. For the system, two decision levels are considered: which candidated processors to open with capacity option and how to allocate the task generated at each distributing point. Two performance measures with budget constraint are to minimize the maximum mean queue length and to minimize the maximum mean delay time. For solution, we use the parametric algorithm developed by Tcha and presented a new parametric algorithm.
Author(s)
이영덕
Issued Date
1994
Type
Research Laboratory
URI
https://oak.ulsan.ac.kr/handle/2021.oak/3617
http://ulsan.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002024220
Alternative Author(s)
Lee,Young-Duek
Publisher
경영학연구논문집
Language
kor
Rights
울산대학교 저작물은 저작권에 의해 보호받습니다.
Citation Volume
1
Citation Number
2
Citation Start Page
109
Citation End Page
118
Appears in Collections:
Research Laboratory > Journal of management
Authorize & License
  • Authorize공개
Files in This Item:

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.