• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.1003-1012
• /
• 2005

The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.

• Journal of Korea Game Society
• /
• v.12 no.5
• /
• pp.67-78
• /
• 2012

Summed area table allows filtering of arbitrary-width box regions for every pixel in constant time per pixel. This characteristic makes it beneficial in image processing applications where the sum or average of the surrounding pixel intensity is required. Although calculating the summed area table of an image data is primarily a memory bound job consisting of row or column-wise summation, previous works had to endure excessive access to the high latency global memory in order to exploit data parallelism. In this paper, we propose an efficient algorithm for generating the summed area table in the GPGPU environment where the input is decomposed into square sub-images with intermediate data that are propagated between them. By doing so, the global memory access is almost halved compared to the previous methods making an efficient use of the available memory bandwidth. The results show a substantial increase in performance.

• Biomolecules & Therapeutics
• /
• v.15 no.2
• /
• pp.83-88
• /
• 2007

The roots of Liriope platyphylla (Liliaceae) are widely used in traditional Chinese medicine. In the present study, we investigated the effects of ethanol (70%) extract of the roots of Liriope platyphylla (ELP70) on learning and memory using behavioral and immunohistochemical methods in mice. Control animals were treated with vehicle (10% Tween 80). With sub-chronic treatments of ELP70 (p.o.) for 14 days, the latency time was significantly increased compared with that of the vehicle-treated control group (50, 100 and 200 mg/kg; P<0.05). Moreover, immunopositive cells for brain derived neurotrophic factor (BDNF) were significantly increased in the hippocapmpal dentate gyrus and CA1 regions after ELP70 treatments for 14 days (50, 100 and 200 mg/kg; P < 0.05). In addition, those cells for nerve growth factor (NGF) were also increased in the hippocapmpal dentate gyrus region (50, 100 and 200 mg/kg; P<0.05). These results suggest that the sub-chronic administration of ELP70 improves learning and memory, and that their beneficial effects are mediated, in part, by the enhancement of BDNF or NGF expression.

• Biomolecules & Therapeutics
• /
• v.21 no.5
• /
• pp.405-410
• /
• 2013

Codonopsis lanceolata (Campanulaceae) traditionally have been used as a tonic and to treat patients with lung abscesses. Recently, it was proposed that the extract and some compounds isolated from C. lanceolata reversed scopolamine-induced memory and learning deficits. The purpose of this study was to evaluate the improvement of cognitive enhancing effect of C. lanceolata by steam and fermentation process in scopolamine-induced memory impairment mice models by passive avoidance test and Morris water maze test. The extract of C. lanceolata or the extract of steamed and fermented C. lanceolata (SFCE) was orally administered to male mice at the doses of 100 and 300 mg/kg body weight. As a result, mice treated with steamed and fermented C. lanceolata extract (SFCE) (300 mg/kg body weight, p.o.) showed shorter escape latencies than those with C. lanceolata extract or the scopolamine-administered group in Morris water maze test. Also, it exerted longer step-through latency time than scopolamine treated group in passive avoidance test. Furthermore, neuroprotective effect of SFCE on glutamate-induced cytotoxicity was assessed in HT22 cells. Only SFCE-treated cells showed significant protection at 500 ${\mu}g/ml$. Interestingly, steamed C. lanceolata with fermentation contained more phenolic acid including gallic acid and vanillic acid than original C. lanceolata. Collectively, these results suggest that steam and fermentation process of C. lanceolata increased cognitive enhancing activity related to the memory processes and neuroprotective effect than original C. lanceolata.

• Journal of Microbiology and Biotechnology
• /
• v.25 no.9
• /
• pp.1532-1536
• /
• 2015

To investigate the memory-enhancing effect of lactic acid bacteria, we selected the probiotic mixture KF, which consisted of Lactobacillus plantarum KY1032 and Lactobacillus curvatus HY7601 (1 × 10¹¹ CFU/g of each strain), and investigated its antilipidemic and memoryenhancing effects in aged Fischer 344 rats. KF (1 × 10¹⁰ CFU/rat/day), which was administered orally once a day (6 days per week) for 8 weeks, significantly inhibited age-dependent increases of blood triglyceride and reductions of HDL cholesterol (p < 0.05). KF restored agereduced spontaneous alternation in the Y-maze task to 94.4% of that seen in young rats (p < 0.05). KF treatment slightly, but not significantly, shortened the escape latency daily for 4 days. Oral administration of KF restored age-suppressed doublecortin and brain-derived neurotrophic factor expression in aged rats. Orally administered KF suppressed the expression of p16, p53, and cyclooxygenase-2, the phosphorylation of Akt and mTOR, and the activation of NF-κB in the hippocampus of the brain. These findings suggest that KF may ameliorate age-dependent memory deficit and lipidemia by inhibiting NF-κB activation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.913-917
• /
• 2009

