시간제약이 있는 정보처리시스템의 성능분석 모형A Model for Performance Analysis of the Information Processing System with Time Constraint
- Other Titles
- A Model for Performance Analysis of the Information Processing System with Time Constraint
- Authors
- 허선; 주국선; 정석윤; 윤주덕
- Issue Date
- Jun-2010
- Publisher
- 대한산업공학회
- Keywords
- Information Processing System; Information Processing Time; Markov Chain; Time Constraint; Packet Switching Networks
- Citation
- 대한산업공학회지, v.36, no.2, pp 138 - 145
- Pages
- 8
- Indexed
- KCI
- Journal Title
- 대한산업공학회지
- Volume
- 36
- Number
- 2
- Start Page
- 138
- End Page
- 145
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40246
- ISSN
- 1225-0988
2234-6457
- Abstract
- In this paper, we consider the information processing system, which organizes the collected data to meaningful information when the number of data collected from multiple sources reaches to a predetermined number, and performs any action by processing the collected data, or transmits to other devices or systems.
We derive an analytical model to calculate the time until it takes to process information after starting to collect data. Therefore, in order to complete the processing data within certain time constraints, we develop some design criteria to control various parameters of the information processing system. Also, we analyze the discrete time model for packet switching networks considering data with no particular arrival nor drop pattern.
We analyze the relationship between the number of required packets and average information processing time through numerical examples. By this, we show that the proposed model is able to design the system to be suitable for user’s requirements being complementary the quality of information and the information processing time in the system with time constraints.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF INDUSTRIAL & MANAGEMENT ENGINEERING > 1. Journal Articles

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