Ryota Yasudo

Dr. Ryota Yasudo


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2022 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
RYRyota Yasudo
Ryota Yasudo
KNKoji Nakano
Koji Nakano
YIYasuaki Ito
Yasuaki Ito
RKRyota Katsuki
Ryota Katsuki
YTYusuke Tabata
Yusuke Tabata
KHKenichiro Hamano
Kenichiro Hamano

19 August 2021 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
HKHiroshi Kagawa
Hiroshi Kagawa
Yasuaki ItoYasuaki Ito
Yasuaki Ito
KNKoji Nakano
Koji Nakano
RYRyota Yasudo
Ryota Yasudo
YKYuya Kawamata
Yuya Kawamata
KHKenichiro Hamano
Kenichiro Hamano

7 August 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
RYRyota Yasudo
Ryota Yasudo
MKMichihiro Koibuchi
Michihiro Koibuchi
KNKoji Nakano
Koji Nakano
HMHiroki Matsutani
Hiroki Matsutani
HAHideharu Amano
Hideharu Amano
This paper aims at establishing a method for designing high-performance network topologies to bridge a gap between theoretical and practical studies. To this end, we present a novel graph called a host-switch graph, which consists of host vertices and switch vertices with maximum degree 1 and r, respectively. This graph represents a network topology of a practical parallel/distributed computer system with host computers connected by r-port switches. We discuss important metrics for designing high performance interconnection networks: the host-to-host average shortest path length (h-ASPL) and the bisection width (BiW). In particular, we explore a method for constructing host-switch graphs with low h-ASPL and high BiW that connect the fixed number of hosts via any number of r-port switches. We demonstrate that the number of switches that provides the minimum h-ASPL can mathematically be approximated, and the minimum number of switches that provides a certain BiW can experimentally be approximated. On the basis of the approximations, we propose a randomized algorithm for searching host-switch graphs. We then apply the graphs to interconnection networks and compare them with typical network topologies. As compared with the torus, the dragonfly, and the fat-tree, our networks attain higher performance and smaller power and costs.

25 May 2025
Verified
Conference Paper
Open access
ZQZhiqiang Que
Zhiqiang Que
HFHongxiang Fan
Hongxiang Fan
GFGabriel Figueiredo
Gabriel Figueiredo
CGCe Guo
Ce Guo
WLWayne Luk
Wayne Luk
MMMasato Motomura
Masato Motomura

1 November 2021
Verified
Conference Paper
Closed access
TITomohiro Imanaga
Tomohiro Imanaga
KNKoji Nakano
Koji Nakano
RYRyota Yasudo
Ryota Yasudo
Yasuaki ItoYasuaki Ito
Yasuaki Ito
YKYuya Kawamata
Yuya Kawamata
KHKenichiro Hamano
Kenichiro Hamano
Quadratic Unconstraint Binary Optimization (QUBO) is a combinatorial optimization problem such that an $n\times n$ upper triangle matrix $W$ is given and the objective is to find an n-bit vector $X$ that minimizes the energy value $E(X)=X^{T}WX$ . A QUBO instance $W$ is sparse if instance $W$ has few non-zero elements. The D-Wave 2000 $Q$ is a quantum annealer that can solve 2048-bit sparse QUBO instances represented as a Chimera graph topology. We present a sparse QUBO solver running on GPUs for 2048-bit sparse QUBO with a Chimera graph topology. We have evaluated the performance of our sparse QUBO solver and the D-Wave 2000Q for solving 2048-bit QUBO instances with various resolutions. The experimental results show that our sparse QUBO solver running on a GPU cloud server with 8 NVIDIA A100 GPUs can find optimal solutions in less than 3ms for all instances while the D-Wave 2000 $Q$ cannot find them in 996.7ms. Hence, our QUBO solver can find better solutions than the D-Wave 2000Q in less than 1/300 running time. We can think that our QUBO solver is a quantum annealer simulator with better performance in terms of the accuracy of solutions and the running time. Our result implies that quantum annealer D-Wave 2000 $Q$ does not achieve quantum supremacy yet.

1 September 2014
Verified
Conference Paper
Closed access
RYRyota Yasudo
Ryota Yasudo
TKTakahiro Kagami
Takahiro Kagami
HAHideharu Amano
Hideharu Amano
YNYasunobu Nakase
Yasunobu Nakase
MWMasashi Watanabe
Masashi Watanabe
TNTadao Nakamura
Tadao Nakamura
Power consumption of Network-on-Chip (NoC) is becoming more important in many core processors. Input buffers utilized in routers consume a significant part of the total power of NoCs. In order to reduce this power consumption, a novel power efficient memory called Marching Memory Through type (MMTH) is introduced. By connecting transparent latches in tandem, MMTH achieves high speed operation with a low power consumption. MMTH, however, requires a certain overhead at read operation, and hence we propose a latency reduction scheme based on the look-ahead routing. The proposed router was designed in Renesas's 40nm process and compared with a standard router using conventional register-based FIFOs in terms of the network performance, application performance, and power consumption. The result of evaluation shows that the proposed router reduces the power consumption by 42.4% on average at 2GHz and the expense of only 0.5-2.0% performance overhead.