نتایج جستجو برای: block replacement policy
تعداد نتایج: 525751 فیلتر نتایج به سال:
Web proxy caching is used to improve the performance of the Web infrastructure. It aims to reduce network traffic, server load, and user perceived retrieval delays. The heart of a caching system is its page replacement policy, which needs to make good replacement decisions when its cache is full and a new document needs to be stored. The latest and most popular replacement policies like GDSF an...
We consider the optimal replacement of a periodically inspected system under Markov deterioration that operates in a controlled environment. Provided are sufficient conditions that characterize an optimal control-limit replacement policy with respect to the system’s condition and its environment. The structure of the optimal policy is illustrated by a numerical example.
Age replacement policy is concerned with finding an optional time to minimize the cost, at which time the unit is replaced even if it does not fail. So far, age replacement policy involving random age has been proposed. This paper will assume the age of the unit is an uncertain variable, and find the optimal time to replace the unit.
PURPOSE Total knee replacement is one of the most painful orthopedic procedures, and effective pain relief is essential for early mobility and discharge from hospital. The aim of this study was to evaluate whether addition of single-injection femoral nerve block to epidural analgesia would provide better postoperative pain control, compared to epidural analgesia alone, after total knee replacem...
In this paper, we analyze access traces to a Web proxy, looking at statistical parameters to be used in the design of a replacement policy for documents held in the cache. In the first part of this paper, we present a number of properties of the lifetime and statistics of access to documents, derived from two large trace sets coming from very different proxies and spanning over time intervals o...
In this paper, a geometric process repair model for a k-dissimilar-component series repairable system with one repairman is proposed. For each component, the successive operating times form a decreasing geometric process whereas the consecutive repair times constitute an increasing geometric process. Under this assumption, we consider a replacement policyM = (N1,N2, . . . ,Nk) based respectivel...
This paper provides a replacement policy for warranty products with different failure rate from the consumer’s viewpoint. Assume that the product is replaced once within a finite planning horizon, and the failure rate of the second product is lower than the failure rate of the first product. Within warranty period (WP), the failed product is corrected by minimal repair without any cost to the c...
A cache replacement policy which take the transcoding time into account in making replacement decisions, for the emerging transcoding proxy servers is proposed. Simulation results show the proposed policy outperforms the conventional LRU in both the cache hit rate and the average object transcoding time.
Classic cache replacement policies assume that miss costs are uniform. However, the correlation between miss rate and cache performance is not as straightforward as it used to be. Ultimately, the true performance cost of a miss should be its access penalty, i.e. the actual processing bandwidth lost because of the miss. Contrary to loads, the penalty of stores is mostly hidden in modern processo...
In a personal communications service (PCS) network, mobility databases called visitor location registers (VLRs) are utilized to temporarily store the subscription data and the location information for the roaming users. Because of user mobility, it is possible that the VLR is full when a mobile user arrives. Under such a circumstance, the incoming user has no VLR record and thus cannot receive ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید