• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.41-48
• /
• 2012

A Vehicular Ad-hoc Network (VANET) is a vehicular specific type of a mobile ad-hoc network, to provide temporary communications among nearby vehicles. Mobile node of VANET consumes energy and resource with participating in the member of network. In a VANET, data replication and cooperative caching have been used as promising solutions to improve system performance. Existing cooperative caching scheme in a VANET mostly focuses on weak consistency is not always satisfactory. In this paper, we propose an efficient cache management scheme to maintain strong data consistency in a VANET. We make an adaptive scheduling scheme to broadcast Invalidation Report (IR) in order to reduce query delay and communication overhead to maintain strong data consistency. The simulation result shows that our proposed method has a strength in terms of query delay and communication overhead.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.173-178
• /
• 2014

Smart devices linked to high speed networks enable us to obtain location dependent data at anywhere and anytime. In this environment, a wireless data broadcast system can deal with enormous data request from a great number of clients effectively. In order to set up an efficient wireless data broadcast system, various data scheduling and indexing schemes have been proposed. However, a simulation framework to evaluate the schemes is not reported yet. In this paper, we design and develop a simulation framework for a wireless data broadcast system. The developed simulation framework can evaluate quickly a wireless data broadcast system and has scalability to adopt various data scheduling and indexing schemes for wireless data broadcasting.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1110-1112
• /
• 2013

본 논문에서는 무선방송 환경을 기반으로 한 서버가 클라이언트에게 데이터를 전송할 때 클라이언트의 질의처리 시간을 줄일 수 있는 방안을 제안한다. 서버는 무선방송을 통해 공간 데이터를 클라이언트에게 전송한다. 데이터 스케줄링 관리의 목적은 서버의 데이터 전송 순서를 효과적으로 배치하여 클라이언트의 질의처리시간을 줄이기 위함이다. 본 논문에서 서버는 클라이언트에게 위치기반 서비스를 제공하기 위하여 영역별 클라이언트의 수에 따라 hot-cold기법을 접목시킨 Number of Clients number Hot-Cold(NCHC)를 제안한다. NCHC의 장점은 클라이언트의 분포에 따라 데이터(객체)를 분류하기 때문에 클라이언트들의 평균 질의처리 시간을 줄일 수 있다.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.147-158
• /
• 1996

This paper proposed a concurrency control structure based on specialized data flow graphs that was analysed a run-time concurrency control activity to be integrated with the task scheduler Data were viewed as flowing on the arcs from one node to another in a stream of discrete to tokens. The network that Is based upon the Entity-Relationship model, can be viewed a fixed problems used query tokens as a data flow graph. The performance was measured used in the various expriments compared the overall performance of the different concurrency control methods, DBFG (DataBase Flow graphs) scheduling had the knowledge to obtain better performance than 2PL in a distributed environment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.635-642
• /
• 2003

Reinforcement learning got successful results in a lot of applications such as control and scheduling. Various function approximation methods have been studied in order to improve the learning speed and to solve the shortage of storage in the standard reinforcement learning algorithm of Q-Learning. Most function approximation methods remove some special quality of reinforcement learning and need prior knowledge and preprocessing. Fuzzy Q-Learning needs preprocessing to define fuzzy variables and Local Weighted Regression uses training examples. In this paper, we propose a function approximation method, Fuzzy Q-Map that is based on on-line fuzzy clustering. Fuzzy Q-Map classifies a query state and predicts a suitable action according to the membership degree. We applied the Fuzzy Q-Map, CMAC and LWR to the mountain car problem. Fuzzy Q-Map reached the optimal prediction rate faster than CMAC and the lower prediction rate was seen than LWR that uses training example.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1724-1737
• /
• 1999

Multimedia data service applications have to store and manipulate LOBs(unstructured large objects) composing multimedia data. As such, the tertiary storage devices such as an optical disk jukebox and a tape library that consist of a number of platters (the disks in case of an optical disk jukebox and the cartridge tapes in case of a tape library) have been considered essential for the storage system of a DBMS in order to efficiently support storage and management of vary large volume of data. Since the latency with tertiary storage is too long, the schemes for efficient retrieval of LOBs out of tertiary storage need to be investigated. In this paper, we investigated the tertiary I/O Considering the performance characteristics of the LOBs, we proposed various I/O scheduling heuristic algorithms that reduce latency in query processing with LOB retrieval from tertiary storage, and evaluated their performance through a detailed simulation.

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

최근 데이터 스트림을 관리하기 위해 DSMS(Data Stream Management System)가 계속적으로 연구 되고 있다. 하지만 데이터 스트림은 방대한 양의 데이터를 처리하기 위하여 실시간성을 갖는 빠른 데이터 처리가 요구되며, 이러한 특성 때문에 데이터 처리의 효율성 증대를 위하여 메모리 관리가 중요하다. 기존 메모리 관리에 대한 연구는 쓰레드 스케줄링을 통한 관리 기법이 연구되었다. 하지만 기존의 연산자 쓰레드 스케줄링과 그래프 쓰레드 스케줄링은 쓰레드 관리의 유연성이 떨어지기 때문에 불규칙적인 데이터 스트림 환경에서는 부적합하다. 또한 하이브리드 멀티 쓰레드 스케줄링 기법은 두 가지 기법의 장점을 결합하였으나 가상 연산자의 일회성 사용으로 쓰레드 관리의 어려움 이 있다. 따라서 본 논문은 공유와 재사용이 가능한 링 연산자를 이용한 링 연산자 쓰레드 스케줄 링 기법을 제안한다. 본 기법은 링 연산자를 통해 새로 입력된 질의의 동일한 연산자 구성은 생성 되어 있는 링 연산자를 공유하거나 재사용하여 불필요한 자원 소모와 자원 할당의 과부하를 줄임으로써 기존 기법에 비해 쓰레드 할당의 수를 감소 시켜 대량의 질의 처리 시 속도를 증가 시켰다.