Masaru Fukushi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Masaru Fukushi has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Yota Kurokawa
Graduate School of Sciences and Technology for Innovation, Yamaguchi University,Ube-shi,Japan
5 shared publications- Yota Kurokawa
Graduate School of Sciences and Technology for Innovation, Yamaguchi University, Ube 755-8611, Japan
3 shared publications - M. M. Hafizur Rahman
Department of Computer Networks and Communications, CCSIT, King Faisal University, Al Ahsa, Saudi Arabia
2 shared publications - Yasushi Inoguchi
Research Center for Advanced Computing Infrastructure, Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi, Ishikawa 923-1211, Japan
2 shared publications - Asadullah Shah
Department of Information Systems, Kulliyyah of Information and Communications Technology, IIUM, Selangor, Malaysia
1 shared publication - Bin Yang
Chuzhou University
1 shared publication
Latest Publications
- Open Access
A Passage-Based Fault-Tolerant Routing Method for 3D Mesh NoCs Without Creating Faulty Regions
This paper proposes a novel fault-tolerant routing method without creating faulty regions for 3D mesh Network-on-Chips (NoCs). Most conventional methods create faulty regions containing faulty nodes and route packets around them to reach the destinations. However, the creation of faulty regions results in low communication performance and low node utilization. To overcome the two problems, the proposed method does not create faulty regions based on the idea of predefining paths in the absence of shortest paths while allowing the passage of faulty nodes. Simulation results show that, compared with conventional methods, the proposed method reduces average latency by about 44.5% and improves node utilization rate by about 41.2% for 3D mesh NoCs of nodes.Open AccessA Passage-Based Fault-Tolerant Routing Method for 3D Mesh NoCs Without Creating Faulty Regions
This paper proposes a novel fault-tolerant routing method without creating faulty regions for 3D mesh Network-on-Chips (NoCs). Most conventional methods create faulty regions containing faulty nodes and route packets around them to reach the destinations. However, the creation of faulty regions results in low communication performance and low node utilization. To overcome the two problems, the proposed method does not create faulty regions based on the idea of predefining paths in the absence of shortest paths while allowing the passage of faulty nodes. Simulation results show that, compared with conventional methods, the proposed method reduces average latency by about 44.5% and improves node utilization rate by about 41.2% for 3D mesh NoCs of nodes. - Open Access
Adaptive and Passage-Based Fault-Tolerant Routing Methods for Three-Dimensional Mesh NoCs
This paper proposes novel two fault-tolerant routing methods for a 3D mesh network-on-chip (NoC). The existing method proposed by Boppana et al. combines two routing methods, minimal fully adaptive routing and fault-tolerant routing, for faulty region detouring. However, in the latter fault-tolerant routing, a detour direction is statically defined for each faulty region. Due to the long detour path and the use of eight virtual channels, this method has the problems of high communication latency and a large hardware overhead. To solve these problems, the first proposed method allows adaptive detours for faulty regions, and the second proposed method allows the passage of them. The simulation results show that, compared with the existing method, the second proposed method enables us to reduce the latency by about 30% and improve the throughput by about 3.1% with half of the virtual channels.
Open AccessAdaptive and Passage-Based Fault-Tolerant Routing Methods for Three-Dimensional Mesh NoCs
This paper proposes novel two fault-tolerant routing methods for a 3D mesh network-on-chip (NoC). The existing method proposed by Boppana et al. combines two routing methods, minimal fully adaptive routing and fault-tolerant routing, for faulty region detouring. However, in the latter fault-tolerant routing, a detour direction is statically defined for each faulty region. Due to the long detour path and the use of eight virtual channels, this method has the problems of high communication latency and a large hardware overhead. To solve these problems, the first proposed method allows adaptive detours for faulty regions, and the second proposed method allows the passage of them. The simulation results show that, compared with the existing method, the second proposed method enables us to reduce the latency by about 30% and improve the throughput by about 3.1% with half of the virtual channels.
- Open Access
- 1 January 2023
- Published by Engineering and Technology Publishing in Journal of Advances in Information Technology
- Vol. 14 (5) , 876-882
A Simple and Effective Evaluation Method for Fault-Tolerant Routing Methods in Network-on-Chips
- 1 January 2023
- Published by Engineering and Technology Publishing in Journal of Advances in Information Technology
- Vol. 14 (5) , 876-882
Open AccessA Simple and Effective Evaluation Method for Fault-Tolerant Routing Methods in Network-on-Chips
- 6 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-112
Performance Evaluation of Fault-Tolerant Routing Methods Using Parallel Programs
Toward the realization of high-end consumer electronics products, fault-tolerant rouging plays a key role in communication among nodes in Network-on-Chip-based manycore embedded systems. A variety of fault-tolerant routing methods have been studied with the evaluation on the communication performance such as communication latency and network throughput. However, such evaluation is not practical in that it cannot reveal the difference of performance between the target routing methods in executing parallel applications. For this problem, we propose an evaluation method of fault-tolerant routing methods using real parallel programs. Our method allows designers of routing methods to easily incorporate the information obtained from a parallel program into the conventional routing simulations. Evaluation with the proposed method shows that the fault-tolerant routing method called Passage-XY reduces execution time of Integer Sort (IS), which is one of the parallel programs in NAS parallel Benchmarks, by about 56%, compared with the region-based method called Position Route.
- 6 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-112
Performance Evaluation of Fault-Tolerant Routing Methods Using Parallel Programs
Toward the realization of high-end consumer electronics products, fault-tolerant rouging plays a key role in communication among nodes in Network-on-Chip-based manycore embedded systems. A variety of fault-tolerant routing methods have been studied with the evaluation on the communication performance such as communication latency and network throughput. However, such evaluation is not practical in that it cannot reveal the difference of performance between the target routing methods in executing parallel applications. For this problem, we propose an evaluation method of fault-tolerant routing methods using real parallel programs. Our method allows designers of routing methods to easily incorporate the information obtained from a parallel program into the conventional routing simulations. Evaluation with the proposed method shows that the fault-tolerant routing method called Passage-XY reduces execution time of Integer Sort (IS), which is one of the parallel programs in NAS parallel Benchmarks, by about 56%, compared with the region-based method called Position Route.
- 1 January 2022
- Published by Springer Nature
- p. 1-21
Degradable Self-restructuring of Processor Arrays by Direct Spare Replacement
- 1 January 2022
- Published by Springer Nature
- p. 1-21
Degradable Self-restructuring of Processor Arrays by Direct Spare Replacement
- 14 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (8) , 6313-6323
Covert Communication in Relay-Assisted IoT Systems
Internet of Things (IoT) systems are of paramount importance to provide ubiquitous wireless connectivity for smart cities. However, such systems are facing security challenges due to the broadcast and openness nature of wireless channels. This article studies the performance of covert communication under a scenario consisted of a source-destination pair, a passive warden, and multiple relays. We first propose two relay selection schemes, one is random selection and another is superior-link selection. Based on these two schemes, we then examine the transmission strategy design for the source and thus define the necessary condition that the source can transmit covert messages. We further derive the detection error probability of warden and covert capacity based on two relay selection schemes and also explore the covert capacity maximization through efficient numerical searches. Finally, numerical results are provided to illustrate our theoretical findings and the performance of covert communication in such systems. Remarkably, the superior-link selection scheme has 108% improved to the random selection scheme for the maximum covert capacity performance under the same transmission power at the source.
- 14 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (8) , 6313-6323
Covert Communication in Relay-Assisted IoT Systems
Internet of Things (IoT) systems are of paramount importance to provide ubiquitous wireless connectivity for smart cities. However, such systems are facing security challenges due to the broadcast and openness nature of wireless channels. This article studies the performance of covert communication under a scenario consisted of a source-destination pair, a passive warden, and multiple relays. We first propose two relay selection schemes, one is random selection and another is superior-link selection. Based on these two schemes, we then examine the transmission strategy design for the source and thus define the necessary condition that the source can transmit covert messages. We further derive the detection error probability of warden and covert capacity based on two relay selection schemes and also explore the covert capacity maximization through efficient numerical searches. Finally, numerical results are provided to illustrate our theoretical findings and the performance of covert communication in such systems. Remarkably, the superior-link selection scheme has 108% improved to the random selection scheme for the maximum covert capacity performance under the same transmission power at the source.
- Open Access
- 9 December 2020
- Published by IntechOpen
A Novel Approach for the Design of Fault-Tolerant Routing Algorithms in NoCs: Passage of Faulty Nodes, Not Always Detour
Due to the faults in system fabrication and run time, designing an efficient fault-tolerant routing algorithm with the property of deadlock-freeness is crucial for realizing dependable Network-on-Chip (NoC) systems with high communication performance. In this chapter, we introduce a novel approach for the design of fault-tolerant routing algorithms in NoCs. The common idea of the fault-tolerant routing has been undoubtedly to detour faulty nodes, while our approach allows passing through faulty nodes with the slight modification of NoC architecture. As a design example, we present an XY-based routing algorithm with the passage function. To investigate the effect of the approach, we compare the communication performance (i.e. average latency) of the XY-based algorithm with well-known region-based algorithms under the condition of with and without virtual channels. Finally, we provide possible directions of future research on the fault-tolerant routing with the passage function.
- 9 December 2020
- Published by IntechOpen
Open AccessA Novel Approach for the Design of Fault-Tolerant Routing Algorithms in NoCs: Passage of Faulty Nodes, Not Always Detour
Due to the faults in system fabrication and run time, designing an efficient fault-tolerant routing algorithm with the property of deadlock-freeness is crucial for realizing dependable Network-on-Chip (NoC) systems with high communication performance. In this chapter, we introduce a novel approach for the design of fault-tolerant routing algorithms in NoCs. The common idea of the fault-tolerant routing has been undoubtedly to detour faulty nodes, while our approach allows passing through faulty nodes with the slight modification of NoC architecture. As a design example, we present an XY-based routing algorithm with the passage function. To investigate the effect of the approach, we compare the communication performance (i.e. average latency) of the XY-based algorithm with well-known region-based algorithms under the condition of with and without virtual channels. Finally, we provide possible directions of future research on the fault-tolerant routing with the passage function.
- 30 November 2019
- Published by Springer Nature in Artificial Life and Robotics
- Vol. 25 (2) , 301-307
A degradable NoC router for the improvement of fault-tolerant routing performance
- 30 November 2019
- Published by Springer Nature in Artificial Life and Robotics
- Vol. 25 (2) , 301-307
A degradable NoC router for the improvement of fault-tolerant routing performance
- 29 August 2019
- Published by Springer Nature
- p. 109-135
A Built-In Circuit for Self-reconfiguring Mesh-Connected Processor Arrays with Spares on Diagonal
- 29 August 2019
- Published by Springer Nature
- p. 109-135
A Built-In Circuit for Self-reconfiguring Mesh-Connected Processor Arrays with Spares on Diagonal
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
Performance Improvement of Region-Based Fault-Tolerant Routing Methods Based on the Passage of Fault Blocks
Toward the realization of dependable high-end consumer electronics products, a fault-tolerant 2D mesh Network-on-Chips (NoCs) in many core processors has attracted attention. In the previous method, we proposed a new approach to improve performance of a fault-tolerant routing method; packets can pass through faulty elements. In the study, we propose a new fault-tolerant routing method applying the new approach to a fault-tolerant routing method, which exhibits capable of high resource usage rate. This study investigates effect of the approach in reducing network congestion in the NoC. Simulation result shows that our method reduces average communication latency by about 62.8%, compared with our previous method.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
Performance Improvement of Region-Based Fault-Tolerant Routing Methods Based on the Passage of Fault Blocks
Toward the realization of dependable high-end consumer electronics products, a fault-tolerant 2D mesh Network-on-Chips (NoCs) in many core processors has attracted attention. In the previous method, we proposed a new approach to improve performance of a fault-tolerant routing method; packets can pass through faulty elements. In the study, we propose a new fault-tolerant routing method applying the new approach to a fault-tolerant routing method, which exhibits capable of high resource usage rate. This study investigates effect of the approach in reducing network congestion in the NoC. Simulation result shows that our method reduces average communication latency by about 62.8%, compared with our previous method.