Flash memories have asymmetric I/O costs for read and write in terms of latency and energy consumption. However, the ratio of these costs is dependent on the type of storage. Moreover, it is becoming more common to use two flash memories on a system as an internal memory and an external memory card. For this reason, buffer cache replacement algorithms should consider I/O costs of device as well as possibility of reference. This paper presents WWCLOCK(Write-Weighted CLOCK) algorithm which directly uses I/O costs of devices along with recency and frequency of cache blocks to selecting a victim to evict from the buffer cache. WWCLOCK can be used for wide range of storage devices with different I/O cost and for systems that are using two or more memory devices at the same time. In addition to this, it has low time and space complexity comparable to CLOCK algorithm. Trace-driven simulations show that the proposed algorithm reduces the total I/O time compared with LRU by 36.2% on average.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.636-645
• /
• 2008

OneNAND flash is a high-performance hybrid flash memory that combines the advantages of both NAND flash and NOR flash. OneNAND flash has not only all virtues of NAND flash but also greatly enhanced read performance which is considered as a downside of NAND flash. As a result, it is widely used in mobile applications such as mobile phones, digital cameras, PMP, and portable game players. However, most of the general purpose operating systems, such as Linux, can not exploit the read performance of OneNAND flash because of the restrictions imposed by their virtual memory system and block I/O architecture. In order to solve that problem, we suggest a new approach called virtual I/O segment. By using virtual I/O segment, the superior read performance of OneNAND flash can be exploited without modifying the existing block I/O architecture and MTD subsystem. Experiments by implementations show that this approach can reduce read latency of OneNAND flash as much as 54%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.139-144
• /
• 2019

For recent decades, Non-volatile Memory (NVM) technologies have been drawing a high attention both in industry and academia due to its high density and short latency comparable to that of DRAM. However, NVM devices has write endurance problem and thus the current data structures that have been built around DRAM-specific features including unlimited program cycles is inadequate for NVM, reducing the device lifetime significantly. In this paper, we revisit a red-black tree extensively adopted for data indexing across a wide range of applications, and make it to better fit for NVM. Specifically, we observe that the conventional red-black tree wears out the specific location of memory because of its rebalancing operation to ensure fast access time over a whole dataset. However, this rebalancing operation frequently updates the long-lived nodes, which leads to the skewed wear out across the NVM cells. To resolve this problem, we present a new swapping wear-leveling red-black tree that periodically moves data in the worn-out node into the young node. The performance study with real-world traces demonstrates the proposed red-black tree reduces the standard deviation of the write count across nodes by up to 12.5%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.451-462
• /
• 2009

Recently, there are many active studies to enhance low I/O performance of hard disk device. The studies on the hardware make good progress whereas those of the system software to enhance I/O performance may not support the hardware performance due to its poor progress. In this paper, we propose a new method of prefetching n-blocks into the flash memory. The proposed method consists of three steps: (1)analyzing the pattern of read requests in block units; (2)determining the number of blocks prefetched to flash memory; (3)replacing blocks according to block replacement policy. The proposed method can reduce the latency time of hard disk and optimize the power consumption of the computer system. Experimental results show that the proposed dynamic n-block method provides better average response time than that of the existing AMP(Adaptive multi stream prefetching) method by 9.05% and reduces the average power consumption than that of the existing AMP method by 11.11%.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.77-92
• /
• 2006

This paper proposes an efficient spatial data manager for map services in mobile environment. It is designed to provide interoperability and efficient performance at once. To provide interoperability and reusability, the spatial data manager conforms to international standards such as the OpenGIS Simple Features Implementation Specification for OLE/COM, OpenGIS Geography Markup Language (GML) Encoding Specification developed by the Open Geospatial Consortium (OGC). The spatial data manger exploits physical main memory using Address Windowing Extensions supported by Microsoft Windows to manage spatial data for efficient performance by reducing time to read data from disk on user's request. The format of the spatial data in main memory is target data (GML) to reduce conversion time from source data to it. Progressive transmission is also provided to reduce latency time by representing only received partial data for mobile environment without waiting whole transmission.