Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kenichi Yasukata

dblp:124/2715 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
4since 2021 · last 2025
0000-0002-7866-2245ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 4 first-author · 2 since 2021Software engineering, systems software and programming languages · 4 · 1 first-author · 3 since 2021Computer networks · 1 · 1 first-author

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.

Software engineering, system software, and programming languages
4 papers
Operating systems · 75% Compilers and program optimization · 25%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Cloud and datacenter computing · 80% Memory systems · 8% Embedded and real-time systems · 6%
Computer networks
2 papers
Datacenter networks · 74% Internet of things and sensor networks · 26%
Network and information security
1 paper
Systems and software security · 100%

Topics — the 16 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
virtualization
0.922023
Exit-Less, Isolated, and Shared Access for Virtual Machines · ASPLOS (3) 2023
My VM is Lighter (and Safer) than your Container · SOSP 2017
Compilers and program optimization
binary rewriting
0.712023
zpoline: a system call hook mechanism based on binary rewriting · USENIX ATC 2023
Operating systems › operating system interface › system call
system call interposition
0.712023
zpoline: a system call hook mechanism based on binary rewriting · USENIX ATC 2023
Cloud and datacenter computing › virtualization › virtual machine memory management
virtual machine memory sharing
0.712023
Exit-Less, Isolated, and Shared Access for Virtual Machines · ASPLOS (3) 2023
Operating systems › virtualization
containers
0.312017
My VM is Lighter (and Safer) than your Container · SOSP 2017
Operating systems › system security › operating system security › protection mechanism › isolation
container isolation
0.312017
My VM is Lighter (and Safer) than your Container · SOSP 2017
Cloud and datacenter computing › virtualization › virtualization security
virtual machine isolation
0.312017
My VM is Lighter (and Safer) than your Container · SOSP 2017
Datacenter networks
low-latency networking
0.212016
StackMap: Low-Latency Networking with the OS Stack and Dedicated NICs · USENIX ATC 2016
Systems and software security › operating system security
sandboxing
0.212023
zpoline: a system call hook mechanism based on binary rewriting · USENIX ATC 2023
Memory systems
shared memory
0.212023
Exit-Less, Isolated, and Shared Access for Virtual Machines · ASPLOS (3) 2023
Energy-efficient computing
energy-aware scheduling
0.112012
Reducing energy consumption with batched task executions · SenSys 2012
Embedded and real-time systems
real-time scheduling
0.112012
Reducing energy consumption with batched task executions · SenSys 2012
Cloud and datacenter computing › virtualization
lightweight virtualization
0.112017
My VM is Lighter (and Safer) than your Container · SOSP 2017
Operating systems
network stack
0.112016
StackMap: Low-Latency Networking with the OS Stack and Dedicated NICs · USENIX ATC 2016
Internet of things and sensor networks
energy efficiency
0.012012
Reducing energy consumption with batched task executions · SenSys 2012
Internet of things and sensor networks › wireless sensor network
wireless sensor nodes
0.012012
Reducing energy consumption with batched task executions · SenSys 2012

Methods — techniques the papers use, named apart from their topics

