• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.469-478
• /
• 2001

In the virtual memory system, page replacement policy exerts a great influence on the performance of demand paging. There are LRU(Least Recently Used) and LFU (Least Frequently Used) as the typical replacement policies. The LRU policy performs effectively in many cases and adapts well to the changing workloads compared to other policies. It however cannot distinguish well between frequently and infrequently referenced pages. The LFU policy requires that the page with the smallest reference count be replaced. Though it considers all the references in the past, it cannot discriminate between references that occurred far back in the past and the more recent ones. Thus, it cannot adapt well to the changing workload. In this paper, we first analyze memory reference patterns of eight applications. The patterns show that the recently referenced pages or the frequently referenced pages are accessed continuously as the case may be. So it is rather hard to optimize page replacement scheme by using just one of the LRU or LFU policy. This paper makes an attempt to combine the advantages of the two policies and proposes a new page replacement policy. In the proposed policy, paging list is divided into two lists (LRU and LFU lists). By keeping the two lists in recency and reference frequency order respectively, we try to restrain the highly referenced pages in the past from being replaced by the LRU policy. Results from trace-driven simulations show that there exists points on the spectrum at which the proposed policy performs better than the previously known policies for the workloads we considered. Especially, we can see that our policy outperforms the existing ones in such applications that have reference patterns of re-accessing the frequently referenced pages in the past after some time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.609-609
• /
• 1994

• Journal of the military operations research society of Korea
• /
• v.4 no.1
• /
• pp.113-123
• /
• 1978

Consider a series system of two units, named 1 and 2, respectively. Two units are observed at the beginning of discrete time periods t=0,1,2, $cdots$ and classified as being in one of a countable number of states. Let (i, r) be a state of the system at time t, when the state of unit 1 is i and state of unit 2 is r at time t, Under some conditions, the opportunistic replacement policy that minimizes the expected total discounted cost or the average cost of maintenance is shown to be characterized by the control limits $i^{*}(r)$ (a function of r) and $r^{*}(i)$ (a function of i) : (a) in observed state (i, r), the optimal policy for unit 1 is to replace if $i{\ge}i^{*}(r)$ and no action otherwise; (b) in observed state (i, r), the optimal policy for unit 2 is to replace if $r{\ge}r^{*}(i)$ and no action otherwise. In addition, this paper also develops optimal policy in the finite time horizon case, where time horizon is fixed or a finite integer valued r.v. with known pmf.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.6
• /
• pp.1557-1564
• /
• 2016

Recently, an extended warranty of a system following the expiration of the basic warranty is becoming increasingly popular to the user. In this respect, we suggest a two stage maintenance policy under the non-renewing warranty from the user's point of view in this paper. In the first stage, the user has to decide whether or not to purchase the extended warranty period. And, in the second stage, the optimal replacement period following the expiration of the warranty is determined. Under the extended warranty, the failed system is minimally repaired by the manufacturer at no cost to the user. We utilize the expected cost from the user's perspective to determine the optimal two stage maintenance policy. Finally, a few numerical examples are given for illustrative purpose.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.4 no.1
• /
• pp.170-176
• /
• 2001

An optimization problem to obtain the optimal replacement interval considering the salvage values is studied. The system is minimally repaired at failure and is replaced by new one at age T(periodic replacement policy with minimal repair of Barlow and Hunter〔2〕). Our model assumes that the time horizon associated with the number of replacements is random The total expected cost considering the salvage values with random time horizon is obtained and the optimal replacement interval minimizing the cost is found by numerical methods. Comparisons between non-considered salvage values and this case are made by a numerical example.

• Journal of Korean Society for Quality Management
• /
• v.24 no.1
• /
• pp.1-9
• /
• 1996

Ritchken(1985) analyzes free replacement and pro-rata warranty policies for products receiving renewable warranies. He shows that for constant failure rates pro-rata warranty policies are more attractive to risk-averse manufacturers than shorter term free replacement policies that result in the same average warranty cost. This paper considers the case when product lifetimes distributions are of phase-type. When this is so, Ritchken's performance measures can be simplified considerably. It is found, that irrespective of the pattern of failure rates, pro-rata warranty policies are preferable to free replacement policies. But the warranty period of the equivalent free replacement policy decreases and then increases, as product reliability(the average time between failures) increases.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.75-86
• /
• 1989

Joint stocking and preventive age replacement policy is considered for non-repairable items assuming instantaneous replenishment. A recursive relationship among the optimal preventive replacement ages is obtained, which shows that the preventive replacement ages in a replenishment cycle form an increasing sequence due to the inventory carrying cost. Using this relationship, a procedure is given for determining how many units to purchase on each order and when to replace each unit after it has begun operating so as to minimize the total cost per unit time over an infinite time span. The problem can be simplified if equal preventive replacement ages are assumed, and the solution is very close to that of the original unconstrained problem.

• Journal of Applied Reliability
• /
• v.13 no.2
• /
• pp.77-86
• /
• 2013

Recently, an extended warranty of a system following the expiration of the basic warranty is becoming increasingly popular to the user. In this respect, we suggest a replacement model following the expiration of extended warranty with minimal repair warranty from the user's point of view in this paper. Under extended warranty, the failed system is minimally repaired by the manufacturer at no cost to the user during the original extended warranty period. As a criterion of the optimality, we utilize the expected cost rate per unit time during the life cycle from the user's perspective and suggest the optimal replacement period after extended warranty. Finally, a few numerical examples are given for illustrative purpose.

• Journal of the Korea Society for Simulation
• /
• v.12 no.2
• /
• pp.35-44
• /
• 2003

The effectiveness of buffer cache replacement algorithms is critical to the performance of I/O systems. In this paper, we propose the degree of inter-reference gap (DIG) based block replacement scheme that retains merits of the least recently used (LRU) such as simple implementation and good cache hit ratio (CHR) for general patterns of references, and improves CHR further. In the proposed scheme, cache blocks with low DIGs are distinguished from blocks with high DIGs and the replacement block is selected among high DIGs blocks as done in the low inter-reference recency set (LIRS) scheme. Thus, by having the effect of the partitioning the cache memory dynamically based on DIGs, CHR is improved. Trace-driven simulation is employed to verified the superiority of the DIG based scheme and shows that the performance improves up to about 175% compared to the LRU scheme and 3% compared to the LIRS scheme for the same traces.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.3
• /
• pp.1-8
• /
• 2018

In this paper, we propose a new page replacement policy using recency and frequency on hybrid main memory. The proposal has two features. First, when a page fault occurs in the main memory, the proposal allocates it to DRAM, regardless of operation types such as read or write. The page allocated by the page fault is likely to be high probability of re-reference in the near future. Our allocation can reduce the frequency of write operations in PCM. Second, if the write operations are frequently performed on pages of PCM, the pages are migrated from PCM to DRAM. Otherwise, the pages are maintained in PCM, to reduce the number of unnecessary page migrations from PCM. In our experiments, the proposal reduced the number of page migrations from PCM about 32.12% on average and reduced the number of write operations in PCM about 44.64% on average, compared to CLOCK-DWF. Moreover, the proposal reduced the energy consumption about 15.61%, and 3.04%, compared to other page replacement policies.