• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1091-1110
• /
• 2016

Hybrid deployment under current cloud data centers is a combination of online and offline services, which improves the utilization of the cluster resources. However, the performance of the cluster is often affected by the online services in the hybrid deployment environment. To improve the response time of online service (e.g. search engine), an effective scheduling algorithm based on Storm is proposed. At the component level, the algorithm dispatches the component with more influence to the optimal performance node. Inside the component, a reasonable resource allocation strategy is used. By searching the compressed index first and then filtering the complete index, the execution speed of the component is improved with similar accuracy. Experiments show that our algorithm can guarantee search accuracy of 95.94%, while increasing the response speed by 68.03%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.119-124
• /
• 2007

인터넷 웹사이트의 급격한 증가와 함께 이용자도 증가하고 있으며, 이용 목적은 주로 자료검색과 조회서비스 이다. 조회 요청이 많을수록 질의의 증가를 야기하며, 데이터베이스 서버의 질의 분석(Parse), 질의 실행 계획(Query Execution Plan)을 과도하게 발생시킨다. 즉 데이터베이스 서버에서 처리하는 작업량의 과부하로 인하여 병목현상을 초래한다. 데이터베이스 서버의 조회를 위한 질의처리량을 감소시키는 작업이 필요하다. 그리고 조회 대상이 데이터는 웹사이트에서 자주 갱신되지 않거나, 데이터가 주기적으로 갱신되는 특징이 있다. 이 데이터를 대상으로 데이터베이스 캐쉬 엔진을 구성하면 데이터베이스 서버의 과부하률 해소 할 수 있다. 본 논문에서는 유사 질의 매칭 기반 데이터베이스 캐친 엔진을 설계하고 구현한다. 유사 질의 매칭 기반으로 하여 적중률을 높여 데이터베이스 병목현상을 해결하여, 검색서비스에 더욱 효과적일 것으로 사료되며, 웹사이트의 성능 향상을 기대한다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1609-1619
• /
• 2000

Workflow means the automation of a business process, in which documents, information or tasks are transferred among participants for business action according to a set of procedural rules, and workflow management system is a system which defines, creates and manages the execution of workflow running one or more workflow engines. In this research, necessity of standardizing current workflow systems is recognized, and problems such as interoperability of current systems, dynamic adaptation to changing business environment and lacking of assessment, management and auditing of business processes are analyzed so that the design and implementation of a workflow system is focused on to offer a solution to the problems. The system is designed and implemented to change dynamically on Run-Time the processes definition defined on Build-Time, and interoperability is enabled by developing workflow engine and related modules based on the WfMC specifications and APIs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.53-61
• /
• 1988

Games such as baseball, soccer are scheduled by a given game type such as tournament, league or their mixed form. The objective of this paper is to find an efficient game-scheduling method with respect to traveling distance, break-time and other conditions. In this paper we first present two models which minimize traveling distance. The first model that a match is played once each other is solved by a heuristic method. In the second model that a match is played more than once, teams are paired by a modified 0 - 1 programming, and the pairs are rearranged in order to generate a number of workable schedules. Then Expert Systems is applied to solve breake-time and other conditions. In order to represent expertise's knowledge effectively, we present a new design of knowledge-base and data-base, inference engine including many rules and meta-rules which controls the global system. In knowledge-base, binary relation among various attributes is used to ease not only knowledge acquisition but also system execution.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.581-584
• /
• 2006

퍼베이시브 컴퓨팅 환경을 실현하기 위해서는 작고 다양한 생활 용품에 장착할 수 있는 소규모 장치와 주변의 변화를 감지할 수 있는 센서 등을 사용한다. 이 소규모 장치들은 서로 다른 프로세서와 다양한 크기의 메모리를 가지고 있기 때문에 가상 기계 기술이 도입되어야 한다. 그러나 기존의 가상 기계들은 소규모 장치에 탑재하기에는 규모가 크기 때문에 퍼베이시브 컴퓨팅 환경에 적합한 소형 가상 기계의 실행 엔진이 필요하다. 본 논문에서는 임베디드 시스템을 위한 가상 기계인 EVM의 실행 엔진을 개선하여 퍼베이시브 컴퓨팅 환경에 적합한 실행 엔진을 설계 및 구현한다. 실행에 필요한 데이터를 줄이기 위해 SIL 명령어를 축약하고 불필요한 정보 및 객체지향 개념을 가진 명령어를 제거했다. 따라서 구현된 실행 엔진은 앞으로 구축될 퍼베이시브 컴퓨팅 환경을 위한 다양한 분야에 응용할 수 있다.

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

