• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.469-475
• /
• 1991

In this paper, we suggest the exact perturbation analysis(Exact_PA) technique with respect to the buffer storage in tandem queueing networks, through which the optimal buffer storage design problem is considered. The discrete event dynamic equations for the departure time of a customer are presented together with the basic properties of Full Out(FO) and No Input(NI) with respect to the buffer storage. The new perturbation rules with respect to the buffer storage are suggested, from which the exact perturbed path can be obtained. The optimal buffer storage problem is presented by introducing a performance measure consisting of the throughput and the buffer storage cost. An optimization algorithm maximizing this performance measure is derived by using the Exact_PA technique. The proposed perturbation analysis technique and the optimization algorithm are validated by numerical examples.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.47-56
• /
• 2002

Previous buffer cache schemes for multimedia storage systems only exploited the sequential references of multimedia files and didn't consider looping references. However, in some video applications like foreign language learning, users mark the scene as loop area and then application automatically playbacks the scene several times. In this paper, we propose a new buffer replacement scheme, called HBM(Hybrid Buffer Management), for multimedia storage systems that have both sequential and looping references. Proposed scheme assumes that application layer informs reference pattern of files to file system. Then HBM applies an appropriate replacement policy to each file. Our simulation experiments show that HBM outperforms previous buffer cache schemes such as DISTANCE and LRU.

• Nuclear Engineering and Technology
• /
• v.55 no.11
• /
• pp.4173-4180
• /
• 2023

The stability of engineered barriers in high-level radioactive waste disposal systems can be influenced by the decay heat generated by the waste. This study focuses on the thermal analysis of various canister designs to effectively lower the maximum temperature of the engineered barrier. A numerical model was developed and employed to investigate the heat dissipation potential of copper rings placed across the buffer. Various canister designs incorporating copper rings were presented, and numerical analysis was performed to identify the design with the most significant temperature reduction effect. The results confirmed that the temperature of the buffer material was effectively lowered with an increase in the number of copper rings penetrating the buffer. Parametric studies were also conducted to analyze the impact of technical gaps, copper thickness, and collar height on the temperature reduction. The numerical model revealed that the presence of gaps between the components of the engineered barrier significantly increased the buffer temperature. Furthermore, the reduction in buffer temperature varied depending on the location of the gap and collar. The methods proposed in this study for reducing the buffer temperature hold promise for contributing to cost reduction in radioactive waste disposal.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1375-1385
• /
• 1996

As there has been much demands for processing multimedia data, a storage manager for multimedia data makes much effects on system performance. Because the size of multimedia data is usually very large, disk I/O for the data consumes much time and causes the system performance to be decreased. Therefore, it makes a better effect on system performance that a multimedia data storage manager decreases its disk I/O by the buffer management of multimedia data. This paper proposes a buffer management technique which allocates the buffer to be equal to its corresponding segment which consists of physically continuous disk page set and is disk management unit for multimedia data in many multimedia data storage manager. As the size of buffer varies, it also proposes a buffer replacement policy which consider not only reference behavior of buffer but also buffer size The proposed multimedia data buffer management technique is implemented in KORED/STORM which is a storage manager for multimedia data.

• IE interfaces
• /
• v.12 no.2
• /
• pp.210-221
• /
• 1999

Several researchers have previously studied the problem of allocating buffer storage to maximize the throughput rate and/or minimize the mean buffer average of a transfer line for a given total amount of buffer space. But there seems to be very little difference in performance between intuitively reasonable and optimal allocations. This paper proposes and illustrates a methodology, based on the robust design concept of Taguchi, to allocate buffer storage of long transfer lines with a given total amount of buffer capacity when up and down times follow exponential distributions, respectively. We show how this procedure using simple heuristic rule can be used for design of long transfer lines.

• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.115-129
• /
• 1988

This paper discusses an analytical method to derive the efficiency and the average storage level of an unreliable two-machine, two-stage automatic transfer line with interstage buffer storage. Extensive numerical experiments and simulations are also conducted to see the behavior of the system under the wide range of parameter values as well as various distributions.

• Journal of Digital Contents Society
• /
• v.12 no.2
• /
• pp.141-150
• /
• 2011

Recently the Solid State Drive (SSD) is widely used for storage system of various mobile devices. In this case, existing buffer replacement algorithms based on the hard disk do not consider characteristics of flash memory, so it caused performance degradation of the system. This paper proposes a novel buffer replacement policy called ABM (Asymmetric Buffer Management) policy. ABM policy separates read and write buffer space and applies different replacement unit and replacement algorithm for each buffer. In addition, write buffer delay scheme and dynamic size adaptation algorithm is applied for better performance. ABM outperforms other replacement policies, especially ABM-LRU-CLC shows 32% better performance than normal LRU policy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.843-847
• /
• 2005

The development of distributed application in the standardized CORBA(Common Object Request Broker Architecture) environments reduces the developing time and maintaining cost of the systems. Because of these advantages, the development of application is being progressed in the several fields using the CORBA environments. The programmers in the CORBA environments usually develop the application programs using the CORBA IDL(Interface Definition Language). The IDL files are compiled by IDL compiler and translated into the stubs and skeleton codes which are mapped onto particular target language. The stubs produced by IDL compilers processes the marshaling a data into message buffer. Before a stub can marshal a data into its message buffer, the stub must ensure that the buffer has at least enough free space to contain the encoded representation of the data. But, the stubs produced by typical IDL compilers check the amount of free buffer space before every atomic data is marshaled, and if necessary, expand the message buffer. These repeated tests are wasteful and incidence of overheads, especially if the marshal buffer space must be continually expanded. Thus, the performance of the application program may be poor. In this paper, we suggest the way that the stub code is maintain the enough free space before marshaling the data into message buffer. This methods were analyzes the overall storage requirements of every message that will be exchanged between client and server. For these analysis, in the Front End of compiler has maintain the information that the storage requirements and alignment constraints for data types. Thus, stub code is optimized and the performance of application program is increased.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.878-884
• /
• 2014

File I/O buffer cache plays an important role in narrowing the wide speed gap between the main memory and the secondary storage. However, data loss or inconsistencies may occur if the system crashes before the data that has been updated in the buffer cache is flushed to storage. Thus, most operating systems adopt a daemon that periodically flushes dirty data to the secondary storage. In this study, we show that periodic flushes account for 30-70% of the total write traffic to storage and remove this inefficiency by implementing a small, non-volatile buffer cache. Specifically, we present space-efficient management techniques, such as delta-write and fragment-grouping, and show that the storage write traffic and throughput can be improved by a margin of 44.2% and 23.6%, respectively, with only a small NVRAM.