A Lock-free GCLOCK Page Replacement Algorithm

• YUI Makoto

  Graduate School of Information Science, Nara Institute of Science and Technology

• MIYAZAKI Jun

  Graduate School of Information Science, Nara Institute of Science and Technology

• UEMURA Shunsuke

  Department of Informatics, Faculty of Informatics, Nara Sangyo University

• KATO Hirokazu

  Graduate School of Information Science, Nara Institute of Science and Technology

Bibliographic Information

Other Title

• ロックフリーGCLOCKページ置換アルゴリズム

Abstract

We propose a lock-free variant of the GCLOCK page replacement algorithm. Concurrent access to the buffer management module is a major factor that prevents database scalability to processors. Therefore, we propose a non-blocking scheme for bufferfix operations that fix buffer frames for requested pages without locks by combining Nb-GCLOCK and a wait-free hash table. Our experimental results revealed that our scheme can obtain nearly linear scalability to processors up to 64 processors, although the existing locking-based schemes do not scale beyond 16 processors.

Journal

• IEICE technical report. Data engineering

  IEICE technical report. Data engineering 108 (329), 5-6, 2008-11-24

  The Institute of Electronics, Information and Communication Engineers

Keywords

• Buffer Management
• Page Replacement Algorithm
• Lock-Free
• CLOCK

Details

• CRID: 1573105977381868928
• NII Article ID: 110007113871
• NII Book ID: AN10012921
• Text Lang: ja
• Data Source:
  • CiNii Articles