• Journal of the Korean Statistical Society
• /
• v.30 no.4
• /
• pp.661-666
• /
• 2001

In this paper we consider an M/G/1 queue where the server of the system has a vacation time and the service policy is limited-1. In this system, upon termination of a vacation the server returns to the queue and serves at most one message in the queue before taking another vacation. We consider two models. In the first, if the sever finds the queue empty at the end of a cacation, then the sever immediately takes another vacation. In the second model, if no message have arrived during a vacation, the sever waits for the first arrival to serve. The analysis of this system is particularly useful for a priority class polling system. We derive Laplace-Stieltjes transforms of the waiting time for both models, and compare their mean waiting times.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.273-274
• /
• 2023

본교에서 강의실, 회의실 등 공용공간을 사용하기 위해서는 사용자가 수기로 양식을 작성하여 제출하고 담당자가 처리해야 한다. 이 방식은 사용자가 사용하고자 하는 공간의 예약 현황을 확인할 수 없고, 사용신청 과정에서 직접 담당자를 찾아가야 한다는 불편함이 따른다. 본 연구에서는 이러한 불편함을 개선하기 위하여 마이크로 서비스 아키텍처 기반의 공간 예약 웹서비스를 구현한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.298-300
• /
• 2001

본 논문에서는 웹, 모바일 환경에 적응 가능하고, 다양한 서비스의 지원이 가능한 글로벌 Peer-to-Peer(P2P) 엔진에서 서비스 모듈, 네트워크 모듈, 레파지토리 모듈간에 발생되는 메시지를 처리하는 메시지 디스패쳐의 설계 경험을 기술한다. P2P엔진이 이 기종 네트워크환경에 적응 가능하고, 다양한 서비스들을 동시에 지원하기 위해서는 피어 간 또는 엔진 내부에서 발생하는 많은 메시지들을 원활히 처리하는 모듈이 필요하다. 이를 위하여 메시지 처리를 위한 글로벌 P2P 엔진의 메시지 디스패쳐를 제안한다. 메시지 디스패쳐는 글로벌 P2P엔진에서 지원하는 서비스 또는 다른 모듈에서 발생하는 메시지들을 우선순위와 마감시간을 이용하여 작업순서를 배열하는 Message Queue, Message Queue에 적재된 메시지들을 분석하여 처리하는 Message Processor, 메시지 디스패쳐와 서비스 또는 각 모듈간의 메시지의 전달을 위한 공유 버퍼인 Service Buffer로 구성되어져 있다. P2P 엔진에서 메시지 디스패쳐를 이용하게 되면 다양만 서비스에 적응가능하고, 모듈간의 투명성을 제공하고, 신속한 메시지의 처리가 가능하게 된다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.1-14
• /
• 1994

In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.671-673
• /
• 2003

본 논문에서는 워크플로우 시스템의 엔진 컴포넌트들 간에 이루어지는 내부 통신 메커니즘에 대해 기술한다. 워크플로우 엔진의 내부 통신 메커니즘을 구현하는 방법은 동기적 매커니즘과 비동기적 메커니즘으로 나뉘어진다. 본 논문에서 제안하고 있는 e-Chautauqua 워크플로우 관리 시스템에서는 비동기적 메커니즘을 토대로 하여 엔진 컴포넌트들의 내부 통신 처리를 구현한다. 이러한 엔진 내부 통신의 성능 향상을 위해 비동기 메시징 방식을 기반으로 하는 EJB 메시지 빈(Message-Driven Bean)을 사용하여 설계한다. 또한 엔진 컴포넌트들 간의 내부 통신시에 사용되는 송수신 메시지를 구조적인 유연성과 확장성을 지닌 XML로 설계함으로서 엔진 컴포넌트들간의 내부 통신을 보다 효율적으로 이루어지도록 설계한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.86-92
• /
• 2011

In this paper, we propose a novel hardware MPI(Message Passing Interface) unit which supports message passing in multiprocessor system which use distributed memory architecture. MPI Hardware unit processes data synchronization, transmission and completion, and it supports processor non-blocking operation so it reduces overhead according to synchronization. Additionally, MPI hardware unit combines ready entry, request entry, reserve entry which save and manage the synchronized messages and performs the multiple outstanding issue and out of order completion. According to BFM(Bus Functional Model) simulation result, the performance is increased by 25% on many to many communication. After we designed MPI unit using HDL, with synopsys design compiler we synthesized, and for synthesis library we used MagnaChip $0.18{\mu}m$. And then we making prototype chip. The proposed message transmission interface hardware shows high performance for its increase in size. Thus, as we consider low-cost design and scalability, MPI hardware unit is useful in increasing overall performance of embedded MPSoC(Multi-Processor System-on-Chip).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.59-66
• /
• 2012

The use of MPSoC has been increasing because of a rise of use of mobile devices and complex applications. For improving the performance of MPSoC, number of processor has been increasing. Standard MPI is used for efficiently sending data in distributed memory architecture that has advantage in multi processor. Standard In this paper, we propose a scalable distributed memory system with a low cost hardware message passing interface(MPI). The proposed architecture improves transfer rate with buffered send for small size packet. Three queues, Ready Queue, Request Queue, and Reservation Queue, work as previous architecture, and two queues, Small Ready Queue and Small Request Queue, are added to send small size packet. When the critical point is set 8 bytes, the proposed architecture takes more than 2 times the performance improvement in the data that below the critical point.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.3
• /
• pp.509-516
• /
• 2018

TCP is a well-known communication protocol which is widely used for reliable message transmissions. The urgent mechanism of TCP plays a key role to transmit messages with a high priority. If a high priority message occurs at the transmitting node, the urgent mechanism informs the receiving node about the presence of a high priority message prior to its transmission so that the receiving node can be prepared for handling this message in advance. This implies that the existing urgent mechanism of TCP does not guarantee an immediate or faster delivery of the high priority message itself. Therefore, the ability of priority-based transmission is required on TCP not only to ensure reliable transmissions of normal messages but also to offer a differentiated service according to the priority of message. This paper presents a priority-based transmission algorithm over TCP using a priority queue in a multi-threaded environment. The effectiveness of the proposed algorithm is explored using an experimental setup in which various messages with different priority levels are transmitted.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.484-486
• /
• 2000

JMS(Java Message Service)는 분산된 엔터프라이즈 시스템간의 메시지 생성, 전달, 수신 및 읽기를 위한 자바 기반의 표준 API를 제공한다. 이 API의 구조는 메시징 방식에 따라 Topic을 메시지 서버로 하는 Pulish-Subcribe모델과 Queue를 서버로 기자는 Point-To-Point 모델로 구분된다. IDL/SSO는 병행성(Concurrency), 영속성(Persistency), 필터(filter)등의 기능을 제공하는 공유객체 명세언어 시스템이다. 본 논문에서는 이 IDL/SSO를 이용하여 JMS를 구현하는 방법에 대하여 기술한다.