• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.4
• /
• pp.369-375
• /
• 2001

This paper proposes a dual real-time scheduling design under real-time constraints kernel environments. In this paper, we have designed both the real-time kernel and the general kernel that have their different properties to satisfy these properties, that is, interrupt latency, scheduling precision, and message passing. In real-time tasks, interrupt processing should be run. In general kernel, non real-time tasks or general tasks are run. Also, when tasks conflict, it executed the mixed priority scheduling that non real-time kernel executed static scheduling and real-time kernel executed dynamic priority transformation scheduling, that is, least-laxity-first/minimization preemption scheduling. We have compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.237-246
• /
• 2001

In this paper we introduce a solution to improve the unfairness problem and to remove the waste of bandwidth in the distributed queue dual bus system. This solution requires only a minor modification of the current protocol and further shows no bandwidth wastes when we try to resolve the unfairness problem occurred in current DQDB protocol. There has been many problem in DQDB system in terms of fairness of sending message in each node. In order to solve this problem, Bandwidth Balancing technic and proportional assignment technic have been introduced. It is, however, to note that the waste of bandwidth problem is still existing in those technics, even though there has been significant improvement as to the fairness problem. In this paper we introduce a new solution to remove the waste of bandwidth problem while we are still obtaining the improved fairness of the network. By following this new solution, the simulation result shows higher throughput and lower message delay than previously proposed technics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.307-312
• /
• 2008

최근 전기 전력 도메인의 IT화 (전력 IT) 가 본격적으로 진행되면서 전기 데이터를 취득하기 위한 기기들 뿐만 아니라 전력 운영 환경이 변화를 도모하고 있다 본 논문에서는 이런 전력 IT 의 일환으로 개발된 지능형 전력 정보 모니터링 시스템 (K-WAMS)을 소개하고자 한다. 이 시스템은 이기종 분산 환경에서 전력 정보를 실시간으로 전송 받아 현재 전력계통의 상황을 직관적으로 판단할 수 있는 정보를 제공하여 광역 정전을 예방하고자 하는 조기경보시스템 (Early Warning System) 이다. 또한, 전력계통의 안정성 여부를 판단하는 지능형 에이전트의 구현을 통해 광역 정전을 예견하는 지수를 제공하고, 실시간 데이터 처리 및 이력 데이터 저장 에이전트들을 통해 현재 취득되고 있는 현장 데이터 모니터링 기능을 제공한다. K-WAMS 는 실시간으로 전송 처리되는 고속 대용량 데이터들의 처리 지연, 동적 환경으로 인한 네트워크의 부하문제를 해결하기 위해서 IPC Shared Memory 기법을 이용하였고, 동적 프로세스들의 작업 스케줄링을 관리하기 위한 IPC Message Queue 기법을 이용하였다. 또한 논리적 기능 기반으로 설계된 현재 중앙 급전소(GCC) 단위의 설계 모델은 향후 지역 급전소(RCC) 단위로 설치 될 경우 재사용 되어 개발 생산성을 향상시킬 것으로 예상된다.

• ETRI Journal
• /
• v.26 no.4
• /
• pp.321-331
• /
• 2004

In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low-level scheduler in the optical network unit (ONU) and a high-level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi-point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah "Ethernet in the first mile" (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.5
• /
• pp.157-163
• /
• 2016

This paper presents Finger Keyboard which detects the user's key types on a keyboard drawn on the paper using a video camera. The Finger Keyboard software was written in standard C/C++ language and thus easy to port to other computing environments. We installed a popular USB-type web camera on a Windows PC and implemented the Finger Keyboard as a Windows application which detects key typing and then injects the key code into the message queue of the Windows operating system. Also we implemented the Finger Keyboard on the Raspberry Pi 2 embedded computer with a dedicated camera and connected it to the Android device as an external keyboard through the Bluetooth. The result of experiments showed that the average ratio of recognition success is around 80% at the typing speed of 120 characters per minute.

• International Journal of Internet, Broadcasting and Communication
• /
• v.8 no.1
• /
• pp.33-41
• /
• 2016

Big data management is becoming an increasingly important issue in both industry and academia of information science community today. One of the important categories of big data generated from software systems is log data. Log data is generally used for better services in various service providers and can also be used to improve system reliability. In this paper, we propose a novel big data management architecture specialized for log data. The proposed architecture provides a scalable log management system that consists of client and server side modules for efficient handling of log data. To support large and simultaneous log data from multiple clients, we adopt the Hadoop infrastructure in the server-side file system for storing and managing log data efficiently. We implement the proposed architecture to support various client environments and validate the efficiency through measurement studies. The results show that the proposed architecture performs better than the existing logging architecture by 42.8% on average. All components of the proposed architecture are implemented based on open source software and the developed prototypes are now publicly available.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1332-1338
• /
• 2015

Recently, growing attention has been paid to multi-GPU rendering to support real-time high-quality rendering at high resolution. In order to attain high performance in real-time multi-GPU rendering, great care needs to be taken to reduce the overhead of data transfer among GPUs and frame composition. This paper presents a novel multi-GPU algorithm that greatly enhances split frame rendering with implicit query-based synchronization. In order to support implicit synchronization in frame composition, we further present a message queue-based scheduling algorithm. We carried out an experiment to evaluate our algorithm, and found that our algorithm improved rendering performance up to 200% more than previously existing algorithms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.670-675
• /
• 1994

Yhis paper describes a fault diagnosis simulation of the Real-Time Multiple Fault Dignosis System (RTMFDS) for forcasting faults in a system and deciding current machine state from signal information. Comparing with other diagnosis system for single fault,the system developed deals with multiple fault diagnosis,comprising two main parts. One is a remotesignal generating and transimission terminal and the other is a host system for fault diagnosis. Signal generator generate the random fault signal and the image information, and send this information to host. Host consists of various modules and agents such as Signal Processing Module(SPM) for sinal preprocessing, Performence Monotoring Module(PMM) for subsystem performance monitoring, Trigger Module(TM) for multi-triggering subsystem fault diagnosis, Subsystem Fault Diagnosis Agent(SFDA) for receiving trigger signal, formulating subsystem fault D\ulcornerB and initiating diagnosis, Fault Diagnosis Module(FDM) for simulating component fault with Hierarchical Artificial Neural Network (HANN), numerical models and Hofield network,Result Agent(RA) for receiving simulation result and sending to Treatment solver and Graphic Agent(GA). Each agent represents a separate process in UNIX operating system, information exchange and cooperation between agents was doen by IPC(Inter Process Communication : message queue, semaphore, signal, pipe). Numerical models are used to deseribe structure, function and behavior of total system, subsystems and their components. Hierarchical data structure for diagnosing the fault system is implemented by HANN. Signal generation and transmittion was performed on PC. As a host, SUN workstation with X-Windows(Motif)is used for graphic representation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.973-986
• /
• 1999

In this paper, we propose MAC protocol that consists of channel access mechanism and transmission mechanism to support effective wireless packet data service. In channel access mechanism, broadcast channel announces status information of random access channel, and mobile station tries random access based on status information. Also, mobile station has access probability to prevent collision increase due to transmission of short message. For effective transmission, mobile station changes transmission rate based on transmission queue status to adapt burst traffic characteristics. In restricted environments of transmission code and bandwidth, proposed protocol shows better performance than cdma2000 system.