An Evaluation of Generational Replacement Schemes Based on WWW Caching Proxy Server Logs

• Item type: Journal(1)
• 公開日: 1998-03-15
• タイトル: An Evaluation of Generational Replacement Schemes Based on WWW Caching Proxy Server Logs
• タイトル / 言語: en
• タイトル: An Evaluation of Generational Replacement Schemes Based on WWW Caching Proxy Server Logs
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: コンピュータネットワーク
• 著者所属: Graduate School of Information Systems the University of Electro - Communications
• 著者所属: Graduate School of Information Systems the University of Electro - Communications
• 著者所属: Graduate School of Information Systems the University of Electro - Communications
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Systems, the University of Electro - Communications
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Systems, the University of Electro - Communications
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Systems, the University of Electro - Communications
• 著者名: Noritaka, Osawa; Toshitsugu, Yuba; Katsuya, Hakozaki
• 著者名(英): Noritaka, Osawa; Toshitsugu, Yuba; Katsuya, Hakozaki
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: This paper proposes and evaluates generational replacement schemes suitable for patterns of access to World Wide Web(WWW)proxy server caches.The schemes partition a cache into generations and put frequently accessed data into older generations where entries are less likely to be replaced.With our schemes the hit rate per page is about 5.2 percentage points higher than with the Least Recently Used(LRU)algorithm using logs of more than 8 million accesses.This improvement reduces the number of cache misses by about 10.8 percent with respect to the LRU-roughly twice as good as the LRU's improvement over the First-In First-Out(FIFO)algorithm.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: This paper proposes and evaluates generational replacement schemes suitable for patterns of access to World Wide Web(WWW)proxy server caches.The schemes partition a cache into generations and put frequently accessed data into older generations where entries are less likely to be replaced.With our schemes,the hit rate per page is about 5.2 percentage points higher than with the Least Recently Used(LRU)algorithm,using logs of more than 8 million accesses.This improvement reduces the number of cache misses by about 10.8 percent with respect to the LRU-roughly twice as good as the LRU's improvement over the First-In First-Out(FIFO)algorithm.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 39, 号 3, p. 760-768, 発行日 1998-03-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764