• Journal of Korean Society for Quality Management
• /
• v.28 no.3
• /
• pp.11-17
• /
• 2000

This paper presents a model for determining the optimal number of general repairs and supplementary input cost limit rate in addition to minimal repair cost rate to implement preventive maintenance. The basic concept parallels the periodic replacement model with minimal repair at failure introduced by Barlow and Hunter(1960) and Park(1979), only difference being the replacement signalled by the number of previous general repairs performed on the system. A general repair brings the state of the system to a certain better state than before repaired. Numerical examples are provided.

• Communications for Statistical Applications and Methods
• /
• v.15 no.6
• /
• pp.909-923
• /
• 2008

This paper considers the replacement model and the preventive maintenance model following the expiration of combination warranty for a repairable system. If the system fails after the combination warranty is expired, then it is minimally repaired at each failure. The criterion used to determine the optimal replacement policy and the optimal preventive maintenance policy is the overall value function based on the expected cost rate per unit time and the expected downtime per unit time. The numerical examples are presented for illustrative purpose when the failure time follows a Weibull distribution.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2007.12a
• /
• pp.241-242
• /
• 2007

This paper aims to determination of container ship's economical replacement policy by Fuzzy Annual Equivalent Cost Method Especially, though there was much vagueness to expense for calculation of container ship's economical life, this paper expressed such vague nature with a fuzzy number. And this paper developed the fuzzy expense model with a fuzzy number, and to analyze more practically than an expense model, was decided economical life-age with an application in a containership of various volumes.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.3
• /
• pp.9-16
• /
• 2017

In recent computing systems, LRU replacement policy has been widely used because it can be simply implemented and applicable to most programs. However, if the working set size of the program is bigger than the actual cache size, LRU replacement policy may occur thrashing problem. Thrashing problem means that cache blocks are consistently replaced without re-referencing in the cache. This paper proposes a new cache management scheme to solve the thrashing problem in the second-level cache. The proposed scheme measures per set reuse frequency using EAF structure to find thrashing sets. When the cache miss occurs, it tests whether the address of the missed block is stored or not. If the address of the missed block is stored, it means that the recently evicted block is re-requested, so the reuse frequency is predicted high. In this case, the corresponding counter of the set is increased. When the counter value is bigger than the threshold value, we assume that the corresponding set shows high reuse frequency. The proposed scheme assigns the set with high reuse frequency to the additional small size cache to keep the blocks in the cache for a long time. Our experimental results show that the proposed scheme improves the IPC by 3.81% on average.

• Journal of Korean Society for Quality Management
• /
• v.19 no.1
• /
• pp.103-114
• /
• 1991

This article is concerned with cost analysis in warranty policy. The warranty cost can be different according to warranty rate and warranty renewal policy. In this paper the stepdown warranty policy is analyzed. Assuming the nonrepairable item, manufacturer's cost is calculated in stepdown warranty policy and free replacement, pro-rata, hybrid policy. Numerical examples are given over Weibull time-to-failure distribution.

• Journal of Korean Society for Quality Management
• /
• v.28 no.3
• /
• pp.53-58
• /
• 2000

In many cases, it is more practical and economical to repair a system than to replace the whole system or to perform a complete overhaul when it fails. The age replacement policy with minimal repair at failure is considered. The system is replaced every time its age reaches at $T_0$. For each intervening failure only minimal repair is done. The minimal repair times in a renewal period are increasing in the sense that the minimal repair times constitute a strictly increasing geometric process. The long-run expected cost rate Is obtained and the properties of the existence and the uniqueness of the optimal policy minimizing the long-run expected cost rate are derived.

• Journal of Korean Society for Quality Management
• /
• v.23 no.2
• /
• pp.43-52
• /
• 1995

A replacement policy under two types of failures, repairable or irrepairable, is considered, In the policy, the system is replaced at the n-th failure if all the previous (n-1) failures are repairable; Otherwise it is replaced at the first irrepairable failure. Assuming that the j-th failure is repairable with probability ${\alpha}_j$ and minimal repairs are performed for repairable failures between replacements, we derive the expected cost rate through the application of NHPP in order to determine the optimal number $n^*$. The policy includes some previous studies as special cases.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.777-778
• /
• 2006

In this thesis, we design and implement a Flash Cache Core Module (FCCM) which operates on the YAFFS NAND flash memory. The FCCM applies memory replacement policy and prefetching policy based on the page reference pattern of applications. Also, implement the Clean-First memory replacement technique considering the characteristics of flash memory. In this method the decision is made according to page hit to apply prefetched waiting area. The FCCM decrease I/O hit frequency up to 37%, Compared with the linux cache and prefetching policy. Also, it operated using less memory for prefetching(maximum 24% and average 16%) compared with the linux kernel.

• Journal of Integrative Natural Science
• /
• v.17 no.2
• /
• pp.43-51
• /
• 2024

Jung et al.(2015) suggest the two-phase warranty model, which is a general type of warranty model. Under the two-phase warranty, the warranty period is divided into two intervals, one of which is for renewing replacement warranty, and the other is for minimal repair warranty. And warranty policies play a very important role in product marketing. In this paper, we suggest the optimal warranty policy for free extended two-phase warranty. To determine the optimal warranty period, we adopt the expected profit per unit product. So, the expressions for the total expected cost, the sale price and the expected profit per unit product from the manufacturer's point of view are derived. Also, we discuss the optimal warranty period and the numerical examples are provided to illustrate the proposed the warranty policy.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.1-10
• /
• 2020

In this paper, we propose an efficient disk buffer replacement policy which improves hit ratio and reduces writing operations of flash based storages. The flash based storage has many advantages, including a small form factor, non-volatility and high reliability, but there are problems caused by own limitations, like not-in-place update, short life cycle and asymmetric I/O latencies. To redeem these problems, this paper proposes the write weighted probability of reference(2WPR) policy. 2WPR policy predicts re-referencing probability and calculates localities of each page. Furthermore, by weighting write operations to every pages, 2WPR can reduce write operations to flash based storage. In addition, we can improve the performance with higher hit ratio and reduce the number of write operations and consequently shorten the latencies of each operation. The results show that our policy provides improvements of up to 10% for the hit ratio with the reduction of up to 5% for the flash writing operation compared with other policies.