Takashi Hoshino
Takashi Hoshino has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Haruto Tanno
NTT Cyber Space Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka, Japan
1 shared publication- Hideyuki Kawashima
Faculty of Environment and Information Studies, Keio University, Fujisawa, Japan
1 shared publication - Kenji Takahashi
Dept. Vet. Pharmacol., Fac. Agric., Tottori Univ
1 shared publication - Kenjiro Taura
The University of Tokyo, Tokyo, Japan
1 shared publication - Kodai Doki
Keio University, Fujisawa, Kanagawa, Japan
1 shared publication Kumi Jinzenji
NTT Software Innovation Canter NTT Corporation
1 shared publication
Latest Publications
- Open Access
- 28 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 115-127
Fairer and More Scalable Reader-Writer Locks by Optimizing Queue Management
MCS lock and its variants provide scalability on many-core architectures, using lists of lock requests to reduce access contention on the mutex data. Most recent variants have adopted a two-stage design, allowing requests to be allocated from stack memory rather than heap. However, this design still produces mutex access contention and limits fairness in the presence of fast paths. This paper proposes the Freezer mechanism and its optimization methods, which extend the list structure operations of MCS lock, to reduce mutex access without using heap memory and enable an independent choice of fairness policies and fast paths. Additionally, we propose four optimization methods for queue-based reader-writer locks. Our evaluation using three benchmarks demonstrated the effectiveness of the proposed fair reader-writer locks. They achieved up to 3.5× higher throughput and improved tail latency by up to 2.7× compared to the baselines.
- 28 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 115-127
Open AccessFairer and More Scalable Reader-Writer Locks by Optimizing Queue Management
MCS lock and its variants provide scalability on many-core architectures, using lists of lock requests to reduce access contention on the mutex data. Most recent variants have adopted a two-stage design, allowing requests to be allocated from stack memory rather than heap. However, this design still produces mutex access contention and limits fairness in the presence of fast paths. This paper proposes the Freezer mechanism and its optimization methods, which extend the list structure operations of MCS lock, to reduce mutex access without using heap memory and enable an independent choice of fairness policies and fast paths. Additionally, we propose four optimization methods for queue-based reader-writer locks. Our evaluation using three benchmarks demonstrated the effectiveness of the proposed fair reader-writer locks. They achieved up to 3.5× higher throughput and improved tail latency by up to 2.7× compared to the baselines.
- Open Access
- 4 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 130-135
WoundDie: Concurrency Control Protocol with Lightweight Priority Control
Recent concurrency control protocols for database transactions employ priority control to deliver predictable latency. Conventional protocols either require complex data structures or provide incomplete priority control that has a parameter and does not ensure starvation-freedom. To address this issue, we propose a new protocol, WoundDie, which ensures starvation-freedom without parameters. Unlike conventional starvation-free protocols, it does not require complex data structures for locking, making it memory-efficient and easy to implement. Experimental results demonstrated that under a high contention workload, WoundDie exhibited tail latency that was 6.5 times lower than Polaris's best case and 80 times lower than its worst case.
- 4 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 130-135
Open AccessWoundDie: Concurrency Control Protocol with Lightweight Priority Control
Recent concurrency control protocols for database transactions employ priority control to deliver predictable latency. Conventional protocols either require complex data structures or provide incomplete priority control that has a parameter and does not ensure starvation-freedom. To address this issue, we propose a new protocol, WoundDie, which ensures starvation-freedom without parameters. Unlike conventional starvation-free protocols, it does not require complex data structures for locking, making it memory-efficient and easy to implement. Experimental results demonstrated that under a high contention workload, WoundDie exhibited tail latency that was 6.5 times lower than Polaris's best case and 80 times lower than its worst case.
- 1 November 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. j88 d ii (10719458) , 310-319
An experience report for software quality evaluation in highly iterative development methodology using traditional metrics
The use of highly iterative software development methodologies, such as Agile and Lean, have been growing. However, these methodologies do not explicitly provide practices for managing and measuring software quality. This deficiency may prevent software development organizations in critical domains from transforming from traditional development to highly iterative development. These organizations may need to manage quality during development and may desire to compare with the quality of a large number of products produced in the past. In this paper, we focus on the reliability aspects of software quality and discuss the applicability of conventional reliability metrics to iterative development. First, we defined the general process structure in iterative development. Then, we present an associated quality evaluation scheme closely. Our experimental results indicate that traditional quality metrics were applicable to iterative development and that the iterative development achieved maturity sufficient for the commercial release.
- 1 November 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. j88 d ii (10719458) , 310-319
An experience report for software quality evaluation in highly iterative development methodology using traditional metrics
The use of highly iterative software development methodologies, such as Agile and Lean, have been growing. However, these methodologies do not explicitly provide practices for managing and measuring software quality. This deficiency may prevent software development organizations in critical domains from transforming from traditional development to highly iterative development. These organizations may need to manage quality during development and may desire to compare with the quality of a large number of products produced in the past. In this paper, we focus on the reliability aspects of software quality and discuss the applicability of conventional reliability metrics to iterative development. First, we defined the general process structure in iterative development. Then, we present an associated quality evaluation scheme closely. Our experimental results indicate that traditional quality metrics were applicable to iterative development and that the iterative development achieved maturity sufficient for the commercial release.
- 1 March 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 559-560
Introducing Test Case Derivation Techniques into Traditional Software Development: Obstacles and Potentialities
In traditional development, extracting test cases manually is an effort-consuming and error-prone process. To examine whether automation techniques can be integrated into such traditional development, we implemented our previously proposed method to "TesMa", a test case generation tool. We had a case study to evaluate the effectiveness and the cost.
- 1 March 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 559-560
Introducing Test Case Derivation Techniques into Traditional Software Development: Obstacles and Potentialities
In traditional development, extracting test cases manually is an effort-consuming and error-prone process. To examine whether automation techniques can be integrated into such traditional development, we implemented our previously proposed method to "TesMa", a test case generation tool. We had a case study to evaluate the effectiveness and the cost.