• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.6
• /
• pp.1101-1105
• /
• 2006

Ubiquitous computing network comprises a variety of distributed service devices. Today Web services technology enables the heterogeneous devices to provide their own services and interact with each other via well-defined Internet protocol. Nevertheless, service devices in ubiquitous environments require more event-driven, autonomous interaction beyond rather passive service-oriented architecture of the present time. This paper presents an ECA (Event-Condition-Action) rule description language in an attempt to support capability for autonomous interactions among service-oriented devices in ubiquitous computing network. Specifically, the proposed WS-ECA is an XML-based ECA rule description language for web service-enabled devices. The rules are embedded in distributed devices which invoke appropriate services in the network if the rules are triggered by some internal or external events. The presented ECA-based device coordination approach is expected to facilitate seamless inter-operation among the web service-enabled devices in the emerging ubiquitous computing environment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.5789-5794
• /
• 2015

Recently, thin and light-weight production technologies are needed in IT industry in accordance with increase of the smart phones and mobile PC products. In order to make light and high rigidity products, engineering plastic and aluminum materials are frequently used in products appearance and frame hat support structure. Especially aluminum extrusion and CNC Brick processes are widely used for high strength and high rigidity technology. But extrusion method has constraints to apply exterior design and CNC Brick process has relatively high production cost and low speed of manufacturing. In this research, a new process method is introduced in order to reduce material cost and to improve manufacturing speed dramatically. Plate forging process means basically that thickening of local wall area thickness after deform exterior shape by deep drawing and bending process. Therefore, it is possible to minimize the waste of material and the manufacturing time. In this study the process of plate forging is designed using finite element program AFDEX-2D and the thickness and the width of initial deformed blank. And it is verified as a sample which is a part of laptop developed through the proposed plate forging method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1206-1216
• /
• 1999

이동 호스트란 시간과 공간의 제약 없이 필요한 기능을 수행하고, 또한 원하는 정보에 접근할 수 있는 휴대용 컴퓨터를 일컫는다. 이동 컴퓨팅 환경이란 이러한 이동 호스트들을 지원할 수 있도록 구성된 분산 환경이다. 따라서 이동 컴퓨팅 환경에서의 분산 알고리즘은 정적 호스트만을 고려한 기존의 분산 환경에서와는 다르게 이동 호스트의 여러 가지 특성들을 고려하여 제안되어야 한다. 즉, 이동 컴퓨팅 환경의 도래로 인하여 이동성과 휴대성, 그리고 무선 통신과 같은 특성들을 고려한 새로운 분산 상호 배제 알고리즘이 필요하다. 이제까지 이동 컴퓨팅 환경에서의 상호 배제 알고리즘은 토큰 링 구조에 기반을 두고 설계되었다. 토큰 링 구조는 이동 호스트들의 위치를 유지하기 위하여 높은 비용을 필요로 하는 단점을 가지고 있다. 본 논문에서는 균형 높이 트리(height-balanced tree)라는 새로운 모형을 제안함으로써 정적 분산 환경과 이동 분산 환경이 혼합된 환경에서 상호 배제 비용을 감소시킬 수 있는 새로운 알고리즘을 제안하며, 각 경우에 있어서의 비용을 산출하고 평가한다.Abstract The mobile host is a potable computer that carries out necessary functions and has the ability to access desirable informations without any constraints in time and space. Mobile computing environment is a distributed environment that is organized to support such mobile hosts. In that environment, distributed algorithms of which environment not only with static hosts but with mobile host's several properties should be proposed. With the emergence of mobile computing environments, a new distributed mutual exclusion method should be required to consider properties mobile computing system such as mobility, portability, and wireless communication. Until now, distributed mutual exclusion methods for mobile computing environments are designed based on a token ring structure, which have the drawbacks of requiring high costs in order to locate mobile hosts. In this paper, we propose a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a height-balanced tree for static distributed networks and for networks with mobile hosts. We evaluated the operation costs in each case.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.119-127
• /
• 2002

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. However, the number of users supported and the response times for the requested services in video server are in the oppositional relationship with viewpoint of disk throughput. In this paper, we propose new policy that can provide not only rapid responses for the service requests but also increase the number of users supported in the storage system of video server. The policy admits the random movements of disk heads for urgent service requests but maintains the sequential or restricted movements of disk heads and eliminates rewind time of disk heads for less-urgent service requests in storage system of multiple disks environment so that it can not satisfy only the QoS of users but also support more users.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.449-458
• /
• 1999

In real-time systems, the accurate response time and minimal communication delay is highly desired. However, a conventional SNMP uses network resources inefficiently and introduces too much network traffic for periodic requests in particular. This paper presents an extended SNMP called Real-Time SNMP. It is designed to support real-time applications with time constraints to provide more accurate response time and less network traffic for periodic SNMP request PDU which is sent from a management station to agents. In addition, the module of the Real-Time SNMP agent works between management station and each SNMP agent to periodically generate requests for the associated agent. In this paper we have implemented the proposed Real-Time SNMP agent module and extended SNMP PDU. We also show the experimental results that indicated more punctual response time and reduced communication delay using the proposed Real-Time SNMP.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3652-3661
• /
• 1999

To support multimedia applications such as a multimedia communication systems and multimedia broadcasting, an operating system need to predict their timing-constraints. So, In this real-time systems, we must solve the priority inversion problem that may make the behavior of unpredictable systems and need a real-time server model that provides a better preemptability and minimizes a system overhead. In current real-time systems, the single thread server model, the worker model and the dynamic server model are being used for synchronization but they cannot propose an effective structure for managing shared resources. In this paper, the priority inheritance protocol is used to solve the priority inversion problem and the hybrid prioritized worker model is proposed, which can provide a more effective structure and a faster response time minimizing a system overhead. The hybrid prioritized worker model is to combine the static and the dynamic prioritized worker model, and have a better performance than other models in response time which is an important factor in a real-time system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.738-747
• /
• 1999

