• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.101-110
• /
• 2006

One of the most effective ways to improve cache performance is to exploit both temporal and spatial locality given by any program executional characteristics. This paper proposes a data cache with small space for low power but high performance on multimedia applications. The basic architecture is a split-cache consisting of a direct-mapped cache with small block sire and a fully-associative buffer with large block size. To overcome the disadvantage of small cache space, two mechanisms are enhanced by considering operational behaviors of multimedia applications: an adaptive multi-block prefetching to initiate various fetch sizes and an efficient block filtering to remove rarely reused data. The simulations on MediaBench show that the proposed 5KB-cache can provide equivalent performance and reduce energy consumption up to 40% as compared with 16KB 4-way set associative cache.

• Journal of Computing Science and Engineering
• /
• v.11 no.2
• /
• pp.69-77
• /
• 2017

Recent GPUs have adopted cache memory to benefit general-purpose GPU (GPGPU) programs. However, unlike CPU programs, GPGPU programs typically have considerably less temporal/spatial locality. Moreover, the L1 data cache is used by many threads that access a data size typically considerably larger than the L1 cache, making it critical to bypass L1 data cache intelligently to enhance GPU cache performance. In this paper, we examine GPU cache access behavior and propose a simple hardware-based GPU cache bypassing method that can be applied to GPU applications without recompiling programs. Moreover, we introduce a hybrid method that integrates static profiling information and hardware-based bypassing to further enhance performance. Our experimental results reveal that hardware-based cache bypassing can boost performance for most benchmarks, and the hybrid method can achieve performance comparable to state-of-the-art compiler-based bypassing with considerably less profiling cost.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.571-574
• /
• 2005

In this paper, we propose an efficient image segmentation technique for large-sized monochrome images using a hybrid approach which combines threshold and region-based techniques. First, an image is partitioned into fixed-size blocks and for each block the representative intensity is determined by averaging pixel intensities within the block. Next, the neighborhood blocks that have similar characteristics with respect to a specific threshold are merged in order to form candidate regions. Finally, those candidate regions are refined to get final target object regions by merging regions considering the spatial locality and certain criteria. We have performed experiments on images selected from various domains and showed that our technique was able to extract target object regions appropriately from most images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4098-4116
• /
• 2020

Mobile devices such as smartphones are very attractive targets for augmented reality (AR) services, but their limited resources make it difficult to increase the number of objects to be recognized. When the recognition process is scaled to a large number of objects, it typically requires significant computation time and memory. Therefore, most large-scale mobile AR systems rely on a server to outsource recognition process to a high-performance PC, but this limits the scenarios available in the AR services. As a part of realizing large-scale standalone mobile AR, this paper presents a solution to the problem of accuracy, memory, and speed for large-scale object recognition. To this end, we design our own basic feature and realize spatial locality, selective feature extraction, rough pose estimation, and selective feature matching. Experiments are performed to verify the appropriateness of the proposed method for realizing large-scale standalone mobile AR in terms of efficiency and accuracy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.429-432
• /
• 2011

Recognizing human activities from image sequences is an active area of research in computer vision. Most of the previous work on activity recognition focuses on recognition from a single view and ignores the issue of view invariance. In this paper, we present an independent Gabor features (IGFs) method comes from the derivation of independent Gabor features in the feature extraction stage. The Gabor transformed human image exhibit strong characteristics of spatial locality, scale and orientation selectivity.

• The KIPS Transactions:PartA
• /
• v.15A no.5
• /
• pp.275-286
• /
• 2008

Fast File System(FFS) utilizes large disk bandwidth to improve the write performance of large files. One way to improve the performance is to write multiple blocks of a large file at a single disk I/O through the disk bandwidth. However, rather than disk bandwidth, the performance of small file writes is limited by disk access times significantly impacted by disk movements such as disk seek and rotation because FFS writes each of small files at a single disk write. We propose CW-FFS (Co-Writing Fast File System) to improve the write performance of small files by minimizing the disk movements that are needed to write small files to disks. Its key technique called co-writing scheme is to dynamically collect multiple small files named by a given directory and then write them at a single disk I/O to contiguous disk locations. Co-writing several small files at a single disk I/O reduces multiple disk movements that are needed for small file writes to one single disk movement, thus increasing the overall write performance of write-intensive applications. Furthermore, a file allocation scheme is introduced to prevent co-writing scheme from having a negative impact on disk spatial locality of small files named by a given directory. The measurement of our technique implemented in the OpenBSD 4.0 shows that CW-FFS increases the performance of small file writes over FFS in the range from 5 to 35% in the Postmark benchmark.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.245-256
• /
• 2009

