• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.157-162
• /
• 2005

Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

• ETRI Journal
• /
• v.17 no.1
• /
• pp.23-36
• /
• 1995

We present a performance evaluation model of cell reassembly mechanism in an ATM switching system. An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications network. In such a system, there should be interface to convert inter-processor communication traffic from message format to cell format and vice versa, that is, mechanisms to perform the segmentation and reassembly sublayer. In this paper, we employ a continuous-time Markov chain for the performance evaluation model of cell reassembly mechanism with individual buffering, judicially defining the states of the mechanism. Performance measures such as message loss probability and average reassembly delay are obtained in closed forms. Some numerical illustrations are given for the performance analysis and dimensioning of the cell reassembly mechanism.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.1
• /
• pp.123-129
• /
• 1997

This study is implementation of transmitter signal processing of MF/HF DSC Controller, obliligation system of GMDSS, focused on the technique of processing to encode the distress and general signal of the DSC message. We analyzed recommendation which prescribed frequencies, operational procedures and technical sequence of the DSC and suggested the basic circuit to be materialize the function of a distress alert and general calf of the DSC equipment using Microprocessor, constructed the algorithm of processing a message, programmed it using C language.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.10
• /
• pp.714-719
• /
• 2004

The Controller Area Network (CAN) is being widely used in real-time control applications such as automobiles, aircraft, and automated factories. Unfortunately, CAN, in its current form, is not able to either share out the system bandwidth among the different devices fairly or to grant an upper bound on the transmission times experienced by the nodes connected to the communication medium as it happens, for instance, in the token-based networks. In this paper. we present the message scheduling for CAN, based on the distributed control scheme to integrate actuators and sensors in a humanoid robot. Besides introducing the new algorism, this paper also presents some performance figures obtained using a specially developed software simulator, while the behavior of the new algorism is compared with the traditional CAN systems, in order to see how effective they are.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.246-248
• /
• 2005

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. However, CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO (Inha Semyung Humanoid RObot).

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.4
• /
• pp.377-384
• /
• 2004

Nowadays, control systems consist of smart sensors, smart actuators, and controllers connected via fieldbus. Some devices such as motors in plant environments generate high degrees of EMI or noise. This noise may cause communication errors and make the successful transmission of data longer. Therefore, the noise condition has to be considered at the design of a reliable control system based on a network. This paper presents a scheduling method of task and message to guarantee the given end-to-end constraints under noise environments. A noise model with multi-sources of noise is used, and the analysis method of message's response time is presented when the noise model is applied to CAN (Controller Area Network). Two kinds of noise models are applied to an example system, and the effect to each control loop s end-to-end response time is analyzed. We believe that the proposed method help system designers design the control system guaranteeing its requirements under noise environment.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.36-39
• /
• 2000

급변하는 소비자의 욕구를 만족시키고 이에 신속하게 대처하기 위해 Agile manufacturing 이나 Flexible manufacturing system에 관한 연구가 활발히 전개되어 왔다. 또한 최근에 급속한 컴퓨터 관련 하드웨어의 발달의 인해 시스템 내부에 사용되는 장비 제어를 PC based controller 로 바꾸려는 움직임이 일고있다. 이러한 PC based controller가 전용 컨트롤러의 모든 기능을 수행하기란 아직은 한계가 있으나 점차 그 사용이 보편화될 것이며, 더욱이 컴퓨터 하드웨어의 놀라운 기술 발전으로 인해 앞으로는 여러 대의 장비를 한 대의 컨트롤러로 제어할 수도 있을 것이다. 본 연구에서는 이러한 환경에 민첩하게 대응하기 위해서 우선 각 장비별로 컨트롤러와의 통신을 위한 message 를 종합하고 이를 체계적으로 분류하도록 하며, 이렇게 분류된 각 message 들이 PC 기반의 콘트롤러에 줄 수 있는 load 를 계산하는 방법을 제시한다. 본 연구를 통해 컨트롤로의 각 장비를 제어함에 있어서 걸리는 작업 부하를 수치적으로 계산해 냄으로써 앞으로 제어할 장비를 무리 없이 컨트롤하기 위한 최적의 컨트롤러를 구성하는데 도움이 될 것이다.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.771-774
• /
• 1999

This paper presents a new timing structure for real time communications and its performance analysis. The cycle time consists of several "one time slot" which may be an interval defined by a synchronous traffic part followed by an asynchronous traffic part. If a station receives a token within a synchronous interval, it transmits its synchronous message if any, otherwise it may transmit an asynchronous message. This scheme is different from usual allocation schemes which divide one cycle into alternating synchronous and asynchronous subslots. This protocol is designed to prevent low priority messages from delaying too much due to lots of high priority messages. We propose the algorithm and show its justification by simulation.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.307-310
• /
• 2004

As computers and networks become popular, distributing information on the Internet is common in our daily life. Also, the explosion of the Internet, of wireless digital communication and data exchange on Internet has rapidly changed the way we connect with other people. But current firewall and IDS(Intrusion Detection System) of the network level suffers from many vulnerabilities in internal computing informations and resources. In this paper, we design of ICMP-based Traceback System using a ICMP Traceback Message for efficiently traceback without change structure of routers. ICMP-based Traceback System.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.1
• /
• pp.77-84
• /
• 1992

Queueing models with service can be applied in the area of performance studies of polling systems in data communication and switching systems. We provide a new approach for analysis on the cycle time of the multiqueue system consisting of statistically identical stations where at most one message is served for any station in a polling cycle. We assume an independent Posson arrival at each station. The message service time and switchover time are assumed to be constant. Based on the dependence between the stations, cycle time distribution is derived. Then, this result is validated by a computer simulation.