본 논문에서는 분산 실시간 시스템의 특징인 분산 처리 과정의 신뢰성을 지원하기 위한 동적 트랜잭션 처리 구조를 연구하였다. 실시간 분산 처리 환경에서 동적으로 발생하는 실시간 분산 트랜잭션 처리를 위하여 트랜잭션 내에 필수적인 3가지 언어적 특성들을 제시하였다. 첫째는 트랜잭션 내에 실시간 시스템의 가장 중요한 특징인 시간적인 제약 조건들을 정의 할 수 있는 방안을 제시하고, 둘째는 비동기적인 처리 성격을 지닌 실시간 특성을 고려한 비동기적 트랜잭션 처리 방법을 제시한다. 또한, 분산 처리 과정에서 발생되는 예외 사항들을 처리하기 위하여 긴급성을 고려한 다중레벨 우선순위 스케줄링 (Multi-Level Priotiry Scheduling)이라 부르는 트랜잭션 스케줄링 방안을 제시한다. 그리고, 제시한 실시간 분산 트랜잭션 처리 구조의 타당성 및 가능성을 입증하기 위한 실시간 트랜잭션 처리 과정을 시물레이션을 통하여 제시한 언어적 특성에 대한 고려 사항들을 보여준다.Abstract We propose a dynamic transaction processing model that supports a reliability for distributed real-time processing. For the dynamic processing in distributed real-time transaction systems, we suggest three features that are defined in programming language. First, we propose a specification model to explicitly define the time constraints, needs in real-time distributed processing. Second, we describe an asynchronous transaction processing mechanism based on the real-time characteristics. So, we suggest three communication primitives to support asynchronous transaction processing. Lastly, a scheduling policy based on urgent transaction is suggested to manage the exception occurred during the distributed processing. This scheduling policy is called multi-level priotiry scheduling (MPLS). Based on three features and scheduling policy, we describe a direction to manage a dynamic transaction processing in distributed real-time systems.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.2
• /
• pp.31-42
• /
• 2014

Debugger systems are necessary to apply dynamic program analysis when evaluating security properties of embedded system software. It may be possible to make the use of software-based debugger and/or DBI framework if target devices support general purpose operating systems, however, constraints on applicability as well as environmental transparency might be incurred thereby hindering overall analyzability. Analysis with JTAG (IEEE 1149.1) debugging devices can overcome these difficulties in that no change would be involved in terms of internal software environment. In that sense, JTAG API can facilitate to practically perform dynamic program analysis for evaluating security properties of target device software. In this paper, we introduce an implementation of JTAG API to enable analysis of ARM core based embedded systems. The API function set includes the categories of debugger and target device controls: debugging environment and operation. To verify API applicability, we also provide example analysis tool implementations: our JTAG API could be used to build kernel function fuzzing and live memory forensics modules.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1164-1183
• /
• 2019

The rapid development of cloud computing and high requirements of operators requires strong support from the underlying Data Center Networks. Therefore, the effectiveness of using resources in the data center networks becomes a point of concern for operators and material for research. In this paper, we discuss the online virtual-cluster provision problem for multiple tenants with an aim to decide when and where the virtual cluster should be placed in a data center network. Our objective is maximizing the total revenue for the data center networks under the constraints. In order to solve this problem, this paper divides it into two parts: online multi-tenancy scheduling and virtual cluster placement. The first part aims to determine the scheduling orders for the multiple tenants, and the second part aims to determine the locations of virtual machines. We first approach the problem by using the variational inequality model and discuss the existence of the optimal solution. After that, we prove that provisioning virtual clusters for a multi-tenant data center network that maximizes revenue is NP-hard. Due to the complexity of this problem, an efficient heuristic algorithm OMS (Online Multi-tenancy Scheduling) is proposed to solve the online multi-tenancy scheduling problem. We further explore the virtual cluster placement problem based on the OMS and propose a novel algorithm during the virtual machine placement. We evaluate our algorithms through a series of simulations, and the simulations results demonstrate that OMS can significantly increase the efficiency and total revenue for the data centers.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.138-145
• /
• 2018

In the field of optimization, many studies have been performed on various types of Vehicle Routing Problem (VRP) for a long time. A variety of models have been derived to extend the basic VRP model, to consider multiple truck terminal, multiple pickup and delivery, and time windows characteristics. A lot of research has been performed to find better solutions in a reasonable time for these models with heuristic approaches. In this paper, by considering realtime traffic characteristics in Map Navigation environment, we proposed a method to manage realistic optimal path allocation for the logistics trucks and cargoes, which are dispersed, in order to realize the realistic cargo mixing allowance and time constraint enforcement which were required as the most important points for an online logistics brokerage service company. Then we developed a prototype system that can support above functionality together with delivery status monitoring on Map Navigation environment. First, through Map Navigation system, we derived information such as navigation-based travel time required for logistics allocation scheduling based on multiple terminal multiple pickup and delivery models with time constraints. Especially, the travel time can be actually obtained by using the Map Navigation system by reflecting the road situation and traffic. Second, we made a mathematical model for optimal path allocation using the derived information, and solved it using an optimization solver. Third, we constructed the prototype system to provide the proposed method together with realtime logistics monitoring by arranging the allocation results in the Map Navigation environment.