• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.1571-1574
• /
• 2010

최근 자료 송수신을 위한 분산 컴퓨팅 시스템들이 다양하게 연구되고 있다. 특히 센서를 이용하는 임베디드 어플리케이션들을 위한 분산 시스템들은 다양한 방면으로 연구되고 있다. 그 중 분산 미들웨어는 다양한 하드웨어 시스템과 응용 시스템 중간에 존재하며 유기적인 연결을 돕는 역할을 해왔다. 분산 미들웨어는 크게 원격 객체 관리를 위한 서버-클라이언트 모델, 메시지 패싱을 목적으로 하는 메시지 패싱 모델, 자료 분배를 목적으로 하는 출반-구독 모델로 나눌 수 있다. 이중출판-구독 모델은 원하는 데이터를 선택하여 다양한 수신 단말에 전송하기에 최적화된 구조를 지닌다. 본 논문에서는 대표적인 출판-구독 모델인 Data Distribution Service 를 소개하고 특정 상황에서 발생할 수 있는 네트워크 집중화를 막기 위해 오버레이 네트워크를 이용하는 기법을 제시한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1995.10a
• /
• pp.559-562
• /
• 1995

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.901-915
• /
• 1999

Parallel computers are known to be excellent in performance per cost also satisfying scalability and high performance. However parallel machines have enjoyed limited success because of difficulty in parallel programming and non-portability between parallel machines. Recently, researchers have sought to develop data parallel language that provides machine independent programming systems. Data parallel language such as High Performance Fortran provides a basis to write a parallel program based on a global name space by partitioning data and computation, generating message-passing function. In this paper, we describe the Parallel Programming Translator(PPTran), source-to-source data parallel compiler, generating MPI SPMD parallel program from HPF input program through four phases such as data dependence analysis, partitioning data, partitioning computation, and code generation with explicit message-passing and verify the performance of PPTran

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.6
• /
• pp.762-770
• /
• 2015

Fault tolerance is a crucial design for a mission-critical computer such as engagement control computer that has to maintain its operation for long mission time. In recent years, software fault-tolerant design is becoming important in terms of cost-effectiveness and high-efficiency. In this paper, we propose MPCMCC which is a model-based software component to implement fault tolerance in mission-critical computers. MPCMCC is a fault tolerance design that synchronizes shared data between two computers by using the one-way message-passing scheme which is easy to use and more stable than the shared memory scheme. In addition, MPCMCC can be easily reused for future work by employing the model based development methodology. We verified the functions of the software component and analyzed its performance in the simulation environment by using two mission-critical computers. The results show that MPCMCC is a suitable software component for fault tolerance in mission-critical computers.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.511-514
• /
• 2002

In may automated systems such as manufacturing systems and process plants, an industrial network or fieldbus is a very important component for the exchange of various and sometimes crucial information. Some of the information has a tendency to rapidly lose its value as time elapses after its creation. Such information or data is called real-time data that includes sensor values and control commands. In order to deliver these data in time, the fieldbus network should be tailored to have short delay with respect to the individual time limit of various data. Fine-tuning the network for a given traffic requires the knowledge on the relationship between the protocol parameters such as timer values and the performance measure such as network delay. This paper presents a mathematical performance model to calculate communication delays of the Profibus FMS network when the timer value TTR and the traffic characteristics are given. The results of this model is compared to those from experiments to assess the model's validity.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.22-31
• /
• 1989

In this paper, we analyze the performance of the IEEE 802.4 token passing bus protocol through a simulation model of the protocol. In order to analyze performance of the protocol in the initialization, transition and fault recovery states as well as in the steady state, the protocol functions are divided into five processes each of which can effectively simulate protocol behaviors according to the variations of protocol parameters. From the simulation study, we obtain protocol parameters which severely influence the protocol performance and find out that proper selection of the protocol parameter values for token passing is very important to obtain good performance of the protocol when the priority scheme is used.

• Electronics and Telecommunications Trends
• /
• v.13 no.4 s.52
• /
• pp.32-42
• /
• 1998

본 고는 최근 들어 활발하게 연구가 진행중인 병렬 처리 분야 중에서 여러 가지 병렬 프로그래밍 방법에 대한 정의 및 특징을 살펴보고, 대표적인 사례에 대해 요약해본다. 먼저 데이터 병렬성을 이용한 프로그래밍 방법과 대표적인 프로그래밍 언어 HPF에 대해 살펴본 후, 어드레스 공간이 공유되는 공유 메모리/분산공유 메모리 시스템에서의 프로그래밍 방법과 최근 표준화 작업이 진행중인 OpenMP에 대해서 알아본다. 끝으로 어드레스 공간이 공유되지 않는 분산 메모리 시스템에서의 프로그래밍 방법과 표준 메시지 패싱 인터페이스인 MPI에 대해 서술한다.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.111-113
• /
• 2006

FOUNDATION fieldbus provides scheduling and token-passing services for cyclic and sporadic data respectively. In this paper, we evaluate the delay performance of token-passing mechanism in FOUNDATION fieldbus network system using an experimental model. This paper introduces a method of developing an experimental model which consists of 10 nodes of FOUNDATION fieldbus communication device. Using the experimental model, we evaluate the delay performance of time-critical and time-available data with respect to change of TTRT parameter.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1000-1005
• /
• 1993

In this paper asymptotic formulate for performance characteristics throughput, delay) of large scale token-passing networks with priorities and limited service are given. In particular, adaptive control procedures for obtaining optimal buffer capacity with respect to each priority and optimal limited service are shown. All results obtained are supported by simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.37-42
• /
• 1992

The main purpose of the paper is to derive asymptotic formulae for performance characteristics(throughput, delay) of large-scale token-passing network with buffered stations and to optimize the buffer capacity with respect to the probability of data generation. We consider two versions of token-passing network: uniform and nonuniform token-passing time interval. All results obtained are supported by simulations.