activity
20172023
most citedA cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations

11 citations · 16 across the 5 of their papers we have counts for

collaborators
Showing cs.DCShow all

5 papers · 1 filter

cs.DC20231 cited

Complete Visibility Algorithm for Autonomous Mobile Luminous Robots under an Asynchronous Scheduler on Grid Plane

Yonghwan Kim, Yoshiaki Katayama, Koichi Wada

An autonomous mobile robot system is a distributed system consisting of mobile computational entities (called robots) that autonomously and repeatedly perform three operations: Loo…

cs.DC202111 cited

A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations

Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama +1

A distributed system consisting of a huge number of computational entities is prone to faults, because faults in a few nodes cause the entire system to fail. Consequently, fault to…

cs.DC20191 cited

Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama +2

Local mutual exclusion guarantees that no two neighboring processes enter a critical section at the same time while satisfying both mutual exclusion and no starvation properties. O…

cs.DC2018

Gathering Problems for Autonomous Mobile Robots with Lights

Satoshi Terai, Koichi Wada, Yoshiaki Katayama

We study the Gathering problem for n autonomous mobile robots in semi-synchronous settings with persistent memory called light. It is well known that Gathering is impossible in a b…

cs.DC20173 cited

Optimal Asynchronous Rendezvous for Mobile Robots with Lights

Takashi Okumura, Koichi Wada, Yoshiaki Katayama

We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible when robot…