extended page table · 1.3VMFUNC · 1.3isolation analysis · 0.6VM toolstack optimization · 0.6double rate bundle scheduling · 0.3
YearPublicationVenuePosition
2025 svc-hook: hooking system calls on ARM64 by binary rewriting
abstract
This paper presents svc-hook, a system call hook mechanism for the ARM64 CPU architecture. To apply system call hooks to a program, svc-hook performs binary rewriting, and specifically, it replaces svc that is a CPU instruction invoking a system call.
Akira Moroo, Hajime Tazaki, Kenichi Yasukata
Middleware3
2024 PvCC: A vCPU Scheduling Policy for DPDK-applied Systems at Multi-Tenant Edge Data Centers
abstract
This paper explores a practical means to employ Data Plane Development Kit (DPDK), a kernel-bypassing framework for packet processing, in resource-limited multi-tenant edge data centers. The problem is that the traditional virtual CPU (vCPU) schedulers are not well compatible with the event detection model of DPDK, which needs to monopolize a physical CPU (pCPU) for NIC register polling. Consequently, DPDK-applied systems running on consolidated Virtual Machines (VMs), a common setup at edges, fail to achieve low serving latencies regardless of the use of DPDK. Toward edge data center providers, this work presents a new vCPU scheduling policy named Polling vCPU Consolidation (PvCC) which runs DPDK-applied systems on dedicated pCPUs adopting microsecond-scale time slices. Along with this, we introduce a mechanism to determine an appropriate number of dedicated pCPUs according to customers' demands represented through a newly introduced vCPU scaling API enabling customers to scale up/down the vCPUs of their VMs at runtime. Our experiments show that PvCC allows DPDK-applied systems running on consolidated VMs to achieve low serving latencies, and our vCPU scaling API enables customers to adjust CPU resource assignment according to the incoming request rate and providers to effectively assign spare pCPUs to VMs executing non-latency-sensitive best-effort tasks.
Yuki Tsujimoto, Kenichi Yasukata, Kenta Ishiguro, Kenji Kono
Middleware3
2023 Exit-Less, Isolated, and Shared Access for Virtual Machines
abstract
This paper explores Exit-Less, Isolated, and Shared Access (ELISA), a novel in-memory object sharing scheme for Virtual Machines (VMs). ELISA has the isolation advantage over the shared memory directly exposed to guest VMs while its overhead is smaller than that of host-interposition relying on the costly exit from the VM context. In a nutshell, ELISA isolates shared in-memory objects by Extended Page Table (EPT) separation, and a guest VM accesses them by switching the EPT context using VMFUNC, a low-overhead CPU instruction of Intel CPUs. Our experiment shows that the overhead of ELISA is 3.5 times smaller than that of VMCALL-oriented host-interposition. We demonstrate the benefits of ELISA through two use cases; by replacing VMCALL with ELISA, a VM networking system and an in-memory key-value store exhibit 163% and 64% higher performance respectively.
Kenichi Yasukata, Hajime Tazaki, Pierre-Louis Aublin
ASPLOS (3)1
2023 zpoline: a system call hook mechanism based on binary rewriting
Kenichi Yasukata, Hajime Tazaki, Pierre-Louis Aublin, Kenta Ishiguro
USENIX ATC1
2017 HyperNF: building a high performance, high utilization and fair NFV platform
abstract
Network Function Virtualization has been touted as the silver bullet for tackling a number of operator problems, including vendor lock-in, fast deployment of new functionality, converged management, and lower expenditure since packet processing runs on inexpensive commodity servers. The reality, however, is that, in practice, it has proved hard to achieve the stable, predictable performance provided by hardware middleboxes, and so operators have essentially resorted to throwing money at the problem, deploying highly underutilized servers (e.g., one NF per CPU core) in order to guarantee high performance during peak periods and meet SLAs.
Kenichi Yasukata, Felipe Huici, Vincenzo Maffione, Giuseppe Lettieri, Michio Honda
SoCC1
2017 My VM is Lighter (and Safer) than your Container
abstract
Containers are in great demand because they are lightweight when compared to virtual machines. On the downside, containers offer weaker isolation than VMs, to the point where people run containers in virtual machines to achieve proper isolation. In this paper, we examine whether there is indeed a strict tradeoff between isolation (VMs) and efficiency (containers). We find that VMs can be as nimble as containers, as long as they are small and the toolstack is fast enough.
Filipe Manco, Costin Lupu, Florian Schmidt 0002, Jose Mendes, Simon Kuenzer, Sumit Sati, Kenichi Yasukata, Costin Raiciu, Felipe Huici
SOSP7
2017 Unikernels Everywhere: The Case for Elastic CDNs
abstract
Video streaming dominates the Internet's overall traffic mix, with reports stating that it will constitute 90% of all consumer traffic by 2019. Most of this video is delivered by Content Delivery Networks (CDNs), and, while they optimize QoE metrics such as buffering ratio and start-up time, no single CDN provides optimal performance. In this paper we make the case for elastic CDNs, the ability to build virtual CDNs on-the-fly on top of shared, third-party infrastructure at a scale. To bring this idea closer to reality we begin by large-scale simulations to quantify the effects that elastic CDNs would have if deployed, and build and evaluate MiniCache, a specialized, minimalistic virtualized content cache that runs on the Xen hypervisor. MiniCache is able to serve content at rates of up to 32 Gb/s and handle up to 600K reqs/sec on a single CPU core, as well as boot in about 90 milliseconds on x86 and around 370 milliseconds on ARM32.
Simon Kuenzer, Anton Ivanov, Filipe Manco, Jose Mendes, Yuri Volchkov, Florian Schmidt 0002, Kenichi Yasukata, Michio Honda, Felipe Huici
VEE7
2016 StackMap: Low-Latency Networking with the OS Stack and Dedicated NICs
Kenichi Yasukata, Michio Honda, Douglas Santry, Lars Eggert
USENIX ATC1
2012 Reducing energy consumption with batched task executions
abstract
In sensing systems, data compression is a promised way to save energy because it reduces the rate of data transmission, but less attention has been paid to the underlying task scheduling algorithms. We present a Double Rate Bundle Scheduling algorithm (DRBS) that maximizes the sleep state period of the CPU to reduce energy consumption. Our prototype implementation in a Mote device improves energy efficiency up to 8% compared to existing algorithms.
Kenichi Yasukata, Tetsuro Horikawa, Michio Honda, Hideyuki Tokuda
SenSys1