川島　英之 （カワシマ　ヒデユキ）

Kawashima, Hideyuki

写真a

所属（所属キャンパス）

環境情報学部 （湘南藤沢）

職名

准教授

HP
このページの先頭へ▲
 

論文 【 表示 ／ 非表示 】

  • Decentralization of Two Phase Locking based Protocols

    Nakamori T., Nemoto J., Hoshino T., Kawashima H.

    HPDC 2022 - Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing （HPDC 2022 - Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing）     281 - 282 2022年06月

    　概要を見る

    Bamboo is a state-of-the-art concurrency control protocol based on the 2-phase locking protocol. One problem of Bamboo is that it requires transactions to fetch timestamps from a single centralized atomic counter. To replace the concentrated access to it, each transaction should generate timestamps independently. This paper proposes thread-ID method (TID), which dismisses the process of fetching timestamps entirely by assigning an ID to each thread, and transactions use the thread IDs as their timestamps. In high-contention settings, the performance of TID plummets, but proposed optimization FairTID sustains the performance. The experiments measured an improvement of up to 60% from Bamboo with the proposed method.

  • Stable Low Latency Logging for Epoch-based In-memory Database

    Tanaka M., Kawashima H.

    Proceedings - 2022 IEEE International Conference on Big Data and Smart Computing, BigComp 2022 （Proceedings - 2022 IEEE International Conference on Big Data and Smart Computing, BigComp 2022）     167 - 170 2022年

    　概要を見る

    We design and implement a logging method for the Silo concurrency control protocol and evaluate its performance. We also propose a low-latency method for Silo logging for real-time use and support threaded memory allocation for the NUMA architecture in the Silo logging implementation. The results of an experiment in which epochs were proceeded in increments of 4 ms demonstrated that the proposed method reduced the latency by 80% in exchange for a 35% reduction in throughput performance.

  • Removing Performance Bottleneck of Timestamp Allocation in Two-Phase Locking Based Protocol

    Nakamori T., Nemoto J., Hoshino T., Kawashima H.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) （Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)）  13459 LNCS   201 - 208 2022年

    ISSN  03029743

    　概要を見る

    Concurrency control ensures the correctness of databases when transactions are processed in parallel. Bamboo is a state-of-the-art concurrency control protocol. One problem of Bamboo is that it requires transactions to fetch timestamps from a single centralized atomic counter. To replace the concentrated access to it, each transaction should generate timestamps independently. This paper proposes two methods of decentralization to address the problem. The first is the thread-ID method (TID): transactions use thread IDs as their timestamps. In high-contention settings, the performance of TID plummets, but proposed optimization FairTID sustains the performance. The second method (RandID) allocates timestamps using random-number generators. Experiments indicated that there were up to 60% and 34% improvement in throughput from Bamboo with FairTID and RandID, respectively. In high-contention settings, TID recorded 24% degradation, but FairTID and RandID showed 19% to 31% and 12% to 22% improvement from Bamboo, respectively.

  • Practical Effectiveness of Quantum Annealing for Shift Scheduling Problem

    Hamada N., Saito K., Kawashima H.

    Proceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022 （Proceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022）     421 - 424 2022年

    　概要を見る

    Quantum annealing (QA) is a novel computing approach for solving computationally demanding problems more rapidly than approaches using classical computers by exploiting parallelism in the variable state updates (spin updates). A number of previous studies have shown that QA performs well in benchmarking combinatorial optimization problems, but no works have evaluated QA in the shift scheduling problem. This paper formulates it for QA and evaluates the effectiveness of QA in comparison with other methods on a classical computer. We confirmed that QA is up to about 14 times faster than classical methods in obtaining high-quality solutions for several instances.

  • Oze: Decentralized Graph-based Concurrency Control for Real-world Long Transactions on BoM Benchmark.

    Jun Nemoto, Takashi Kambayashi, Takashi Hoshino, Hideyuki Kawashima

    abs/2210.04179 2022年

全件表示 >>

このページの先頭へ▲

KOARA（リポジトリ）収録論文等 【 表示 ／ 非表示 】

このページの先頭へ▲

競争的研究費の研究課題 【 表示 ／ 非表示 】

  • 自律移動ロボットに資する迅律データシステムの創出

    2022年04月
    -
    2025年03月

    文部科学省・日本学術振興会, 科学研究費助成事業, 川島 英之, 基盤研究(B), 補助金,  研究代表者

  • データ集約型科学に資するリアルタイムデータカーネルの創出

    2019年04月
    -
    2022年03月

    文部科学省・日本学術振興会, 科学研究費助成事業, 川島　英之, 基盤研究（Ｂ）, 補助金,  研究代表者

このページの先頭へ▲
 

担当授業科目 【 表示 ／ 非表示 】

  • 研究会Ｂ

    2024年度

  • 折紙の科学

    2024年度

  • 最適化の数理

    2024年度

  • 修士研究会

    2024年度

  • 特別研究

    2024年度

全件表示 >>

このページの先頭へ▲