최근 컴퓨터관련 모든 분야에서 '실시간(Real-Tine)' 기술이 각광을 받고 있으며 그에 따라 각 분야에 따른 요구사항에 맞춰 변형되어 연구, 응용되고 있다. 그 중에서도 운영체제 레벨에서 실시간 프로세스를 지원할 수 있는 실시간 어플리케이션 분야 연구가 활발해지고 있다. 이러한 실시간 어플리케이션 분야에서 디자인 효율성과 시스템 신뢰도를 높이기 위해 일반화된 형태의 디자인 스타일과 디자인 단계 적시성 서비스 기능 보장 등의 실시간 컴퓨팅 패러다임을 실현하기 위한 연구가 주목받고 있다. 이에 따라 본 논문에서는 최근 인기가 급증하고 있는 LINUX 시스템에서 일반화된 형태의 디자인 스타일을 지원하고 디자인 단계 적시성 서비스를 보장하는 실시간 객체 모델로서 뛰어난 TMO 모델의 실행 엔진을 개발하는 연구에 대해 소개한다.

• The Journal of Korea Robotics Society
• /
• v.17 no.2
• /
• pp.118-123
• /
• 2022

We implemented a real-time cloud robotics application by offloading robot navigation engine over to 5G Mobile Edge Computing (MEC) sever. We also ran a fleet management system (FMS) in the server and controlled the movements of multiple robots at the same time. The mobile robots under the test were connected to the server through 5G SA network. Public 5G network, which is already commercialized, has been temporarily modified to support this validation by the network operator. Robot engines are containerized based on micro-service architecture and have been deployed using Kubernetes - a container orchestration tool. We successfully demonstrated that mobile robots are able to avoid obstacles in real-time when the engines are remotely running in 5G MEC server. Test results are compared with 5G Public Cloud and 4G (LTE) Public Cloud as well.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.623-631
• /
• 2014

Comparison of two representative deduplication file systems, LessFS and SDFS, shows that Lessfs is better in execution time and CPU utilization while SDFS is better in storage usage (around 1/8 less than general file systems). In this paper, a new system is proposed where the advantages of SDFS and Lessfs are combined. The new system uses multiple DFEs and one DSE to maintain the integrity and consistency of the data. An evaluation study to compare between Single DFE and Dual DFE indicates that the Dual DFE was better than the Single DFE. The Dual DFE reduced the CPU usage and provided fast deduplication time. This reveals that proposed system can be used to solve the problem of an increase in large data storage and power consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.314-322
• /
• 2007

This paper proposes a new optimization algorithm named by GBNSGA(Goal-Pareto Based Non-dominated Sorting Genetic Algorithm) which determines the best configuration for CR(Cognitive Radio) communication systems. Conventionally, in order to select the proper radio configuration, genetic algorithm has been introduced so as to alleviate computational burden along the execution of the cognition cycle proposed by Mitola. This paper proposes a novel optimization algorithm designated as GBNSGA for cognitive engine which can be described as a hybrid algorithm combining well-known Pareto-based NSGA(Non-dominated Sorting Genetic Algorithm) as well as GP(Goal Programming). By conducting computer simulations, it will be verified that the proposed method not only satisfies the user's service requirements in the form of goals. It reveals the fast optimization capability and more various solutions rather than conventional NSGA or weighted-sum approach.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.1-9
• /
• 2010

Today's growth of the mobile communication infrastructure made mobile computing systems like cellular phones came next to or surpassed the desktop PCs in popularity due to their mobility. Although the performance of mobile devices is now being improved continuously, it is a current common sense that compute intensive large-scale applications can hardly run on any kind of mobile handset devices. To clear up this problem, we decided to exploit the mobile cluster computing system and surveyed the existing ones first. We found out, however, that most of them are not the actual implementations but a mobile cluster infrastructure proposal or idea suggestions for reliable mobile clustering. To make cell phones participated in cluster computing nodes, in this paper, we propose a redesigned JPVM cluster computing engine and a set of WIPI mobile runtime functions interfacing with it. And we also show the performance evaluation results of real parallel applications running on our Mobile-JPVM cluster computing systems. We find out by the performance evaluation that large-scale applications can sufficiently run on mobile devices such as cellular phones when using our mobile cluster computing engine.