• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.153-160
• /
• 2009

Efficient buffer management is closely related to system performance. Thus, much research has been performed on various buffer management techniques. However, many of the proposed techniques utilize the temporal locality of access patterns. In spatial database environments, there exists not only the temporal locality but also spatial locality, where the objects in the recently accessed regions will be accessed again in the near future. Thus, in this paper, we present a buffer management technique, called BEAT, which utilizes both the temporal locality and spatial locality in spatial database environments. The experimental results with real-life and synthetic data demonstrate the efficiency of BEAT.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.529-539
• /
• 2000

This paper proposes a prefetch-based disk buffer management algorithm, which we call W2R (Veighingjwaiting Room). Instead of using elaborate prefetching schemes to decide which blockto prefetch and when, we simply follow the LRU-OBL (One Block Lookahead) approach and prefetchthe logical next block along with the block that is being referenced. The basic difference is that theW2R algorithm logically partitions the buffer into two rooms, namely, the Weighing Room and theWaiting Room. The referenced, hence fetched block is placed in the Weighing Room, while theprefetched logical next block is placed in the Waiting Room. By so doing, we alleviate some inherentdeficiencies of blindly prefetching the logical next block of a referenced block. Specifically, a prefetchedblock that is never used may replace a possibly valuable block and a prefetched block, thoughreferenced in the future, may replace a block that is used earlier than itself. We show through tracedriven simulation that for the workloads and the environments considered the W2R algorithm improvesthe hit rate by a maximum of 23.19 percentage points compared to the 2Q algorithm and a maximumof 10,25 percentage feints compared to the LRU-OBL algorithm.

• Journal of KIISE:Databases
• /
• v.37 no.6
• /
• pp.308-314
• /
• 2010

As the price of flash memory continues to drop and the technology of flash SSD controller innovates, high performance flash SSDs with affordable prices flourish in the storage market. Nevertheless, it is hard to expect that flash SSDs will replace harddisks completely as database storage. Instead, the approach to use flash SSD as a cache for harddisks would be more practical, and, in fact, several hybrid storage architectures for flash memory and harddisk have been suggested in the literature. In this paper, we propose a new approach to use flash SSD as an extended buffer for main buffer in database systems, which stores the pages replaced out from main buffer and returns the pages which are re-referenced in the upper buffer layer, improving the system performance drastically. In contrast to the existing approaches to use flash SSD as a cache in the lower storage layer, our approach, which uses flash SSD as an extended buffer in the upper host, can provide fast random read speed for the warm pages which are being replaced out from the limited main buffer. In fact, for all the pages which are missing from the main buffer in a real TPC-C trace, the hit ratio in the extended buffer could be more than 60%, and this supports our conjecture that our simple extended buffer approach could be very effective as a cache. In terms of performance/price, our extended buffer architecture outperforms two other alternative approaches with the same cost, 1) large main buffer and 2) more harddisks.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1669-1679
• /
• 1996

In this paper, we address the problem of how to replace huffers in multimedia database systems with time-varying skewed data access. The access pattern in the multimedia database system to support audio-on-demand and video-on-demand services is generally skewed with a few popular objects. In addition the access pattem of the skewed objects has a time-varying property. In such situations, our analysis indicates that conventional LRU(least Recently Used) and LFU(Least Frequently Used) schemes for buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural suited. We propose a new buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural Networks)using a neural network for multimedia database systems with time-varying skewed data access. The major role of our neural network classifies multimedia objects into two classes:a hot set frequently accessed with great popularity and a cold set randomly accessed with low populsrity. For the classification, the inter-arrival time values of sample objects are employed to train the neural network.Our algorithm partitions buffers into two regions to combine the best roperties of LRU and LFU.One region, which contains the 핫셋 objects, is managed by LFU replacement and the other region , which contains the cold set objects , is managed by LRUreplacement.We performed simulation experiments in an actual environment with time-varying skewed data accsee to compare our algorithm to LRU, LFU, and LRU-k which is a variation of LRU. Simulation resuults indicate that our proposed algorthm provides better performance as compared to the other algorithms. Good performance of the neural network-based replacement scheme means that this new approach can be also suited as an alternative to the existing page replacement and prefetching algorithms in virtual memory systems.

• Current Photovoltaic Research
• /
• v.3 no.2
• /
• pp.54-60
• /
• 2015

