• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.8
• /
• pp.372-378
• /
• 2001

오늘날, 이질적인 분산 컴퓨팅 환경을 통합하고 분산 공유 자원을 효율적으로 사용할 수 있는 공통 작업 환경에 대한 요구가 날로 높아지고 있다. 이러한 연구 중에서 주목받는 것 중 하나가 OMG의 CORBA이다. CORBA 시스템에서 실시간 멀티미디어 데이터들을 처리하기 위해 확장된 CORBA 표준을 RT(Real-Time) CORBA라고 한다. RT CORBA의 핵심은 수많은 실시간 태스크들의 블록을 최대한 방지하여 실시간 QoS를 보장해 줄 수 있는 실시간 스케쥴링 기법에 있다고 할 수 있다. 현재 RT CORBA를 위해 제안되는 많은 스케쥴링 기법들은 대개 이전의 단일 시스템에 기반한 전역 우선순위 기반 스케쥴링이 대부분이다. 하지만 이러한 Soft Real-Time 스케쥴링은 다양한 성능 요소가 산재하는 분산 시스템에서는 그 성능을 보장할 수 없다. 본 논문에서는 CORBA와 같은 분산시스템의 보편적 특성을 고려한 Hard Real-Time 스케쥴링 기법인 CII(Cut In Interval) 기법을 제안하였다. 기존의 전역 우선순위 바탕의 스케쥴링이 비효율적인 태스크 할당 및 지역 스케쥴링을 제공하지만, CII 기법의 스케쥴링은 간단하면서도 보다 효과적인 전역 스케쥴링을 제공할 수 있다. CII 기법의 핵심은 이미 스케쥴링된 태스크를 가능한 제한시간까지 연기하여 얻어진 여유시간을 다른 실시간 태스크들의 처리에 활용하자는 것이다. 이러한 여유시간의 활용은 제안한 기법이 기존의 기법과 달리 보다 능동적이고 효율적인 스케쥴링 기법임을 증명한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.109.6-109
• /
• 2001

This paper suggests a new industrial automation system architecture which adopts the Real-Time CORBA as a solution for the recently emerging problems, such as cost eciency, interoperability with different networks, software productivity, etc. This paper shows how the adoption of RT-CORBA helps end-users to improve software productivity in the heterogeneous distributed system integrate eldbus with different kinds of network easily and lower the cost of hardware medication and extension, Finally, CRECO - a real- time CORBA which is in development and suited to industrial automation system - is introduced. RT-Linux and Probus - two major components while implementing the CRECO - are dealt with primarily.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.52.4-52
• /
• 2001

In this paper we propose a framework of an open architectured manufacturing system base on CORBA middleware. The manufacturing system consists of four configurable software modules 9mchine control module, database module, monitoring module, and operation module). Each module is distributed through the network and integrated with CORBA middleware technology. CORBA Characteristics including independence from programming languages, computing platforms and networking protocols makes us to easily develop new applications and to effectively integrate new module into existing distributed systems. The CORBA program used in this study is The ACE ORB (TAO) developed by the laboratory in Washington University.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.251-254
• /
• 2001

대표적인 분산 객체 환경을 위한 프레임 웍으로 1990년대 초 OMG(Object Management Group)에서 발표한 CORBA(Common Object Request Broker Architecture)를 들 수 있다. 이것은 분산, 이기종 환경에서 객체기반 응용 프로그램들의 재사용성(reusability), 이식성, 상호 운용성(interoperability)을 위한 공통 프레임 ???p이다. 하지만 표준 CORBA는 실시간 응용 프로그램 지원을 위한 한계점을 내재하고 있으므로 이를 그대로 적용하기에는 적합하지 않다. 때문에 RT-SIG(Real-Time Interest Special Croup)에서는 실시간 어플리케이션을 지원하기 위한 일련의 작업이 이루어 졌고, 그 산물로는 TAO(The Ace Orb)와 NraD(US Navy Research and Development), lona 사의 Orbix ORB, Lockheed Martin 사에서 개발한 CORBA 등이 있다. 하지만 표준 CORBA 명세서에 따르면 COS(CORBA Object Service)중의 하나인 이벤트 서비스는 실시간 응용프로그램을 지원하기 위해 필요한 실시간 디스패칭과 스케줄링의 보장, 중앙 집중화된 이벤트 필터링과 상관성을 위한 명시, 주기적 처리 지원 등의 기능이 결여되어 있기 때문에 이를 지원하는 실시간 이벤트 서비스가 요구된다. 이러한 요구에 부합하기 위해 필요한 요구사항을 자바 API 형태로 구현하고 향후 성능에 대한 개선 방향을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1675-1689
• /
• 2000

We present CReMeS a CORBA-compliant design and implementation of a new real-time communication service. It provides for efficient predictable and scalable communication between information producers and consumers. The CReMeS architecture is based on MidART's Real-Time Channel-based Reflective Memory (RT-CRM) abstraction. This architecture supports the separation of QoS specification between producer and consumer of data and employs a user-level scheduling scheme for communicating real-time tasks. These help us achieve end-to-end predictability and allows our service to scale. The CReMeS architecture provides a CORBA interface to applications and demands no changes to the ORB layer and the language mapping layer. Thus it can run on non real-time Off-The-Shelf ORBs enables applications on these ORBs to have scalable and end-to-end predictable asynchronous communication facility. In addition an application designer can select whether to use an out-of-band channel or the ORB GIOP/IIOP for data communication. This permits a trade-off between performance predictability and reliability. Experimental results demonstrate that our architecture can achieve better performance and predictability than a real-time implementation of the CORBA Even Service when the out-of-band channel is employed for data communication it delivers better predictability with comparable performance when the ORB GIOP/IIOP is used.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.845-850
• /
• 2009

To support distributed environment that is independent and standardized between heterogeneous system, a study on the TAO(The ACE ORB) communication middleware based on the RT-CORBA is highly being done. The TAO supports real-time features not on the general purpose operating system like Windows or Linux but on the real time operating system like Vxworks or LynxOS. In this paper, we build and construct environment that supports a thread-level real time feature by porting the TAO on VxWorks target. Also we validate the ported TAO by network communication with the TAO of Windows.

• The KIPS Transactions:PartA
• /
• v.19A no.2
• /
• pp.101-112
• /
• 2012

In recently years, distributed real-time software has performed important roles in various areas. Real-time applications should be performed with satisfying strict constraints on response time. Usually real-time applications are developed on the real-time supporting middleware such as TMO(Time-triggered, Message-triggered Object), CORBA/RT, and RTAI. However, it is not easy to develop applications using them since these real-time middleware are unfamiliar to programmers. In this paper, we propose an automatic code generator for real-time application based on TMO in order to reduce development costs. For increasing or reflecting the characteristics of TMO into the design model, SpM and SvM methods are added into the class diagram, which have time constraints as their properties. And behaviors of them are represented as separated regions on state machine diagram in different abstract level. These diagrams are inputted into TMO-based code automatic generator, which generates details of the TMO class. Our approach has advantages for decreasing effort and time for making real time software by automatically generating TMO codes without detailed knowledge of TMO.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.