• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.827-834
• /
• 2006

In distributed virtual environment, system response time to users' interactions is an importance factor to determine the degree of contentment with the system. Generally, response time is affected by the efficiency of event message processing algorithm, and most of previous systems use FCFS algorithm, which processes message traffic sequentially based only on the event occurrence time. Since this method totally depends on the order of occurrence without considering the priorities of events, it has a problem that might drop the degree of system response time by causing to delay processing message traffic when a bottleneck phenomenon happens in the server side. To overcome this limitation of FCFS algorithm, this paper proposes a concurrent event scheduling algorithm, which is able to process event messages concurrently by assigning the priorities to the events. It is also able to satisfy the two goals of system together, consistency and responsiveness through the combination of occurrence time with priority concept of events.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.412-414
• /
• 1998

대규모의 분산 응용시스템은 일반적으로 다수의 구성요소로 이루어져 있으며, 그 구성요소간의 상호작용을 위해 필요한 이벤트의 전달 구조가 다소 복잡한 특성을 지닌다. 이러한 이벤트의 다중처리 문제는 나이도가 높은 구현기법 중 하나이므로, 보다 안정적인 분산 응용시스템을 효율적으로 개발하기 위해서는 이벤트의 다중처리를 위한 기반 시스템을 제작, 지원하는 것이 바람직하다. 본 논문에서는 Java에서 분산객체개념을 도입한 JavaRmi환경에서 이벤트의 체계적인 다중처리를 위한 서비스를 설계함으로써, Java개발자가 보다 안정적이고 효율적인 방법으로 분산응용시스템을 구축할 수 있도록 지원하기 위한 방법을 제안하고자 하였다. 본 논문에서는 제안한 JavaRmi이벤트 서비스 시스템은 JavaRmi를 기반으로 하여, JavaRmi시스템이 지닌 효율성과 대중성의 잇점을 충분히 활용할 수 있도록 설계되었다. 이러한 기본적인 잇점 이외에도 이벤트 서비스의 설계에 있어서 직관적인 인터페이스, 그룹별 이벤트 서비스의 생성과 관리 기능. 병행성과 동기화 도구 등의 기능을 추가하여, 분산 응용시스템의 개발시 자주 요구되는 이벤트 처리를 위한 Java 개발자의 노력을 최소화할 수 있도록 지원하고자 하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1130-1133
• /
• 2008

데이터 중심 발간-구독 방식의 DDS 에서 특정 시간 및 일정 시간 간격으로 발생하는 이벤트를 처리하기 위한 타이머 모델을 쓰레드풀 기반으로 구현하였으며, 기존 병행처리 모델과 문제점을 제시하고, 제안한 모델의 구조 및 동작 방식에 대하여 제시하였다. 타이머 서비스를 지원하기 위해 사용된 각 클래스의 기능 및 구현을 통해서 연성 실시간 이벤트 처리가 가능한 타이머 모델을 어떻게 구현하였는지 제시한다.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.111-122
• /
• 2003

Military wargame simulation models must support the HLA in order to facilitate interoperability with other simulations, and using parallel simulation engines offer efficiency in reducing system overhead generated by propelling interoperability. However, legacy military simulation model engines process events using sequential event-driven method. This is due to problems generated by parallel processing such as synchronous reference to global data domains. Additionally. using legacy simulation platforms result in insufficient utilization of multiple CPUs even if a multiple CPU system is under use. Therefore, in this paper, we propose conversing the simulation engine to an object model-based parallel simulation engine to ensure military wargame model's improved system processing capability, synchronous reference to global data domains, external simulation time processing, and the sequence of parallel-processed events during a crash recovery. The converted parallel simulation engine is designed and implemented to enable parallel execution on a multiple CPU system (SMP).

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.166-178
• /
• 2007

The ALE specification of EPCglobal is leading the development of RFID standards, includes the Event Cycle Specification (ECSpec) describing how long a cycle is, how to filter RFID tag data and which reader is interested in. The ECSpec is a specification for filtering and collecting RFID tag data. It is registered to a middleware for long time and is evaluated to return results satisfying the requirements included in it. Thus, it is quite similar to the continuous query. It can be transformed into a continuous query as its predicate in WHERE clause is characterized by the long interval. Long intervals cause problems deteriorating insertion and search performance of existing query indices. In this paper, we propose a TLC-index as a new query index structure for long interval data. The TLC-index has hybrid structure that uses the cell construct of CQI-index with the virtual construct of VCR-index for partitioning long intervals. The TLC-index can reduce the storage cost and improve the insertion performance through decomposing long intervals into one or more cell constructs that have long size. It can also improve the search performance through decomposing short intervals into one or more virtual constructs that have short size enough to fit into those intervals.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.85-97
• /
• 2011

Wireless sensor networks have emerged as one of the key enabling technologies for ubiquitous computing since wireless intelligent sensor nodes connected by short range communication media serve as a smart intermediary between physical objects and people in ubiquitous computing environment. We recognize the wireless sensor network as a massively distributed and deeply embedded system. Such systems require concurrent and asynchronous event handling as a distributed system and resource-consciousness as an embedded system. Since the operating environment and architecture of wireless sensor networks, with the seemingly conflicting requirements, poses unique design challenges and constraints to developers, we propose a very new operating system for sensor nodes based on finite state machine. In this paper, we clarify the design goals reflected from the characteristics of sensor networks, and then present the heart of the design and implementation of a compact and efficient state-driven operating system, SenOS. We describe how SenOS can operate in an extremely resource constrained sensor node while providing the required reactivity and dynamic reconfigurability with low update cost. We also compare our experimental results after executing some benchmark programs on SenOS with those on TinyOS.