ZnSnO thin films were deposited by atomic layer deposition (ALD) process using diethyl zinc ($Zn(C_2H_5)_2$) and tetrakis (dimethylamino) tin ($Sn(C_2H_6N)_4$) as metal precursors and water vapor as a reactant. ALD process has several advantages over other deposition methods such as precise thickness control, good conformality, and good uniformity for large area. The composition of ZnSnO thin films was controlled by varying the ratio of ZnO and $SnO_2$ ALD cycles. The ALD ZnSnO film was an amorphous state. The band gap of ZnSnO thin films increased as the Sn content increased. The CIGS solar cell using ZnSnO buffer layer showed about 18% energy conversion efficiency. With such a high efficiency with the ALD ZnSnO buffer and no light soaking effect, AlD ZnSnO buffer mighty be a good candidate to replace Zn(S,O) buffer in CIGSsolar cells.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.8
• /
• pp.45-52
• /
• 2011

Flash memory is becoming widely prevalent in various area due to high performance, non-volatile features, low power, and robust durability. As price-per-bit is decreased, NAND flash based SSDs (Solid State Disk) have been attracting attention as the next generation storage device, which can replace HDDs (Hard Disk Drive) which have mechanical properties. Especially for the single package SSD, if channel number or FIFO buffer size per channel increases to improve performance, the size of a controller and I/O pin count will increase linearly with channel numbers and form factor will be affected. We propose a novel technique which can minimize form factor by optimizing the number of NAND flash channels and the size of interface FIFO buffer in the SSD. For SSD with 10 channel and double buffer, the experimental results show that buffer block size can be reduced about 73% without performance degradation and total size of a controller can be reduced about 40% because control block per channel and I/O pin count decrease according to decrease channel number.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.20-24
• /
• 2009

sensor node work limited energy. It is undesirable or impossible to replace the batteries that are depleted of energy because of characteristics of the sensor network. Due to the specific energy constrained environment, MAC design for sensor networks generally has to take energy consumption as one of its primary concerns. But in sensor networks, latency has been a key factor affecting the applicability of sensor networks to some delay-sensitive applications. Therefore, we propose MAC protocols based DSMAC in this paper. Which is able to dynamically change the sleeping and duty cycle of sensors is adjusted to adapt to packet amounts in buffer. Proposed MAC has energy efficiency and low latency, compared DSMAC.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.133-140
• /
• 2007

Flash memory has penetrated our life in various forms. For example, flash memory is important storage component of ubiquitous computing or mobile products such as cell phone, MP3 player, PDA, and portable storage kits. Behind of the wide acceptance as memory is many advantages of flash memory: for instances, low power consumption, nonvolatile, stability and portability. In addition to mentioned strengths, the recent development of gigabyte range capacity flash memory makes a careful prediction that the flash memory might replace some of storage area dominated by hard disks. In order to have overwriting function, one block must be erased before overwriting is performed. This difference results in the cost of reading, writing and erasing in flash memory[1][5][6]. Since this difference has not been considered in traditional buffer replacement technologies adopted in system software such as OS and DBMS, a new buffer replacement strategy becomes necessary. In this paper, a new buffer replacement strategy, reflecting difference I/O cost and applicable to flash memory, suggest and compares with other buffer replacement strategies using workloads as Zipfian distribution and real data.

• Parasites, Hosts and Diseases
• /
• v.55 no.3
• /
• pp.233-238
• /
• 2017

Pathogenic Naegleria fowleri, Acanthamoeba castellanii, and Acanthamoeba polyphaga, are distributed worldwide. They are causative agents of primary amoebic meningoencephalitis or acanthamoebic keratitis in humans, respectively. Trophozoites encyst in unfavorable environments, such as exhausted food supply and desiccation. Until recently, the method of N. fowleri encystation used solid non-nutrient agar medium supplemented with heat-inactivated Escherichia coli; however, for the amoebic encystment of Acanthamoeba spp., a defined, slightly modified liquid media is used. In this study, in order to generate pure N. fowleri cysts, a liquid encystment medium (buffer 1) modified from Page's amoeba saline was applied for encystation of N. fowleri. N. fowleri cysts were well induced after 24 hr with the above defined liquid encystment medium (buffer 1). This was confirmed by observation of a high expression of differential mRNA of nfa1 and actin genes in trophozoites. Thus, this liquid medium can replace the earlier non-nutrient agar medium for obtaining pure N. fowleri cysts. In addition, for cyst formation of Acanthamoeba spp., buffer 2 (adjusted to pH 9.0) was the more efficient medium. To summarize, these liquid encystment media may be useful for further studies which require axenic and pure amoebic cysts.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.458-462
• /
• 1992

This paper presents a decomposition method to evaluate the performance measures of transfer line with unreliable machine and finite buffers. The proposed method is to decompose the transfer fine into a set of two machine lines for analysis. Nonhomogeneous lines are considered. In such fines, the machines may take the different lengths of time performing operations on parts. A simple transformation is employed in order to replace the line by a homogeneous line. The approximate transformation enables one to determine parameters of performance such as production rate and average buffer levels, and it also shows better applications for a large class of systems.