• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.377-382
• /
• 2006

Advantageous features of flash memory are stimulating its exploitation in mobile and ubiquitous related devices. The hardware characteristics of flash memory however place restrictions upon this current trend. In this paper, a cleaning policy for flash memory is proposed in order to decrease the necessary penally for recycling of memory minimizing the degradation of performance at the same time. The proposed cleaning algorithm is based on partitioning of candidate memory regions, to be reclaimed as free, into a number of groups. In addition, in order to improve the balanced utilization of the entire flash memory space in terms of 'wearing-out', a free segment selection algorithm is discussed. The impact of the proposed algorithms is evaluated through a number of experiments. Moreover, the composition of the optimal configuration featuring the proposed methods is tested through experiments.

• Animal cells and systems
• /
• v.2 no.1
• /
• pp.65-69
• /
• 1998

The hippocampus and prefrontal cortex are regarded as the highest-order association cortices. The hippocampus has been proposed to store "cognitive maps" of external environments, and the prefrontal cortex is known to be involved in the planning of behavior, among other functions. Considering the prominent functional roles played by these structures, it is not surprising to find direct monosynaptic projections from the hippocampus to the prefrontal cortex. Rhythmic stimulation of this projection patterned after the hippocampal EEG theta rhythm induced stable long-term potentiation of field potentials in the prefrontal cortex. Comparison of behavioral correlates of hippocampal and prefrontal cortical neurons during an a-arm radial maze, working memory task shows a striking contrast. Hippocampal neurons exhibit clear place-specific firing patterns, whereas prefrontal cortical neurons do not show spatial selectivity, but are correlated to different stages of the behavioral task. These data lead to the hypothesis that the role of hippocampal projection to the prefrontal cortex is not to impose spatial representations upon prefrontal activity, but to provide a mechanism for learning the spatial context in which particular behaviors are appropriate.propriate.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.238-249
• /
• 2010

Flash memory has been studied as a storage medium in order to improve the performance of the system using its high computing speed in the DBMS field where frequent data access is needed. The most difficulty using the flash memory is the performance degradation and the life span shortening of flash memory coming from inefficient in-place update. Log based approaches have been studied to solve inefficient in-place update problem in the DBMS where write operations occur in smaller size of data than page frequently. However the existing log based approaches suffer from the frequent merging operations, which are the principal cause of performance deterioration. Thus is because their fixed log area management can not guarantee a sufficient space for logs. In this paper, we propose non-fixed log area management technique that can minimize the occurrence of the merging operations by promising an enough space for logs. We also suggest the cost calculation model of the optimal log sector number minimizing the system operation cost in a block. In experiment, we show that our non-fixed log area management technique can have the improved performance compared to existing approaches.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.567-582
• /
• 2000

We propose a new way of managing flash memory space for flash memory-specific file system based on log-structured file system. Flash memory has attractive features such as non-volatility, and fast I/O speed, but it also suffers from inability to update in place and limited usage cycles. These drawbacks require many changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between the two often-conflicting goals. The proposed cleaning method performs well especially when storage utilization and the degree of locality are high. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data. The second goal, cycle-leveling is achieved to the degree where the maximum difference between erase cycles is below the error range of the hardware. Simulation results show that the proposed method has significant benefit over naxve methods: maximum of 35% reduction in cleaning cost with even spreading writes across segments.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.15-18
• /
• 2003

Flash memory becomes more important for its fast access speed, low-power, shock resistance and nonvolatile storage. But its native restrictions that have limited 1ifetime, inability of update in place, different size unit of read/write and erase operations need to managed by FTL(Flash Translation Layer). FTL has to control the wear-leveling, address mapping, bad block management of flash memory. In this paper, we focuses on the fast access to address mapping table and proposed the way of faster valid page search in the flash memory using the VPLT(Valid Page Lookup Table). This method is expected to decrease the frequency of access of flash memory that have an significant effect on performance of read and block-transfer operations. For the validations, we implemented the FTL based on Windows CE platform and obtained an improved result.

• Proceedings of the Korean Powder Metallurgy Institute Conference
• /
• 2006.09b
• /
• pp.846-847
• /
• 2006

The composite used in this paper was prepared by hot-pressing ball-milled Mg alloy powders, in which NiTi shape memory alloy fibers in a row were sandwiched. The microstructure and property were examined. It is shown that the composite consisted of a homogenous matrix with uniformly distributed NiTi shape memory alloy fibers, recrystallization took place in the Mg alloy matrix which was subjected to plastic deformation an adequate bonding formed between the matrix and fibers; the density and tensile strength of the composite increased after the hot-forging; the hot-forging process is capable of improving properties of the composite.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.161-170
• /
• 2022

Recently, NAND-type flash memory has been regarded to be new promising storage media for large-scale database systems. For flash memory to be employed for that purpose, we need to reduce its expensive update cost caused by the inablity of in-place updates. To remedy such a drawback in flash memory, we propose a new flash-aware buffering scheme that enables virtual flushing of dirty pages. To this end, we slightly alter the tradional algorithms used for the logging scheme and buffer management scheme. By using the mechanism of virtual flushing, our proposed buffering scheme can efficiently prevent the frequenct occureces of page updates in flash storage. Besides the advantage of reduced page updates, the proposed viurtual flushing mechanism works favorably for shorneing a recocery time in the presense of failure. This is because it can reduce the time for redo actions during a recovry process. Owing to those two benefits, we can say that our scheme couble be very profitable when it is incorporated into cutting-edge flash-based database systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.599-603
• /
• 2008

Flash memory has its unique characteristics: the write operation is much more costly than the read operation and in-place updating is not allowed. In this paper, we analyze how these characteristics of flash memory affect the performance of clustering and non-clustering in record management, and shows that non-clustering is more suitable in flash memory environment, which does not hold in disk environment. Also, we discuss the problems of the existing non-clustering method, and identify considerable designing factors of record management method in flash memory environment.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.88-93
• /
• 2015

In modern computer systems, DRAM is commonly used as main memory due to its low read/write latency and high endurance. However, DRAM is volatile memory that requires periodic power supply (i.e., memory refresh) to sustain the data stored in it. On the other hand, PCM is a promising candidate for replacement of DRAM because it is non-volatile memory, which could sustain the stored data without memory refresh. PCM is also available for byte-addressable access and in-place update. However, PCM is unsuitable for using main memory of a computer system because it has two limitations: high read/write latency and low endurance. To take the advantage of both DRAM and PCM, a hybrid main memory, which consists of DRAM and PCM, has been suggested and actively studied. In this paper, we propose a novel page replacement algorithm for hybrid main memory. To cope with the weaknesses of PCM, our scheme focuses on reducing the number of PCM writes in the hybrid main memory. Experimental results shows that our proposed page replacement algorithm reduces the number of PCM writes by up to 80.5% compared with the other page replacement algorithms.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.571-582
• /
• 2005

NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that dose not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read and write operations is a page. A NAND flash file system called YAFFS has been proposed. But YAFFS has several problems to be addressed. In this paper, the Reliable Flash File System(RFFS) for NAND flash memory is designed and evaluated. In designing a file system the following four issues must be considered in particular for the design: (i) to minimize a repairing time when the system fault occurs, (ii) to balance the number of block erase operations by offering wear leveling policy, and (iii) to reduce turnaround time of memory operations by reducing the amount of data written. We demonstrate and evaluate the performance of the proposed schemes.