• International journal of advanced smart convergence
• /
• v.10 no.1
• /
• pp.142-150
• /
• 2021

Open-channel SSD is a new type of Solid-State Disk (SSD) that improves the garbage collection overhead and write amplification due to physical constraints of NAND flash memory by exposing the internal structure of the SSD to the host. However, the host-level Flash Translation Layer (FTL) provided for open-channel SSDs in the current Linux kernel consumes host memory excessively because it use page-level mapping table to translate logical address to physical address. Therefore, in this paper, we implemente a selective mapping table loading scheme that loads only a currently required part of the mapping table to the mapping table cache from SSD instead of entire mapping table. In addition, to increase the hit ratio of the mapping table cache, filesystem information and mapping table access history are utilized for cache replacement policy. The proposed scheme is implemented in the host-level FTL of the Linux kernel and evaluated using open-channel SSD emulator. According to the evaluation results, we can achieve 80% of I/O performance using the only 32% of memory usage compared to the previous host-level FTL.

• Journal of Environmental Science International
• /
• v.27 no.11
• /
• pp.1023-1028
• /
• 2018

Shape memory materials are widely used in high-tech industries. Although shape memory polymers have been developed, they have a disadvantage, only unidirectional resilience. Shape memory polymers with bi-directional recovery resilience have been actively studied. In this study, a bidirectional shape memory polyurethane was synthesized using poly(${\varepsilon}$-caprolactone) diol, methylene dicyclohexyl diisocyanate, and hydroxyethyl acrylate. The first physical curing occurred between hard segments and hydrogen bondings when the solution was dried. The second curing in acrylate groups was performed by UV exposure. A degree of curing was analyzed by infrared spectroscopy. The shape memory properties of 2 step-cured polyurethanes were investigated as a function of UV curing time.

• Journal of the Semiconductor & Display Technology
• /
• v.7 no.3
• /
• pp.17-21
• /
• 2008

Application of flash memory in mobile and ubiquitous related devices is rapidly being increased due to its low price and high performance. In addition, some notebook computers currently come out into market with a SSD(Solid State Disk) instead of hard-drive based storage system. Regarding this trend, applications need to increase the storage capacity using multiple flash memory chips for larger capacity sooner or later. Flash memory based storage subsystem should resolve the performance bottleneck for writing in perspective of speed and lifetime according to its physical property. In order to make flash memory storage work with tangible performance, reclaiming of invalid regions needs to be controlled in a particular manner to decrease the number of erasures and to distribute the erasures uniformly over the whole memory space as much as possible. In this paper, we study the performance of flash memory recycling algorithms and demonstrate that the proposed algorithm shows acceptable performance for flash memory storage with multiple chips. The proposed cleaning method partitions the memory space into candidate memory regions, to be reclaimed as free, by utilizing threshold values. The proposed algorithm handles the storage system in multi-layered style. The impact of the proposed policies is evaluated through a number of experiments.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.9
• /
• pp.1-8
• /
• 2017

The purpose of this study is to propose a cache structure for processing large-volume building information modeling (BIM) geometry data,whereit is difficult to allocate physical memory. As the number of BIM orders has increased in the public sector, it is becoming more common to visualize and calculate large-volume BIM geometry data. Design and review collaboration can require a lot of time to download large-volume BIM data through the network. If the BIM data exceeds the physical free-memory limit, visualization and geometry computation cannot be possible. In order to utilize large amounts of BIM data on insufficient physical memory or a low-bandwidth network, it is advantageous to cache only the data necessary for BIM geometry rendering and calculation time. Thisstudy proposes acache structure for efficiently rendering and calculating large-volume BIM geometry data where it is difficult to allocate enough physical memory.

• IMMUNE NETWORK
• /
• v.5 no.4
• /
• pp.252-257
• /
• 2005

Background: This study was designed to investigate the effect of exercise training on defense mechanism of chronic degenerative disease, aging, and memory impairments of senescence-accelerated mouse (SAM)P8 under the hypothesis that "Senile dementia may be prevented by regular exercises". Methods: To evaluate the effects of exercise training on the defense mechanism of aging and memory impairment, SAMP8 were divided into two groups, the control group and exercise training groups. the exercise training group were performed with low $(\dot{V}O_2max\;25{\sim}33%)$, middle ($\dot{V}O_2max$ 50%) and high $(\dot{V}O_2max\;66{\sim}75%)$ intensity exercise. All SAMP8 mice were fed experimental diet ad libitum until 4, 8 months, and dead period. Results: Median lifespan in middle exercise group resulted in a significantly increased (23.5% and 18.7%, respectively), whereas these lifespan in high exercise group resulted in an unexpectedly decreased (13.5% and 12.1%, respectively) compared with control group. Body fat levels in 4 and 8 months of age were significantly decreased 43% to 51% in middle exercise group, whereas were remarkably deceased to 57% in high exercise group compared with control group. It is believed that extended median and maximum lifespan may be effected by calory restriction through the exercise training. Acetylcholine (ACh) levels were significantly increased 6.7% and 8.5% in middle and high exercise groups, and also choline acetyltransfease (ChAT) activities were significantly increased 10.3% and 11.9% in middle and high exercise groups. Conclusion: These results suggest that proper and regular exercises such as middle group ($\dot{V}O_2max$ 50%) may play an effective role in attenuating an oxygen radicals and may play an important role in improving a learning and memory impairments of senile dementia.

