• ETRI Journal
• /
• v.25 no.5
• /
• pp.275-287
• /
• 2003

We present a high performance cache structure with a hardware prefetching mechanism that enhances exploitation of spatial and temporal locality. Temporal locality is exploited by selectively moving small blocks into the direct-mapped cache after monitoring their activity in the spatial buffer. Spatial locality is enhanced by intelligently prefetching a neighboring block when a spatial buffer hit occurs. We show that the prefetch operation is highly accurate: over 90% of all prefetches generated are for blocks that are subsequently accessed. Our results show that the system enables the cache size to be reduced by a factor of four to eight relative to a conventional direct-mapped cache while maintaining similar performance.

• Journal of Korean Association for Spatial Structures
• /
• v.18 no.1
• /
• pp.30-35
• /
• 2018

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.12
• /
• pp.8370-8377
• /
• 2015

In spatial data stream management systems, it is needed appropriate load shedding algorithm because real-time input spatial data streams could exceed the limitation of main memory. However previous researches, lack regard for input ratio and spatial utilization rates of spatial data streams, or the characteristics of data source which generates data streams with spatial information efficiently, can lead to decrease the performance and accuracy of spatial data stream query. Therefore, multi-level load shedding scheme for spatial data stream management systems is proposed to increase the spatial query performance and accuracy. This proposed scheme limits overloads in relation to the input rate and the characteristics of data source first, and then, if needed, query data representing low query participation probability based on spatial utilizations are dropped relatively. Our experiments show that the proposed method could decrease load shedding frequency for previous researches by more than 11% despite query results accuracy and query performance are superior at 0.04% and 3%.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.3-10
• /
• 2004

The earthquake-resistant structural systems have to ensure the sufficient stiffness and ductility for the stability. For those purposes, recently, the performance design concept to increase the degree of absorbed energy level of structures has been proposed. One practical way of the performance design in the spatial structures is to apply the isolation system to boundary parts of roof system and sub-structure to obtain the target performance. So, it is necessary to examine the characteristics of dynamic behavior of spatial structures governed by higher modes rather than lower modes different from the cases of high rise buildings. The objectives of this paper are to develop the equivalent lumped mass model to simplify the analytical processes and to investigate the dynamic behavior of roof system according to the mass and the stiffness of sub-structures as a fundamental study of performance design for the spatial structures.

• Journal of Korean Society for Quality Management
• /
• v.43 no.4
• /
• pp.521-532
• /
• 2015

Purpose: The purpose of this study is to compare two multivariate cumulative sum (MCUSUM) charts designed for spatio-temporal surveillance in terms of not only temporal detection performance but also spatial detection performance. Method: Experiments under various configurations are designed and performed to test two CUSUM charts, namely SMCUSUM and RMCUSUM. In addition to average run length(ARL), two measures of spatial identification accuracy are reported and compared. Results: The RMCUSUM chart provides higher level of spatial identification accuracy while two charts show comparable performance in terms of ARL. Conclusion: The RMCUSUM chart has more flexibility, robustness, and spatial identification accuracy when compared to those of the SMCUSUM chart. We recommend to use the RMCUSUM chart if control limit calibration is not an urgent task.

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.99-105
• /
• 2018

One of the spatial statistical analysis, hotspot analysis is one of easy method of see spatial patterns. It is based on the concept that "Adjacent ones are more relevant than those that are far away". However, in hotspot analysis is spatial adjacency must be considered, Therefore, distributed processing is not easy. In this paper, we proposed a distributed algorithm design for hotspot spatial analysis. Its performance was compared to standalone system and Hadoop, Spark based processing. As a result, it is compare to standalone system, Performance improvement rate of Hadoop at 625.89% and Spark at 870.14%. Furthermore, performance improvement rate is high at Spark processing than Hadoop at as more large data set.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.536-546
• /
• 2005

