Demo Data from EDBT 2026 / reviewers in the wild / expert
Shinichi Awamoto
dblp:223/9063
· DBLP profile ↗
3ranked-venue papers
3as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Transport protocols and congestion control · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Operating systems › i/o
kernel bypass |
0.9 | 1 | 2025 | Opening Up Kernel-Bypass TCP Stacks · USENIX ATC 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Opening Up Kernel-Bypass TCP Stacks
Shinichi Awamoto, Michio Honda |
USENIX ATC | 1 |
| 2020 | Designing a Storage Software Stack for Accelerators
Shinichi Awamoto, Erich Focht, Michio Honda |
HotStorage | 1 |
| 2018 | Scalable and Memory-Efficient Spin Locks for Embedded Tile-Based Many-Core ArchitecturesabstractEmbedded many-core System-on-Chip (SoC) architectures require scalability and memory constraints. However, communication between many cores, especially locking mechanisms of operating systems, is often the main obstacle to scalable and memory-efficient processing. Existing scalable spin locks consume non-negligible amounts of memory in many-core architectures, thus they are not suitable for memory constrained systems. This paper focuses on a combination of a global Mellor-Crummey and Scott (MCS) queue lock, and local ticket (TKT) locks. We refer to this lock as the C-MCS-TKT lock, which has much better memory efficiency than other scalable spin locks without degrading scalability. In addition, this paper also presents a memory-optimized version of the C-MCS-TKT lock, which slightly degrades scalability but reduces memory fragmentation, compared to the original C-MCS-TKT lock. Experimental results show that these locks have comparable performance to those of other highly scalable spin locks. Shinichi Awamoto, Hiroyuki Chishiro, Shinpei Kato |
ISORC | 1 |