HHHiroki Honda

Hiroki Honda

*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


Hiroki Honda has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Analysis of MPI Parallel Code Generated by GPT-4o

    by Rin Tanaka, Hayato Yamaki, Shinobu Miwa, Hiroki Honda

  • Open Access

    VAHRM: Variation-Aware Resource Management in Heterogeneous Supercomputing Systems

    by Kohei Yoshida, Ryuichi Sakamoto, Kento Sato, Abhinav Bhatele, Hayato Yamaki, Hiroki Honda, Shinobu Miwa

    In this paper, we propose a novel resource management technique for heterogeneous supercomputing systems affected by manufacturing variability. Our proposed technique called VAHRM (Variation-Aware Heterogeneous Resource Management) takes a holistic approach to job scheduling on highly heterogeneous computing resources. VAHRM preferentially allocates energy-efficient computing resources to an energy-consuming job in a job queue, considering the impact on both the job turnaround time and the power consumption of individual resources. Furthermore, we have developed a novel approach to modeling the power consumption of computing resources that have manufacturing variability. Our approach called TSMVA (Two-Stage Modeling with Variation Awareness) enables us to generate the first variation-aware GPU power models, which can correctly estimate the power consumption of each GPU for a given job. Our experimental results show that, compared to conventional first-come-first-serve (FCFS) and state-of-the-art variation-aware scheduling algorithms, VAHRM can achieve respective improvements in system energy efficiency of up to 5.8% and 5.4% (4.5% and 4.2% on average) while reducing the average turnaround time of 21.2% and 11.9%, respectively, for various workloads obtained from a production system.


  • Open Access

    CACTI-CNFET: an Analytical Tool for Timing, Power, and Area of SRAMs with Carbon Nanotube Field Effect Transistors

    by Shinobu Miwa, Eiichiro Sekikawa, Tongxin Yang, Ryota Shioya, Hayato Yamaki, Hiroki Honda

    Carbon nanotube field effect transistors (CNFETs) are expected to replace silicon-based metal oxide semiconductor field effect transistors (MOSFETs) to improve the power efficiency and performance of microprocessors. However, the design of CNFET processors is not as mature as that of silicon-based processors because there is no architecture-level analytical tool for CNFET processors. Since circuit-level analysis such as RTL analysis is a very time-consuming and troublesome task, architecture-level analysis is needed for the rapid design of processors optimized for CNFETs. In this paper, we propose CACTI-CNFET, the first architecture-level analytical tool for SRAMs designed with CNFETs. Similar to CACTI, a widely used tool for analyzing silicon-based SRAMs, CACTI-CNFET allows us to quickly estimate the timing, power, and area of CNFET SRAMs only with architecture-level descriptions such as memory capacity and port count, thus helping us make a quick decision on the architecture of various SRAMs used in a targeted processor. Because CACTI-CNFET is implemented on top of CACTI and published as an open source project, all CACTI users can use and extend this new functionality freely. Our experimental results show that CACTI-CNFET can estimate the leakage power, dynamic energy consumption for write and read operations, and circuit delay of various CNFET SRAMs with average errors of 7.40%, 7.08%, 2.36%, and 8.33%, respectively. Moreover, our experimental results show that CACTI-CNFET can estimate the area of a CNFET SRAM with an error of 10.25%.

  • Open Access

    CNFET-OCL: Open-Source Cell Libraries for Advanced CNFET Technologies

    by Chenlin Shi, Shinobu Miwa, Tongxin Yang, Ryota Shioya, Hayato Yamaki, Hiroki Honda

    In this paper, we propose CNFET-OCL, the first open-source cell libraries for 5-nm and 7-nm carbon nanotube field-effect transistor (CNFET) technologies. Our CNFET-OCL is designed to emulate the predictive 5-nm and 7-nm CNFET technologies presented in a published paper. We achieved this by performing a number of SPICE simulations based on an open-source CNFET SPICE model and making certain assumptions used in previous work. Each of our cell libraries includes two types of delay model (i.e., the composite current source and nonlinear delay model), each having 56 typical standard cells, which is sufficient to design various VLSI circuits. CNFET-OCL fully supports both logic synthesis and timing-driven place and route design in the Cadence design flow. Our experimental results demonstrate that CNFET-OCL can achieve performance levels comparable to those reported in previous studies on CNFETs. Consequently, CNFET-OCL can serve as an effective evaluation tool for the CNFET research community.


  • Footprint-Based DIMM Hotplug

    by Shinobu Miwa, Masaya Ishihara, Hayato Yamaki, Hiroki Honda, Martin Schultz

    Power-efficiency has become one of the most critical concerns for HPC as we continue to scale computational capabilities. A significant fraction of system power is spent on large main memories, mainly caused by the substantial amount of DIMM standby power needed. However, while necessary for some workloads, for many workloads large memory configurations are too rich, i.e., these workloads only make use of a fraction of the available memory, causing unnecessary power usage. This observation opens new opportunities for power reduction by powering DIMMs on and off depending on the current workload. In this paper, we propose footprint-based DIMM hotplug that enables a compute node to adjust the number of DIMMs that are powered on depending on the memory footprint of a running job. Our technique relies on two main subcomponents-memory footprint monitoring and DIMM management-which we both implement as part of an optimized page management system with small control overhead. Using Linux's memory hotplug capabilities, we implement our approach on a real system, and our results show that our proposed technique can save 50.3–51.7% of the DIMM standby energy and the CPU+DRAM energy of up to 1.48 Wh for various small-memory-footprint applications without loss of performance.


  • Unified Programming Environment for Heterogeneous Distributed Parallel Systems

    by Shoichi Hirasawa, Hiroki Honda

    Parallel execution environment, such as the multi-core CPU, a cluster, and a grid, has spread increasingly. The change from a homogeneous core based CPU and a shared memory to the distributed memory and the heterogeneous core based CPU is making system architecture complicated. The programming interface and programming model which are different in each parallel execution environment are used. Since this serves as a burden for users, it has barred the spread of parallel execution environment. In this paper, the execution model which treats such system architecture systematically is explored. This performs the unified programming interface for heterogeneous distributed memory system architecture.

  • Reduction of synchronous write response time on call control server

    by Takashi Ikebe, Naoki Uchida, Shoichi Hirasawa, Hiroki Honda

    Today, call control servers use COTS (commercial off-the-shelf) components such as Advanced Telecom Computing Architecture (ATCA) and Carrier Grade Linux. However, the adoption of COTS components causes an increase in the maximum response time of high-priority write system call during synchronous state transitions and recording whenever IO operation is congested by normal-priority IO requests. Call control is a real-time operation; the delay of state transition makes service quality worse and sometimes causes fail-over of service. The delays may occur due to failure of software and hardware. However, even if there are no failures, the response time of high-priority write system call sporadic delays due to insufficient consideration about the IO prioritization by the OS. We present reduction of bottlenecks of the file system operation and IO scheduler mechanism in the kernel to reduce the maximum response time of high-priority write system call. The evaluation demonstrates that the presented approach shortens the maximum response time of high-priority write system call with sufficient reliability.

  • Runtime software modification method used on COTS system for high-availability network service

    by Takashi Ikebe, Yasuro Kawarasaki, Naoki Uchida, Shoichi Hirasawa, Hiroki Honda