Pastry overlay network is one of structured P2Ps using DHT(Distributed Hash Table). To reduce the number of messages among nodes, Rosary and LAR have been proposed by exploiting spatial locality and caching, respectively, in the Pastry. Rosary consists of Inter-Pastry and Intra-Pastry. A root node is assigned as a representative in each Intra-Pastry and it has the responsibility of Inter-Pastry and Intra-Pastry routing. Therefore, Rosary has several disadvantages; 1) low fault tolerance in case of root node failure 2) routing hop count increases because of the use of root nodes compared to the existing structured P2Ps, and 3) the communication load is concentrated in some specific areas. LAR has inefficient problems in that caching is not distributed among nodes in Intra-Pastry and caching is used by only nodes in the Intra-Pastry. In this paper, we propose an improved Pastry called Doughnut to overcome the above problems of Rosary and LAR. By dividing nodes with the local characteristics, the Doughnut consists of Inter-Pastry and Intra-Pastry, and all nodes have the responsibility of Inter-Pastry and Intra-Pastry routing. This results in that all nodes perform the role of the existing root node. This solves the problems of the reducing of fault-tolerance, the increasing of routing hop count, and the not-distributed communication load. Also Doughnut can use cache effectively because it guarantees the even cache distribution in local(Intra-Pastry) and the cache contents in local can be used in the other local. The proposed algorithm is implemented using simulator and the experimental results show the effectiveness of the proposed method compared to the existing method.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.67-78
• /
• 2008

With the rapid development of wireless communication and mobile equipment, many applications for location-based services have been emerging. Moving objects such as vehicles and ships change their positions over time. Moving objects have their moving path, called the trajectory, because they move continuously. To monitor the trajectory of moving objects in a large scale database system, an efficient Indexing scheme to processed queries related to trajectories is required. In this paper, we focus on the issues of minimizing the dead space of index structures. The Minimum Bounding Boxes (MBBs) of non-leaf nodes in trajectory-preserving indexing schemes have large amounts of dead space since trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. In this thesis, we propose entry relocating techniques to reduce dead space and overlaps in non-leaf nodes. we present performance studies that compare the proposed index schemes with the TB-tree and the R*-tree under a varying set of spatio-temporal queries.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.4 no.3
• /
• pp.141-150
• /
• 2002

This study was conducted to reveal the effects of local climatic conditions on the yearly cone production in progeny test stand of Korean white pine. For this, yearly cone production by locality of progeny test stands was first measured and analyzed. The effects of climatic conditions on the cone production was analyzed by the estimation of yearly local climates based on both a topoclimatological method and a spatial statistical technique. From yearly climatic estimates, 19 climatic indices affecting cone production were computed for each of the progeny test stand. The yearly cone productions were then correlated with and regressed to the climatic indices to examine effects of local climatic conditions on the reproductive growth. According to correlation analysis, it was found that some typical climatic indices by locality were significantly correlated with the cone production. Also, the optimal regression equations which can estimate cone production by local climatic conditions were provided for applying to each of the progeny test stand of Korean white pine.

• Journal of the Korean association of regional geographers
• /
• v.7 no.2
• /
• pp.35-54
• /
• 2001

The construction of Daedeok Science Town, located in Yuseong ward of Daejeon metropolitan city, began in the early 1970s. It started out as a national project to form an agglomeration of the major central government research institutions. Since that time Daedeok Science Town has also attracted private research institutions, mainly during the 1900s. This study geographically analyzes this research institutions to clarify the regional identity of Daedeok Science Town through an integrated approach of existing new regional geography approach, which is characteristics of labour market as the regional pattern of its laborers' residences, spatial labour division, its research network with other institutions, and networks of university, research institution, and corporations, through the spatial spread of intellectual right of property and through network of technology business incubator relationship with spin offs which is appeared to spatial interaction. The results of the study are as follows: First of all, Daedeok Science Town was not only self-sustenance with marketing garden of agricultural regions in the suburb of Daejeon city but also was consign of agricultural products to Daejeon city before 1972. Since that time, the identity of Daedeok Science town has been formed by externally factors of the science development, by the local decentralization of population and public offices in Seoul metropolitan area in terms of the world economy system, and by the internally accessibility maximization of the central location in Korea between 1992 and 1999. On the part of Daedeok Science Town it has some merits of in-migration from nation-wide, and of mother city's Daejeon. Lastly at the period of the venture business beginning after 1999, the role of institution, developing the existing high technology, made great contribution to an attraction of ventures business to here in need of high technology industry growth, including knowledge-based industry in the informated society. On these bases, Daedeok Science Town seems to grow spontaneously as a science park.