In this paper, we focus on the filtering step of candidate objects for spatial join operations on the input tables that none of the inputs is indexed. Over the last decade, several spatial Join algorithms for the input tables with index have been extensively studied. Those algorithms show excellent performance over most spatial data, while little research on solving the performance degradation in the presence of skewed data has been attempted. Therefore, we propose a spatial hash strip join(SHSJ) algorithm that can refine the problem of skewed data in the conventional spatial hash Join(SHJ) algorithm. The basic idea is similar to the conventional SHJ algorithm, but the differences are that bucket capacities are not limited while allocating data into buckets and SSSJ algorithm is applied to bucket join operations. Finally, as a result of experiment using Tiger/line data set, the performance of the spatial hash strip join operation was improved over existing SHJ algorithm and SSSJ algorithm.

• International Journal of High-Rise Buildings
• /
• v.6 no.2
• /
• pp.149-163
• /
• 2017

With the intensification of urban development in Chinese cities, mixed land use in urban centers extends vertically into 3-D and expands its scale from a single building to commercial clusters. The multi-level pedestrian system in city centers also changed its role from one of traffic isolation to spatial integration, where transit nodes, street sidewalks, squares, building entrances, atriums, and corridors are interconnected, both horizontally and vertically, into a whole spatial system, within which pedestrian flows are guided and shopping facilities are arranged. This paper uses spatial configuration analysis of space syntax to examine the impacts of spatial patterns on movement distribution and the business performance of tenant mix in the multi-level commercial system of the Nanshan Commercial Cultural District in Shenzhen, China. The key objective is to better understand the interactions between the socio-economic variables and spatial design parameters of a shopping complex. The research findings point to the importance of multiplicity between syntactic variables and other spatial variables in influencing the pedestrian flows, business performance and tenant mix in highly complex commercial systems. Particularly noteworthy is the relationship between spatial accessibility measures and the location of escalators, and the ways in which individual commercial buildings are embedded into the overall spatial system. The study suggests that this may lead to the preliminary identification of the spatial qualities of effective vertical extensions of mixed land use in a high-density urban settings.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.352-361
• /
• 2004

Spatial joins find all pairs of spatial objects that satisfy a given spatial relationship. In this paper, we propose the transformation-based spatial partition join algorithm (TSPJ), a new spatial join algorithm that performs join in the transform space without using indexes. Since the existing algorithms deal with extents of spatial objects in the original space, they either need to replicate the spatial objects or have a relatively complex partition structure-resulting in degrading performance. In contrast, TSPJ transforms objects in the original space into points in the transform space and deals only with points having no extents. The transformation does not incur any additional overhead. Thus, our algorithm has advantages over existing ones in that it obviates the need for replicating spatial objects, and its partition structure is simple. As a result, it always has better performance compared with existing algorithms. Extensive experiments show that TSPJ improves performance by 20.5∼38.0% over the existing algorithms compared.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.8
• /
• pp.181-188
• /
• 2016

Recently, as the amount of spatial information increases, an interest in the study of spatial information processing has been increased. Spatial database systems extended from the traditional relational database systems are difficult to handle large data sets because of the scalability. SpatialHadoop extended from Hadoop system has a low performance, because spatial computations in SpationHadoop require a lot of write operations of intermediate results to the disk, resulting in the performance degradation. In this paper, Spatial Computation Spark(SC-Spark) is proposed, which is an in-memory based distributed processing framework. SC-Spark is extended from Spark in order to efficiently perform the spatial operation for large-scale data. In addition, SC-Spark based on the GPGPU is developed to improve the performance of the SC-Spark. SC-Spark uses the advantage of the Spark holding intermediate results in the memory. And GPGPU-based SC-Spark can perform spatial operations in parallel using a plurality of processing elements of an GPU. To verify the proposed work, experiments on a single AMD system were performed using SC-Spark and GPGPU-based SC-Spark for Point-in-Polygon and spatial join operation. The experimental results showed that the performance of SC-Spark and GPGPU-based SC-Spark were up-to 8 times faster than SpatialHadoop.