• The Journal of Korean Physical Therapy
• /
• v.27 no.5
• /
• pp.375-380
• /
• 2015

Purpose: The purpose of this study was to evaluate the impact of differences in computer-aided cognitive rehabilitation aimed at stroke patients on cognitive function and daily life. Methods: The study subjects were Gwangju, Jeonnam including the attention group (group I), memory group (group II), and visual perception group (group III), who were randomly placed in each of a 10 by one problem solving group (group IV). The PSSCogRehab was applied to all subjects who underwent eight weeks once a week after 20 minutes in each group by strengthening mediation 10 minutes 30 minutes total, with a five minute break in the middle. Results: Cognitive function and activities of daily living is security and inter-group differences before intervention, and post-test results in the memory training group II, the intervention group I, III, IV and more on cognitive function and activities of daily living compared to it was effective. Conclusion: The results of computer-aided cognitive rehabilitation measuring cognitive function and ADL in patients with stroke in accordance with the group I, III, and IV group cognitive function and activities of daily living compared to IV showed that it was more effective.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.232-238
• /
• 2003

Traditional operating systems use a virtual memory to provide users with a bigger memory than a physical memory. The virtual memory augments the insufficient physical memory by the swap device. Since disks are usually used as the swap device, the cost of a page fault is relatively high compared to the access cost of the physical memory. Recently, numerous papers have investigated the Network RAM in order to exploit the idle memory in the network instead of disks. Since today's distributed systems are interconnected with high-performance networks, the network latency is far smaller than the disk access latency In this paper we design and implement the Network RAM using block device driver on Linux. This is the first implementation of the Network RAM on Linux. We propose the new reliability method to recover the page when the other workstation's memory is damaged. The system using the Network RAM as the swap device reduces the execution time by 40.3% than the system using the disk as the swap device. The performance results suggest that the new reliability method that use the processor more efficiently has the similar execution time with others, but uses smaller server memory and generates less message traffic than others.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5234-5251
• /
• 2018

It is well-known that virtualization technology can bring many benefits not only to users but also to service providers. From the view of system security and resource utility, higher resource sharing degree and higher system reliability can be obtained by the introduction of virtualization technology in distributed cloud. The small size time-sharing multiplexing technology which is based on virtual machine in distributed cloud platform can enhance the resource utilization effectively by server consolidation. In this paper, the concept of memory block and user satisfaction is redefined combined with user requirements. According to the unbalanced memory resource states and user preference requirements in multi-virtual machine environments, a model of proper memory resource allocation is proposed combined with memory block and user satisfaction, and at the same time a memory optimization allocation algorithm is proposed which is based on virtual memory block, makespan and user satisfaction under the premise of an orderly physical nodes states also. In the algorithm, a memory optimal problem can be transformed into a resource workload balance problem. All the virtual machine tasks are simulated in Cloudsim platform. And the experimental results show that the problem of virtual machine memory resource allocation can be solved flexibly and efficiently.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.673-676
• /
• 2004

To manage and query moving objects efficiently in MMDBMS, a memory index structure should be used. The most popular index structure for storing trajectories of moving objects is 3DR-tree. The 3DR-tree also can be used for MMDBMS. However, the volume of data can exceed the capacity of physical memory since moving objects report their locations continuously. To accommodate new location reports, old trajectories should be migrated to disk or purged from memory. This paper focuses on migration policies of a main memory index structure. Migration policies consist of two steps: (i) node selection, (ii) node placement. The first step (node selection) selects nodes that should be migrated to disk. The criteria of selection are the performance of insertion or query. The second step (node placement) determines the order of nodes written to disk. This step can be thought as dynamic declustering policies.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.2
• /
• pp.67-72
• /
• 2010

Recently increasing application of flash memory in mobile and ubiquitous related devices is due to its non-volatility, fast response time, shock resistance and low power consumption. Following this trend, SSD(Solid State Disk) using multiple flash chips, instead of hard-drive based storage system, started to widely used for its advantageous features. However, flash memory based storage subsystem should resolve the performance bottleneck for writing in perspective of speed and lifetime according to its disadvantageous physical property. In order to provide tangible performance, solutions are studied in aspect of reclaiming of invalid regions by decreasing the number of erasures and distributing the erasures uniformly over the whole memory space as much as possible. In this paper, we study flash memory recycling algorithms with multiple management units and demonstrate that the proposed algorithm provides feasible performance. The proposed method utilizes the partitions of the memory space by utilizing threshold values and reconfigures the management units if necessary. The performance of the proposed policies is evaluated through a number of simulation based experiments.