http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
김종환,장순태 한국의사결정학회 1999 경영과학연구 Vol.8 No.-
Finite queueing system is an useful tool to decide the appropriate service capacities in various areas such as manufacturing systems, computer communication systems, and service systems. Particularly, queueing systems with fork/join structures can be applied to evaluate the performance of parallel processing systems, assembly/disassembly manufacturing, and distributed replicated database systems. In this paper, we present the approximation method for the simple ford/join queue with 3-siblings and blocking-before-service mechanism. To capture the ford/join phenomenon effectively, the buffer positions adjacent to the fork/join server are replaced by the artificial servers with infinite service rate. Such an approach make decomposition approach to be effective since the fork/join phenomenon can be applied into many small subsystems.
김종환,정원,장순태 한국경영과학회 1998 한국경영과학회 학술대회논문집 Vol.- No.1
Fork/join queueing network is a useful tool for evaluating the performance of parallel processing systems, manufacturing systems, and replicated database systems. A few researches for such systems have been reported, but most of which are restricted to the case that the service time distribution is deterministic. We perform an approximate analysis on acyclic Markovian fork/join networks with finite buffers under the 'blocking after service' mechanism. Using a decomposition approach, we propose an approximate algorithm for two-sibling networks, which can evaluate some major performance measures such as throughputs and average buffer levels.