• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.57-62
• /
• 2022

Recently, fast storage media such as phage-change memory (PCM) emerge, and memory management policies for slow disk storage need to be revisited. In this paper, we propose a new page replacement policy that makes use of PCM as a swap device of virtual memory systems. The proposed policy aims at reducing write traffic to the swap device as well as reducing the number of page faults pursued by traditional page replacement policies. This is because a write operation in PCM is slow and PCM has limited write endurances. Specifically, the proposed policy focuses on the reduction of page faults when the memory load of the system is high, but it aims at reducing write traffic to storage when free memory space is sufficient. Simulation experiments with various memory reference traces show that the proposed policy reduces write traffic to PCM without performance degradations.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.438-450
• /
• 2003

Spatial joins find pairs of objects that overlap with each other. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with sizes of objects, it is difficult to develop a formal algorithm without relying on heuristics. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no sites. Thus, spatial join algorithms using these indexes are relatively simple and can be formally developed. However, the disadvantage of transform-space join algorithms is that they cannot be applied to original-space indexes such as the R-tree containing original-space objects. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose a new notion of the transform-space view and present the transform-space view join algorithm(TSVJ). A transform-space view is a virtual transform-space index based on an original-space index. It allows us to interpret on-the-fly a pre-built original-space index as a transform-space index without incurring any overhead and without actually modifying the structure of the original-space index or changing object representation. The experimental result shows that, compared to existing spatial join algorithms that use R-trees in the original space, the TSVJ improves the number of disk accesses by up to 43.1% The most important contribution of this paper is to show that we can use original-space indexes, such as the R-tree, in the transform space by interpreting them through the notion of the transform-space view. We believe that this new notion provides a framework for developing various new spatial query processing algorithms in the transform space.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.21-30
• /
• 2011

In the global IT market, a lot of issues for responding to various environmental regulations emerged. In case of the data centers, it is consuming huge amounts of energy to maintain. So there have been various technical attempts as Consolidation, Virtualization, Optimization to efficiently manage energy and data storage to fix the problems. In this paper, we propose a new RAID(Redundant Array of Independent Disks) mechanism which is differing the intensity of power consumption and works to provide data protection and disaster recovery(backup, mirroring etc.) to stratify multiple volumes. G-RAID minimize the power consumption and the lower of I/O performance by selecting the volume depending on the frequency of data access while classifying the power consumption between volumes in storage system. Also, it is possible that a filesystem and block map information of G-RAID is processed by basic unit which is group located in a row for the blocks to work efficiently and can minimize the performance degradation of block mapping load by the access frequency in each groups. As a result, we obtained to elevate a little bit of response time caused by block relocation work, but showed the decrease of power consumption by 38%.