Sciweavers

324 search results - page 2 / 65
» Two-way Replacement Selection
Sort
View
ICS
2004
Tsinghua U.
13 years 11 months ago
Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Masamichi Takagi, Kei Hiraki
CEC
2009
IEEE
14 years 11 days ago
Evolution of cooperation on different pairs of interaction and replacement networks with various intensity of selection
— There are various discussions on the evolution of cooperation on different pairs of interaction network for playing games and the replacement network for imitation of strategie...
Reiji Suzuki, Takaya Arita
PVLDB
2010
112views more  PVLDB 2010»
13 years 4 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
VLDB
2002
ACM
141views Database» more  VLDB 2002»
13 years 5 months ago
A Multi-version Cache Replacement and Prefetching Policy for Hybrid Data Delivery Environments
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...
André Seifert, Marc H. Scholl