Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Fluid Limit
Replacement Policy
Subscribe
Academic
Publications
Analysis of Page Replacement Policies in the Fluid Limit
Analysis of Page Replacement Policies in the Fluid Limit,10.1287/opre.1090.0761,Operations Research,Ryo Hirade,Takayuki Osogami
Edit
Analysis of Page Replacement Policies in the Fluid Limit
(
Citations: 2
)
BibTex

RIS

RefWorks
Download
Ryo Hirade
,
Takayuki Osogami
Journal:
Operations Research
, vol. 58, no. 4Part1, pp. 971984, 2010
DOI:
10.1287/opre.1090.0761
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
(
or.journal.informs.org
)
Citation Context
(2)
...Hirade and Osogami [
7
] show that the miss probabilities for LRU and the 2Q cache algorithm [12], respectively, can be closely approximated with those analyzed in a fluid limit...
...Our fluid limit is a nontrivial extension of the fluid limits for the independent reference model in [8], [
7
]...
...Such scaled systems are also considered in [
7
], [8]...
...For example, the mth scaled system, S (m) , of [
7
] can be seen...
...Also, in contrast to [
7
], [8], we will define a sequence of scaled systems for each ei, so that the scaled systems for different items have different dependencies in Φk .L etT (m) i be the mth scaled system for ei. For each ei, we will study the miss probability for the ei in T (∞) i .I nT...
...The following corollary can be compared against the stationary miss probabilities in the fluid limits obtained in [8], [
7
]...
...Since our fluid limit differs from the fluid limits defined in [8], [
7
], our ¯ (∞) i differs from those derived in [8], [7]...
...Since our fluid limit differs from the fluid limits defined in [8], [7], our ¯ (∞) i differs from those derived in [8], [
7
]...
...i and that in [
7
] is that, in [7], τi(K) is replaced with τ (K )= C −1 (K), where C −1 (·) is the inverse function of C(t )=...
...i and that in [7] is that, in [
7
], τi(K) is replaced with τ (K )= C −1 (K), where C −1 (·) is the inverse function of C(t )=...
...The differences between the fluid limits in [8] and [
7
] are discussed in [7]...
...The differences between the fluid limits in [8] and [7] are discussed in [
7
]...
...To this end, Hirade and Osogami [
7
] show that, in a fluid limit, the 2Q cache algorithm [12] can be made to have a lower miss probability than LRU by choosing the right value of the parameter of 2Q, assuming that the requests follow independent Poisson processes...
Takayuki Osogami
.
A Fluid Limit for Cache Algorithms with General Request Processes
...Hirade and Osogami [
7
] show that the miss probabilities for LRU and the 2Q cache algorithm [12], respectively, can be closely approximated with those analyzed in a fluid limit...
...Our fluid limit is a nontrivial extension of the fluid limits for the independent reference model in [8], [
7
]...
...Such scaled systems are also considered in [
7
], [8]...
...For example, the th scaled system, , of [
7
] can be seen as a superposition of independent replications of the origi nal system...
...Also, in contrast to [
7
], [8], we will define a sequence of scaled systems for each , so that the scaled systems for different items have different dependencies in . Let be the th scaled system for . For each , we will study the miss probability for the in . In , we assume that is stochastically identical to (i.e., for , it holds that for any measurable set, ). However, we assume that for depend on each other...
...The following corollary can be compared against the stationary miss probabilities in the fl uid limits obtained in [8], [
7
]...
...Since our fluid limit differs from the fluid limits defined in [8], [
7
], our differs from those derived in [8], [7]...
...Since our fluid limit differs from the fluid limits defined in [8], [7], our differs from those derived in [8], [
7
]...
...However, the only difference between our and that in [
7
] is that, in [7], is replaced with , where is the inverse function of . The differences between the fluid limits in [8] and [7] are discussed in [7]...
...However, the only difference between our and that in [7] is that, in [
7
], is replaced with , where is the inverse function of . The differences between the fluid limits in [8] and [7] are discussed in [7]...
...However, the only difference between our and that in [7] is that, in [7], is replaced with , where is the inverse function of . The differences between the fluid limits in [8] and [
7
] are discussed in [7]...
...However, the only difference between our and that in [7] is that, in [7], is replaced with , where is the inverse function of . The differences between the fluid limits in [8] and [7] are discussed in [
7
]...
...To this end, Hirade and Osogami [
7
] show that, in a fluid limit, the 2Q cache algorithm [12] can be made to have a lower miss probability than LRU by choosing the right value of the parameter of 2Q, assuming that the requests follow independent Poisson processes...
Takayuki Osogami
.
A fluid limit for cache algorithms with general request processes (ext...
Sort by:
Citations
(2)
A Fluid Limit for Cache Algorithms with General Request Processes
(
Citations: 2
)
Takayuki Osogami
Conference:
IEEE INFOCOM  INFOCOM
, pp. 28362840, 2009
A fluid limit for cache algorithms with general request processes (extended abstract)
Takayuki Osogami