• International journal of advanced smart convergence
• /
• 제10권2호
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• Journal of information and communication convergence engineering
• /
• 제17권4호
• /
• pp.279-284
• /
• 2019

This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

• 한국통신학회논문지
• /
• 제21권10호
• /
• pp.2605-2619
• /
• 1996

In this paper, we evaluated performance of mobile exchange control part. Queueing network model is used for modeling of mobile exchange control part. We developed a call control processing and location registration scenartio which has a message exchange function between processors in mobile exchange control part. A network symbol are used the simulation models that are composed of the initialization module, message generation module, message routing module, message processing module, message generation module, HIPC network processing module, output analysis module. as a result of computer simulation, we obtain the processor utilization, the mean queue length, the mean waiting time of control part based on call processing and location registration capacity. The call processing and location registration capacity is referred by thenumber of call attempts in the mobile exchange and must be satisfied with the quality of service(delay time).

• Journal of Electrical Engineering and information Science
• /
• 제2권6호
• /
• pp.162-166
• /
• 1997

A message server have two basic functionalities, a server role for processing the processing the user environment as well as an entity role for transferring message to other entity in message system environment. The user who is going to send and receive his important information really wants to keep his own security requests. To satisfy this requirement, message server must be enforced by two seperated security policies- one for message processing security policy under department's computer working environment, the other for send/receive security policy under message system's communication path environment. Proposed access control model gurantees the user's security request by combining constrained server access control and message system access control with multi upper bound properties which come from inheritance attributes of originating user security contexts.

• 천문학회보
• /
• 제44권1호
• /
• pp.71.2-71.2
• /
• 2019

We have developed and tested a prototype system to process transient alert messages from the currently working facilities such as Gaia and GCN notices. Our experiments with the prototype focus on developing a platform that can be used in the LSST era with about 10 million alerts per night and helping Korean community members with the automated processing environment to provide auxiliary information for every alert message. The system consists of a message broker implemented by Redis and multiple message subscribers specialized for specific scientific interests. The current implementation of the entire system allows new Korean members to adopt their own processing chains receiving the messages from our local broker. We welcome experimental ideas and opinions from the Korean community about the current message processing system. We plan to test the current system with the ZTF alerts in the near future.

• 전기전자학회논문지
• /
• 제19권3호
• /
• pp.349-356
• /
• 2015

방공지휘통제경보체계는 작전환경에서의 적의 기습적 공중공격으로부터 우군의 부대, 시설 및 요충지 등을 방호하기 위하여, 전장의 탐지/식별센서, 경보전파/사격통제 및 타격체계를 유기적으로 결합하여 방공작전시 동시성과 통합성을 달성할 수 있는 체계이다. 방공지휘통제경보체계는 육군의 표준화된 가변형 메시지 포맷(KVMF) 메시지를 활용하여 체계 내 외부와의 통신하는데, 비트 단위의 메시지 처리가 짧은 시간동안 많이 발생하므로 메시지 처리 속도의 향상이 중요하다. 본 논문에서는 방공지휘통제경보체계의 KVMF 처리기 메시지 처리 속도 향상방안을 제안한다.

• 한국정보통신학회논문지
• /
• 제24권8호
• /
• pp.1109-1112
• /
• 2020

This paper presents a low cost hardware message passing engine of enhanced atomic pipelined broadcast based on processing node status. In this algorithm, the previous atomic pipelined broadcast algorithm is modified to reduce the waiting time until next broadcast communication. For this, the processor change the transmission order of processing nodes based on the nodes' communication channel. Also, the hardware message passing engine architecture of the proposed algorithm is modified to be adopted to multi-core processor. The synthesized logic area of the proposed hardware message passing engine was reduced by about 16%, compared by the pre-existing hardware message passing engine.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2017년도 춘계학술대회
• /
• pp.645-648
• /
• 2017

기존의 Embedded Tester는 Log 처리를 위해 TCP와 공유 파일 시스템을 이용한 Server - Client간 1-N 구조로 처리 되었다. 이러한 방식은 구현 난이도에 따른 시간적 손실과 예외처리에 따른 Tester의 리소스 낭비가 발생한다. 이에 메시징 시스템을 이용하여 분산처리가 가능한 Log 처리 메시지 레이어를 구현하고 기존의 TCP, 공유 파일 시스템 전송방식과 비교하였다. 비교 결과 메시지 레이어를 이용한 전송이 TCP 보다 더 높은 전송 대역폭을 보였다. CPU 사용량에서 메시지 레이어가 TCP 보다 낮은 효율을 보였으나 큰 차이를 보이지 않았다. 이를 통해 메시지 레이어를 이용한 Log 처리가 더 높은 효율을 보임을 알 수 있었다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권2호
• /
• pp.94-102
• /
• 2004

The digital electronic switching system has some problems, when this system processes OAM(Operation, Administration And Maintenance) messages about the fault, the traffic, the account, and the performance, etc., at the present. One of these problems is that each the module processing these messages in the digital electronic switching system can not process OAM messages out of another digital electronic switching system. Each the module processing these OAM messages, that is, has been programmed in order to process only the OAM message out of the digital electronic switching system mounting itself, not to process the message out of the digital electronic switching system based on another platform. Therefore, we studied on methods that could process OAM messages out of all digital electronic switching systems and, first of all, developed the MGS(Message Gathering System) to be able to accept and process the fault message of OAM messages out of all digital electronic switching systems in real time.

• 한국정보처리학회논문지
• /
• 제2권4호
• /
• pp.453-465
• /
• 1995

원격 프로시듀어 호출은 좀 더 효율적이며 신뢰성이 가미된 분산 프로그램을 프로 그래머가 작성하기 쉽도록 하기 위하여 연구 되어 왔다. 본 연구에서는 하드웨어 결함 에 대한 신뢰성 있는 결함 허용 원격 프로시듀어 호출 기법을 제시한다. 결합 허용은 chain이라 불리는 노드의 그룹으로 프로시듈어를 복제 하여 제공하며, chain내의 사본 들은 선형적인 순서로 되어 있다. 프로시듀어에 대한 호출은 chain내의 첫 번째 사본 (primary copy)으로 보내지며, 나머지 사본에게는 내부적으로 전파된다. 결함이 발생 한 경우, 결함이 발생하지 않은 chain 내의 첫 번째 사본이 caller에게 결과를 반환하 게 된다. 특히, 제한적으로 ack message을 사용함으로써 중복된 call message와 result message의 처리를 피하였다. 이 기법은 기존의 원격 프로시듀어 호출에 비하여 효율적 이고 신뢰성 있는 결함 허용을 제공하게 된다.