翻訳と辞書 Words near each other ・ Pseudo-Euclidean space ・ Pseudo-Ezekiel ・ Pseudo-finite field ・ Pseudo-Geber ・ Pseudo-Gregory ・ Pseudo-Hadamard transform ・ Pseudo-Hegesippus ・ Pseudo-Hurler polydystrophy ・ Pseudo-Ingulf ・ Pseudo-intersection ・ Pseudo-Isidorian Decretals ・ Pseudo-Jerome ・ Pseudo-John ・ Pseudo-Kufic ・ Pseudo-Linus ・ Pseudo-LRU ・ Pseudo-Marcellus ・ Pseudo-Mark ・ Pseudo-Martyr ・ Pseudo-Melitus ・ Pseudo-modal energies ・ Pseudo-model ・ Pseudo-monotone operator ・ Pseudo-Nero ・ Pseudo-nitzschia ・ Pseudo-octave ・ Pseudo-operation ・ Pseudo-order ・ Pseudo-oxocarbon anion ・ Pseudo-penis Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Pseudo-LRU ： ウィキペディア英語版 Pseudo-LRU Pseudo-LRU is a cache algorithm created to improve the Least Recently Used (LRU) algorithm. PLRU usually refers to two cache replacement algorithms: tree-PLRU and bit-PLRU. ==Tree-PLRU== Tree-PLRU is an efficient algorithm to select an item that most likely has not been accessed very recently, given a set of items and a sequence of access events to the items. This technique is used in the CPU cache of the Intel 486 and in many processors in the Power Architecture (formerly PowerPC) family, such as Freescale's PowerPC G4 used by Apple Computer. The algorithm works as follows: consider a binary search tree for the items in question. Each node of the tree has a one-bit flag denoting "go left to find a pseudo-LRU element" or "go right to find a pseudo-LRU element". To find a pseudo-LRU element, traverse the tree according to the values of the flags. To update the tree with an access to an item N, traverse the tree to find N and, during the traversal, set the node flags to denote the direction that is opposite to the direction taken. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Pseudo-LRU」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.