• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.1-14
• /
• 2006

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

• Journal of Korea Game Society
• /
• v.13 no.2
• /
• pp.39-48
• /
• 2013

In MMORPGs(Massively Multi-player Online Role-Playing Games) a large number of players actively interact with one another in a virtual world. Therefore MMORGs must be able to quickly process real-time access requests and process requests from numerous gaming users. A key challenge is that the workload of the game server increases as the number of gaming users increases. To address this workload problem, many developers apply with distributed server architectures which use dynamic map partitioning and load balancing according to the server function. Therefore most MMORPG servers partition a virtual world into zones and each zone runs on multiple game servers. These methods cause of players frequently move between game servers, which imposes high overhead for data updates. In this paper, we propose a new architecture that apply with an arithmetic server dedicated to data operation. This architecture enables the existing game servers to process more access and job requests by reducing the load. Through mathematical modeling and experimental results, we show that our scheme yields higher efficiency than the existing ones.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.525-533
• /
• 2009

Staging technique is used to provide files for a job in the Grid. If a staged file has large volume, the start time of the job is delayed and the throughput of job in the Grid may decrease. Therefore, removal of staging overhead helps the Grid operate more efficiently. In this paper, we present two methods for efficient file provisioning to clear the overhead. First, we propose RA-RFT, which extends RFT of Globus Toolkit and enables it to utilize RLS with replica information. RA-RFT can reduce file transfer time by doing partial transfer for each replica in parallel. Second, we suggest Remote Link that uses remote I/O instead of file transfer. Remote link is able to save storage of computational nodes and enables fast file provisioning via prefetching. Through various experiments, we argue that our two methods have an advantage over existing staging techniques.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.6
• /
• pp.107-117
• /
• 2020

With the recent development of autonomous vehicles, various sensors installed in vehicles have become common, and big data generated from those sensors is increasingly being used in the transportation field. In this study, we proposed a grid index method to efficiently process real-time vehicle sensing big data and public data such as road weather. The applicability and effect of the proposed grid space division method and grid ID generation method were analyzed. We created virtual data based on DTG data and mapped to the road link based on coordinates. As a result of analyzing the data processing speed in grid index method, the data processing performance improved by more than 2,400 times compared to the existing link unit processing method. In addition, in order to analyze the efficiency of the proposed technology, the virtually generated data was mapped and visualized.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.651-665
• /
• 2003

To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.4
• /
• pp.83-88
• /
• 2016

The use of consistent coastlines is an important element for the systematic management of maritime boundaries and the interests of local governments. The Hydrographic and Oceanographic Agency conducted a preliminary survey for consistent coastline production, since 2001. As a result, the length of coastline was different by year. Because of the lack of systematic management, the use of incorrect data, etc. We also changed the coastline on the sea chart to show on a digital map for realization of terrain expression method. However, there was a variation in shoreline length due to various surveying techniques and shoreline extraction methods. In this paper, the characteristics of Jeju-do coastline were analysed by using a modified divider method of fractal dimension. The accuracy of the vectorization was determined by converting the actual distance in the Public Survey Amendment for proper divider use. With 1:5,000 and 1:25,000 digital maps of Jeju-si and Seogwipo-si each fractal dimensions were calculated. Jeju-si=1.14 and Seogwipo-si=1.12 in 1: 5,000. Jeju-si=1.13 and Seogwipo-si=1.10 in 1: 25,000. Calculated fractal dimension were correlated to data from digital maps. It was considered that complexity and scale of coastlines affected. In the future coastline length statistics and minimum ratio of calculated coastline length to original length need to be determined for consistency of coastline length statistics.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.527-536
• /
• 2007

This paper proposes a 3D fashion design system that generates a 3D clothes model by using 2D patterns of clothes and drapes the 3D clothes model on a 3D human model. In the proposed system, 2D patterns of clothes are designed by selecting comer points of 2D mesh. After designing 2D patterns, a 3D clothes model is designed by describing the control points to be connected between 2D patterns. The proposed system reads a 3D human body model file and the designed 3D clothes model and creates a 3D human model putting on the clothes by using the mass-spring model based physical simulation. It calculates collision and reaction between the triangles of human body model and those of clothes for realistic simulation. Because the number of triangles is very large, the collision and reaction processing need a lot of time. To solve this problem, the proposed system decreases the number of collision and reaction processing by using the Octree space subdivision technique. It took a few seconds for generating a 3D human model putting on the designed 3D clothes.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1367-1383
• /
• 2007

A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.2
• /
• pp.93-98
• /
• 2013

Multi-temporal high resolution satellite images are essential data for efficient city analysis and monitoring. Yet even when acquired from the same location, identical sensors as well as different sensors, these multi-temporal images have a geometric inconsistency. Matching points between images, therefore, must be extracted to match the images. With images of an urban area, however, it is difficult to extract matching points accurately because buildings, trees, bridges, and other artificial objects cause shadows over a wide area, which have different intensities and directions in multi-temporal images. In this study, we analyze a shadow effect on image matching of high resolution satellite images in urban area using Scale-Invariant Feature Transform(SIFT), the representative matching points extraction method, and automatic shadow extraction method. The shadow segments are extracted using spatial and spectral attributes derived from the image segmentation. Also, we consider information of shadow adjacency with the building edge buffer. SIFT matching points extracted from shadow segments are eliminated from matching point pairs and then image matching is performed. Finally, we evaluate the quality of matching points and image matching results, visually and quantitatively, for the analysis of shadow effect on image matching of high resolution satellite image.

• Journal of Korea Water Resources Association
• /
• v.51 no.4
• /
• pp.301-311
• /
• 2018

Recently, the flood inundation caused by heavy rainfall in urban area is increasing due to global warming. The variability of climate change is described in the IPCC 5th report (2014). The precipitation pattern and hydrological system is varied by climate change. Since the heavy rainfall surpassed the design capacity of the pipeline, it caused great damage in metropolitan cities such as Seoul and Busan. Inundation in urban area is primarily caused by insufficient sewer capacity and surplus overflow of river. Inundation in urban area with concentrated population is more dangerous than rural and mountains areas, because it is accompanied by human casualties as well as socio-economic damage to recover destruction of roads, brides and underground spaces. In addition, various factors such as an increase in impervious area, a short time of concentration to outlet, and a shortage of sewer capacity's lack increase flooding damage. In this study, flood inundation analysis was conducted for vulnerable areas using XP-SWMM. Also, three structural flood prevention measures such as drainage pipeline construction, detention reservoir construction, and flood pumping station construction are applied as flood damage prevention alternatives. The flood data for each alternative were extracted by dividing the basin by grid. The Spatial Compromise Programming are applied using flood assessment criteria, such as maximum inundation depth, inundation time, and construction cost. The purpose of this study is to reflect the preference of alternatives according to geographical condition even in the same watershed and to select flood defense alternative considering regional characteristics.