YHYao Hu

Yao Hu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yao Hu has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Integrating Quantum and HPC: A Prototype Hybrid Implementation and Benchmark of Quantum-Selected Configuration Interaction

    by Ikko Hamamura, Toshiyuki Imamura, Takashi Arakawa, Shinji Sumimoto, Kazuya Yamazaki, Yao Hu, Shinnosuke Furuya, Kengo Nakajima


  • Open Access

    Lossy Compressed Collective Inter-FPGA Communications

    by Michihiro Koibuchi, Yoshinobu Ishida, Shoichi Hirasawa, Yao Hu, Takumi Honda, Yusuke Nagasaka, Naoto Fukumoto


  • Parallel Computation of Random Walks on Distributed Graphs

    by Yao Hu

    A random walk is a process in which a random walker takes consecutive steps in space at equal intervals of time, with the length and direction of each step determined independently. Models related to random walks have been applied in diverse areas such as prediction, recommendation algorithms, and more recently, supervised learning and network analysis. Notably, there is a shortage of parallel computing models for random walks on distributed graphs across various scenarios. Therefore, the objective of this work is to offer a versatile model for random walks on distributed graphs, covering network principles and algorithmic models, followed by their parallel implementations. Evaluation results demonstrate the remarkable efficiency of our network model and highlight the future prospects of parallel random walks.

  • Open Access

    Exploring Approximate Communication Using Lossy Bitwise Compression on Interconnection Networks

    by Yao Hu

    The use of approximate communication has emerged as a promising approach for enhancing the efficiency of communication in parallel computer systems. By sending incomplete or imprecise messages, approximate communication can significantly reduce communication time. In this study, we examine application-level techniques for approximate communication to enable high portability on high-performance interconnection networks. Specifically, we focus on lossy compression of floating-point data, which is frequently exchanged between compute nodes in parallel applications. Our approach involves a simple application scenario where a source process compresses a communication dataset and a destination process decompresses it in an MPI parallel program. We use two bitwise procedures for compression: lossy bit-zip compression and lossless bit-mask compression. Our aim is to transmit the largest possible amount of approximate data with the least possible compression overhead. Additionally, we explore error check and correction techniques to ensure bit-flip fault tolerance for the compressed data during transmission. We implement our scheme in several communication-intensive MPI applications and demonstrate that our approximate communication approach effectively speeds up total execution time while staying within a specified quality-of-result error bound .


  • Open Access

    Accelerating Parallel Applications Based on Graph Reordering for Random Network Topologies

    by Yao Hu

    The Message Passing Interface (MPI) is a crucial programming tool for enabling communication between processes in parallel applications. The goal of MPI users is to allocate tasks to processors in a way that maximizes both spatial and temporal locality in the network. However, this can be challenging, especially in large-scale networks where maximizing processor locality may not be feasible at runtime. To address this issue, we propose the use of Hamorder , an offline node reassignment approach that takes into account physical processor locations based on graph reordering for Random network topologies. Hamorder aims to optimize task mapping for improved performance in parallel applications, whether for multiple tasks or within a single task. Additionally, we investigate the potential of improving MPI applications through runtime parameter tuning based on Hamorder . Our evaluation results show that Hamorder provides a 27.3% improvement in performance compared to the Gorder algorithm on Random topologies, which is a state-of-the-art solution designed with the aim of enhancing cache locality and achieves this goal by rearranging the vertices of a graph in a way that places the vertices that are typically accessed together in close proximity. Moreover, our autotuning framework using Hamorder results in an average speedup of 1.38x for targeted MPI applications by searching through various runtime parameter combinations.