Hirotake Abe
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
Research Subjects
Hirotake Abe has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Shinji Shimojo
Aomori University, Japan
4 shared publications - Susumu Date
D3 Center, The University of Osaka
4 shared publications - Kohei Ichikawa
Division of Information Science, Department of Science and Technology, Nara Institute of Science and Technology, Nara 630-0192, Japan
3 shared publications Yasuhiro Watashiba
3 shared publicationsYoshiyuki Kido
3 shared publications- Arata Endo
Cybermedia Center, Osaka University, Osaka, Japan
2 shared publications
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-8
SmartNIC-based Memory Monitoring for Lightweight Privilege Escalation Detection in HPC Systems
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessSmartNIC-based Memory Monitoring for Lightweight Privilege Escalation Detection in HPC Systems
- Open Access
- 11 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 24-29
Benchmarks for Job Scheduling in Ultra-Distributed Systems
As the number of edge devices rapidly multiplies into the millions in the post-5G era, there is a simultaneous surge in demand for job execution driven by the data generated by these devices. Ultra-distributed computing systems have emerged to support this notable proliferation of interconnected devices and in addressing the unprecedented data generated over low-latency networks. To ensure the high availability and reliability of these systems, an efficient job scheduling method is required to schedule jobs across available resources. However, there are currently no large-scale benchmarks available to evaluate job scheduling methods. This paper introduces large-scale benchmarks of up to one million devices for job shop scheduling problems. We evaluate the makespan reduction of widely used combinatorial optimizations on these benchmarks, including simulated annealing, ant colony, tree Parzen search, particle swarm, artificial bee colony, cuckoo search, whale, grey wolf, firefly, and bat optimizations. We investigate the impact of execution time on finding the optimal makespan of job shop scheduling for each method. The experimental results can be used to guide the selection of a job scheduling method for particular applications.
- 11 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 24-29
Open AccessBenchmarks for Job Scheduling in Ultra-Distributed Systems
As the number of edge devices rapidly multiplies into the millions in the post-5G era, there is a simultaneous surge in demand for job execution driven by the data generated by these devices. Ultra-distributed computing systems have emerged to support this notable proliferation of interconnected devices and in addressing the unprecedented data generated over low-latency networks. To ensure the high availability and reliability of these systems, an efficient job scheduling method is required to schedule jobs across available resources. However, there are currently no large-scale benchmarks available to evaluate job scheduling methods. This paper introduces large-scale benchmarks of up to one million devices for job shop scheduling problems. We evaluate the makespan reduction of widely used combinatorial optimizations on these benchmarks, including simulated annealing, ant colony, tree Parzen search, particle swarm, artificial bee colony, cuckoo search, whale, grey wolf, firefly, and bat optimizations. We investigate the impact of execution time on finding the optimal makespan of job shop scheduling for each method. The experimental results can be used to guide the selection of a job scheduling method for particular applications.
- Open Access
- 13 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 152704-152717
Hadoop Data Reduction Framework: Applying Data Reduction at the DFS Layer
Big-data processing systems such as Hadoop, which usually utilize distributed file systems (DFSs), require data reduction schemes to maximize storage space efficiency. These schemes have different tradeoffs, and there are no all-purpose schemes applicable to all data. Users must select a suitable scheme in accordance with their data. To accommodate this requirement, application software or file system (FS) have a fixed selection of these schemes. However, these provided schemes are insufficient for all data types, and when novel schemes emerge, extending the selection can be problematic. If the source code of the application or FS is available, the source code could potentially be extended with extensive labor, but could be virtually impossible without the code maintainers’ assistance. If the source code is unavailable, there is no way to tackle the problem. This paper proposes an unexplored solution through a modular DFS design that eases data reduction scheme usage through existing programming techniques. The advantages of this presented approach are threefold. First, adding new schemes is easy and they are transparent to the application code requiring no extensions to it. Second, the modular structure requires minimal modification to the existing DFSs and performance overhead. Third, users can compile schemes separately from the DFS without the FS or DFS source code. To demonstrate the design’s effectiveness, we implemented it by minimally extending the Hadoop DFS (HDFS) and named it the Hadoop Data Reduction Framework (HDRF). We designed HDRF to work with minimal overhead and tested it extensively. Experimental results indicate that it has negligible overhead over existing approaches. In a number of cases, it can offer up to 48.96% higher throughput while achieving the best result in storage reduction within our tested setups because of the incorporated data reduction schemes.
- 13 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 152704-152717
Open AccessHadoop Data Reduction Framework: Applying Data Reduction at the DFS Layer
Big-data processing systems such as Hadoop, which usually utilize distributed file systems (DFSs), require data reduction schemes to maximize storage space efficiency. These schemes have different tradeoffs, and there are no all-purpose schemes applicable to all data. Users must select a suitable scheme in accordance with their data. To accommodate this requirement, application software or file system (FS) have a fixed selection of these schemes. However, these provided schemes are insufficient for all data types, and when novel schemes emerge, extending the selection can be problematic. If the source code of the application or FS is available, the source code could potentially be extended with extensive labor, but could be virtually impossible without the code maintainers’ assistance. If the source code is unavailable, there is no way to tackle the problem. This paper proposes an unexplored solution through a modular DFS design that eases data reduction scheme usage through existing programming techniques. The advantages of this presented approach are threefold. First, adding new schemes is easy and they are transparent to the application code requiring no extensions to it. Second, the modular structure requires minimal modification to the existing DFSs and performance overhead. Third, users can compile schemes separately from the DFS without the FS or DFS source code. To demonstrate the design’s effectiveness, we implemented it by minimally extending the Hadoop DFS (HDFS) and named it the Hadoop Data Reduction Framework (HDRF). We designed HDRF to work with minimal overhead and tested it extensively. Experimental results indicate that it has negligible overhead over existing approaches. In a number of cases, it can offer up to 48.96% higher throughput while achieving the best result in storage reduction within our tested setups because of the incorporated data reduction schemes.
- Open Access
- 10 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 7 (1) , 75-86
Analysis of Optimal File Placement for Energy-Efficient File-Sharing Cloud Storage System
Popular data concentration is a widely accepted storage energy-saving technique which places frequently-accessed data on a small subset of hard disks and spins-down other infrequently-accessed disks. Many previous studies use intuitive heuristic algorithms for data placement that promote the imbalance in the access frequencies across hard disks. However, the relevance and the optimality of such file placements have not been rigorously investigated. In this paper, we formally define the energy-saving file placement problem under the capacity and performance constraints as a combinatorial optimization problem and show the theory of the optimal file placement where the file access rates in the next period are given. Our analysis based on a stochastic process of disk state transitions gives the theoretical support for the common heuristic placement method. To examine the effectiveness of the optimal file placement, we experimentally evaluate the energy-efficiency of a test storage system using the file access rates generated from the real access traces from Flickr. The experimental results show that the energy consumption can be reduced by 31.8% with the optimal file placement compared to the evenly distributed file placement. We also conduct simulation experiments to confirm the energy-saving impacts in larger-scale storage systems.
- 10 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 7 (1) , 75-86
Open AccessAnalysis of Optimal File Placement for Energy-Efficient File-Sharing Cloud Storage System
Popular data concentration is a widely accepted storage energy-saving technique which places frequently-accessed data on a small subset of hard disks and spins-down other infrequently-accessed disks. Many previous studies use intuitive heuristic algorithms for data placement that promote the imbalance in the access frequencies across hard disks. However, the relevance and the optimality of such file placements have not been rigorously investigated. In this paper, we formally define the energy-saving file placement problem under the capacity and performance constraints as a combinatorial optimization problem and show the theory of the optimal file placement where the file access rates in the next period are given. Our analysis based on a stochastic process of disk state transitions gives the theoretical support for the common heuristic placement method. To examine the effectiveness of the optimal file placement, we experimentally evaluate the energy-efficiency of a test storage system using the file access rates generated from the real access traces from Flickr. The experimental results show that the energy consumption can be reduced by 31.8% with the optimal file placement compared to the evenly distributed file placement. We also conduct simulation experiments to confirm the energy-saving impacts in larger-scale storage systems.
- Open Access
- 1 March 2016
- Published by Elsevier in Future Generation Computer Systems
- Vol. 56, 303-314
SAGE-based Tiled Display Wall enhanced with dynamic routing functionality triggered by user interaction
- 1 March 2016
- Published by Elsevier in Future Generation Computer Systems
- Vol. 56, 303-314
Open AccessSAGE-based Tiled Display Wall enhanced with dynamic routing functionality triggered by user interaction
- 16 April 2015
- Published by S. Karger AG
- Vol. 3, 489-499
List of Symposium Organizers, Moderators and Speakers / Executive Members of Japan Medical Research Foundation
- 16 April 2015
- Published by S. Karger AG
- Vol. 3, 489-499
List of Symposium Organizers, Moderators and Speakers / Executive Members of Japan Medical Research Foundation
- 11 December 2014
- Published by Springer Nature in The Review of Socionetwork Strategies
- Vol. 8 (2) , 69-84
Efficacy Analysis of a SDN-enhanced Resource Management System through NAS Parallel Benchmarks
- 11 December 2014
- Published by Springer Nature in The Review of Socionetwork Strategies
- Vol. 8 (2) , 69-84
Efficacy Analysis of a SDN-enhanced Resource Management System through NAS Parallel Benchmarks
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 781-786
Performance Characteristics of an SDN-Enhanced Job Management System for Cluster Systems with Fat-Tree Interconnect
In the era of cloud computing, data centers that accommodate a series of user-requested jobs with a diversity of resource usage pattern need to have the capability of efficiently distributing resources to each user job, based on individual resource usage patterns. In particular, for high-performance computing as a cloud service which allows many users to benefit from a large-scale computing system, a new framework for resource management that treats not only the CPU resources, but also the network resources in the data center is essential. In this paper, an SDN-enhanced JMS that efficiently handles both network and CPU resources and as a result accelerates the execution time of user jobs is introduced as a building block technology for such a HPC cloud. Our evaluation shows that the SDN-enhanced JMS efficiently leverages the fat-tree interconnect of cluster systems running behind the cloud to suppress the collision of communications generated by different jobs.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 781-786
Performance Characteristics of an SDN-Enhanced Job Management System for Cluster Systems with Fat-Tree Interconnect
In the era of cloud computing, data centers that accommodate a series of user-requested jobs with a diversity of resource usage pattern need to have the capability of efficiently distributing resources to each user job, based on individual resource usage patterns. In particular, for high-performance computing as a cloud service which allows many users to benefit from a large-scale computing system, a new framework for resource management that treats not only the CPU resources, but also the network resources in the data center is essential. In this paper, an SDN-enhanced JMS that efficiently handles both network and CPU resources and as a result accelerates the execution time of user jobs is introduced as a building block technology for such a HPC cloud. Our evaluation shows that the SDN-enhanced JMS efficiently leverages the fat-tree interconnect of cluster systems running behind the cloud to suppress the collision of communications generated by different jobs.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 475-477
OpenFlow Network Visualization Software with Flow Control Interface
Recently, the concept of Software-Defined Network (SDN), which allows us to administer and configure a network in a centralized and software-programming manner, has gathered network engineers' and researchers' attention rapidly. In particular, the expectation and concern to OpenFlow as an implementation of the SDN is remarkable. As a result, research activities, which include prototyping, implementation, demonstration and experiments, conducted over OpenFlow networks have been a worldwide tendency. In such research activities, however, the difficulty in understanding network topology, traffic amount and an actual path of a network flow on the OpenFlow network, and the intricacies in debugging software designed for OpenFlow are serious problems in the development process of OpenFlow controller. This research aims to realize a visualization software that facilitates researchers to perform OpenFlow controller development and demonstration experiments performed on an actual OpenFlow network. In this paper, the authors summarize the achievement of their research work in progress as well as the future direction.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 475-477
OpenFlow Network Visualization Software with Flow Control Interface
Recently, the concept of Software-Defined Network (SDN), which allows us to administer and configure a network in a centralized and software-programming manner, has gathered network engineers' and researchers' attention rapidly. In particular, the expectation and concern to OpenFlow as an implementation of the SDN is remarkable. As a result, research activities, which include prototyping, implementation, demonstration and experiments, conducted over OpenFlow networks have been a worldwide tendency. In such research activities, however, the difficulty in understanding network topology, traffic amount and an actual path of a network flow on the OpenFlow network, and the intricacies in debugging software designed for OpenFlow are serious problems in the development process of OpenFlow controller. This research aims to realize a visualization software that facilitates researchers to perform OpenFlow controller development and demonstration experiments performed on an actual OpenFlow network. In this paper, the authors summarize the achievement of their research work in progress as well as the future direction.
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 1-6
A Protocol-Aware Network Control Method for Large-Scale Data Transfer in Long-Distance Broadband Networks
We generally utilize high-speed transport protocols to transfer and share large-scale data in long-distance broadband networks. However, the difference in performance between protocols when some kinds of protocols share the same link increases. Consequently, we propose a control method of discarding packets corresponding to protocol types that takes into consideration high-speed performance and fairness of flows. We evaluated the efficiency of our method in simulations. As a result, we found that it could allocate bandwidth equally while retaining high link utilization.
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 1-6
A Protocol-Aware Network Control Method for Large-Scale Data Transfer in Long-Distance Broadband Networks
We generally utilize high-speed transport protocols to transfer and share large-scale data in long-distance broadband networks. However, the difference in performance between protocols when some kinds of protocols share the same link increases. Consequently, we propose a control method of discarding packets corresponding to protocol types that takes into consideration high-speed performance and fairness of flows. We evaluated the efficiency of our method in simulations. As a result, we found that it could allocate bandwidth equally while retaining high link utilization.