SMShinobu Miwa

Shinobu Miwa

*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


Shinobu Miwa has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Towards Unified Acceleration: Weight-Stationary GEMM on HPC-oriented Elastic CGRAs

    by Chenlin Shi, Boma Anantasatya Adhi, Lin Teng, Jiaheng Liu, Shinobu Miwa, Kentaro Sano


  • 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.


  • Open Access

    Analyzing the Performance Impact of HPC Workloads with Gramine+SGX on 3rd Generation Xeon Scalable Processors

    by Shinobu Miwa, Shin'IChiro Matsuo

    Intel SGX, which provides a strongly isolated execution environment for running applications to protect their code and data from privileged adversaries, is hopeful for increased integrity and confidentiality in multi-user systems. However, SGX is rarely used in the field of HPC despite the increasing importance of data protection. This is because SGX had limited memory resources and required supercomputing users to modify their code for execution. Lately, both 3rd generation Xeon scalable processors, which have many advanced data protection features including increased SGX memory, and Gramine 1.0, which is the first production-ready version of a library OS for the execution of unmodified applications on SGX, were released. However, the impact of these state-of-the-art technologies on HPC workloads is not well investigated. In this paper, we provide the first performance analysis of HPC workloads with Gramine and SGX on 3rd generation Xeon scalable processors. Our analysis starts with some microbenchmarks and is then extended to various HPC workloads. Our experimental results show that Gramine+SGX shows a small performance overhead (4-17%) for both compute-intensive and memory-bandwidth-sensitive workloads but a bit large performance overhead (up to 170%) for a memory-latency-sensitive workload. In addition, we show that the combination of Gramine and a 3rd generation Xeon scalable processor leads to a slowdown of 1.5x on average (up to 4.4x) for many HPC workloads. This number is an order of magnitude smaller than that reported in the previous work using the combination of the former-generation SGX toolchain and processor.


  • PredCom: A Predictive Approach to Collecting Approximated Communication Traces

    by Shinobu Miwa, Ignacio Laguna, Martin Schultz

    Communication traces collected from MPI applications are an important source of information for performance optimization as they can help analysts determine communication patterns and identify inefficiencies. However, their collection, especially at scale, is time consuming, since it usually requires running the complete target application on a large number of nodes. In this work, we present PredCom, a tool-chain to generate a predictive communication proxy based on information gathered from a few small scale runs, which allows us to extract approximate communication traces with an accuracy high enough for most analysis goals. For this, we combine LLVM passes on the original source code (to capture static program structure) with parameter prediction (to capture dynamic and scaling behavior). This approach drastically reduces the time needed for collecting the communication traces, even for traces on large numbers of MPI processes. We demonstrate that PredCom generates communication traces of various applications up to 1612x faster with an accuracy loss of 0.11 on average compared to the original large-scale traces, and we show that the generated traces can be used to optimize process placement.


  • 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.


  • Integrating Multi-GPU Execution in an OpenACC Compiler

    by Toshiya Komoda, Shinobu Miwa, Hiroshi Nakamura, Naoya Maruyama

    GPUs have become promising computing devices in current and future computer systems due to its high performance, high energy efficiency, and low price. However, lack of high level GPU programming models hinders the wide spread of GPU applications. To resolve this issue, OpenACC is developed as the first industry standard of a directive-based GPU programming model and several implementations are now available. Although early evaluations of the OpenACC systems showed significant performance improvement with modest programming efforts, they also revealed the limitations of the systems. One of the biggest limitations is that the current OpenACC compilers do not automate the utilization of multiple GPUs. In this paper, we present an OpenACC compiler with the capability to execute single GPU OpenACC programs on multiple GPUs. By orchestrating the compiler and the runtime system, the proposed system can efficiently manage the necessary data movements among multiple GPUs memories. To enable advanced communication optimizations in the proposed system, we propose a small set of directives as extensions of OpenACC API. The directives allow programmers to express the patterns of memory accesses in the parallel loops to be offloaded. Inserting a few directives into an OpenACC program can reduce a large amount of unnecessary data movements and thus helps the proposed system drawing great performance from multi-GPU systems. We implemented and evaluated the prototype system on top of CUDA with three data parallel applications. The proposed system achieves up to 6.75x of the performance compared to OpenMP in the 1CPU with 2GPU machine, and up to 2.95x of the performance compared to OpenMP in the 2CPU with 3GPU machine. In addition, in two of the three applications, the multi-GPU OpenACC compiler outperforms the single GPU system where hand-written CUDA programs run.