Minghua Tang
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
Minghua Tang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Maurizio Palesi
University of Catania
5 shared publications - Xiaola Lin
Sun Yat-sen University
3 shared publications - Enrico Russo
University of Catania, Catania, Italy
2 shared publications Liming Yang
2 shared publicationsChen Bian
1 shared publication- Jing Lin
School of Information Management, Shanghai Lixin University of Accounting and Finance, 66317 Shanghai, Shanghai China
1 shared publication
Latest Publications
- 9 May 2026
- Published by Elsevier in Neural Networks
- Vol. 202, 109077
Are LLMs qualified evaluators and generators of one-liner jokes
- 9 May 2026
- Published by Elsevier in Neural Networks
- Vol. 202, 109077
Are LLMs qualified evaluators and generators of one-liner jokes
- 13 September 2025
- Published by Elsevier in Neurocomputing
- Vol. 656
Key-concept thinking prompting for improved reasoning in large language models
- 13 September 2025
- Published by Elsevier in Neurocomputing
- Vol. 656
Key-concept thinking prompting for improved reasoning in large language models
- 27 July 2023
- Published by Springer Nature
- p. 787-792
A Case Study on DNN Accelerators
- 7 July 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (1) , 1365
Correction to: The position-based compression techniques for DNN model
- 7 July 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (1) , 1365
Correction to: The position-based compression techniques for DNN model
- 8 May 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (15) , 17445-17474
The position-based compression techniques for DNN model
- 8 May 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (15) , 17445-17474
The position-based compression techniques for DNN model
- Open Access
- 13 October 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Study on logic-based routing for 3D NOCs
For mesh-based Network-on-Chip (NoC), in order for a routing algorithm to be implemented by logic-based circuit, the prohibited turns should be repetitively distributed. The 3D mesh network has a huge searching space for routing algorithms. Due to its complexity, there is lack of research to detect its design space. In this paper, the design space for logic-based routing algorithms for 3D mesh network is systematically exploited. After detecting the design space, new logic-based routing algorithm that outperforms the state-of-the-art routing algorithms is proposed. For the first step, all routing algorithms that have repetitively distributed turns for 2D mesh network are constructed. For the second step, the routing algorithms for the three planes of the 3D mesh network are constructed respectively. The Z plane of the 3D mesh network is constructed by placing a 2D network routing on it. The X and Y planes of the 3D mesh network are constructed by rotating the Z plane up or down, respectively. Finally, the constructed routing algorithms are evaluated under 44 traffic scenarios. The best routing algorithm is termed as 3D repetitive turn model (3DRTM). Simulation results show that it has better performance than the prior proposed routing algorithm under most synthetic and real traffic scenarios.
- 13 October 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessStudy on logic-based routing for 3D NOCs
For mesh-based Network-on-Chip (NoC), in order for a routing algorithm to be implemented by logic-based circuit, the prohibited turns should be repetitively distributed. The 3D mesh network has a huge searching space for routing algorithms. Due to its complexity, there is lack of research to detect its design space. In this paper, the design space for logic-based routing algorithms for 3D mesh network is systematically exploited. After detecting the design space, new logic-based routing algorithm that outperforms the state-of-the-art routing algorithms is proposed. For the first step, all routing algorithms that have repetitively distributed turns for 2D mesh network are constructed. For the second step, the routing algorithms for the three planes of the 3D mesh network are constructed respectively. The Z plane of the 3D mesh network is constructed by placing a 2D network routing on it. The X and Y planes of the 3D mesh network are constructed by rotating the Z plane up or down, respectively. Finally, the constructed routing algorithms are evaluated under 44 traffic scenarios. The best routing algorithm is termed as 3D repetitive turn model (3DRTM). Simulation results show that it has better performance than the prior proposed routing algorithm under most synthetic and real traffic scenarios.
- 22 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 67 (5) , 704-716
The Suboptimal Routing Algorithm for 2D Mesh Network
Due to the huge routing algorithm search space for 2D mesh based Network-on-Chip (NoC), Divide-Conquer method is presented to effectively explore the search space. When using Divide-Conquer method, a large number of routing algorithms will be created. In order to get the final results in acceptable time, a precise metric is needed to measure routing performance and discard the poor performance routings. In this paper, we propose a new routing performance metric, namely, network pressure. Network pressure has the following three advantages: (1) it could measure the whole network congestion state; (2) network pressure of a network and that of its partial component is highly related, under the same routing; (3) it is more related with routing performance than the traditional routing performance metrics. Based on network pressure and Divide-Conquer method, high performance routing could be achieved. The obtained routing is called suboptimal routing due to the following two reasons: (1) there is only a little gap between its performance and that of the fully adaptive routings under both transpose1 and transpose2 traffics. (2) the search space of routing algorithms is systematically and widely exploited.
- 22 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 67 (5) , 704-716
The Suboptimal Routing Algorithm for 2D Mesh Network
Due to the huge routing algorithm search space for 2D mesh based Network-on-Chip (NoC), Divide-Conquer method is presented to effectively explore the search space. When using Divide-Conquer method, a large number of routing algorithms will be created. In order to get the final results in acceptable time, a precise metric is needed to measure routing performance and discard the poor performance routings. In this paper, we propose a new routing performance metric, namely, network pressure. Network pressure has the following three advantages: (1) it could measure the whole network congestion state; (2) network pressure of a network and that of its partial component is highly related, under the same routing; (3) it is more related with routing performance than the traditional routing performance metrics. Based on network pressure and Divide-Conquer method, high performance routing could be achieved. The obtained routing is called suboptimal routing due to the following two reasons: (1) there is only a little gap between its performance and that of the fully adaptive routings under both transpose1 and transpose2 traffics. (2) the search space of routing algorithms is systematically and widely exploited.
- 9 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 66 (1) , 138-146
The Repetitive Turn Model for Adaptive Routing
For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logicbased routing algorithms, and propose new logic-based routing algorithms that outperform the state-of-the-art counterparts. Toward this direction, we firstly construct all routing algorithms for 5 x 5 2D mesh topology. Then we select those routing algorithms which have repetitive prohibited turns across both the network rows and columns. In addition, we chose those routing algorithms that have smaller routing pressures than Odd-Even routing algorithm. Then the routing algorithms for 2D mesh topology ranging from 6 x 6 to 15 x 15 are respectively constructed according to the prohibited turns distribution of the selected routing algorithms. Two routing algorithms that have smaller routing pressures than Odd-Even routing algorithm are obtained for all considered networks. The obtained logic-based routing algorithms are called as Repetitive Turn Model (RTM). Simulation results show that RTM could achieve up to 51% performance improvement as compared to Odd-Even routing algorithm.
- 9 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 66 (1) , 138-146
The Repetitive Turn Model for Adaptive Routing
For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logicbased routing algorithms, and propose new logic-based routing algorithms that outperform the state-of-the-art counterparts. Toward this direction, we firstly construct all routing algorithms for 5 x 5 2D mesh topology. Then we select those routing algorithms which have repetitive prohibited turns across both the network rows and columns. In addition, we chose those routing algorithms that have smaller routing pressures than Odd-Even routing algorithm. Then the routing algorithms for 2D mesh topology ranging from 6 x 6 to 15 x 15 are respectively constructed according to the prohibited turns distribution of the selected routing algorithms. Two routing algorithms that have smaller routing pressures than Odd-Even routing algorithm are obtained for all considered networks. The obtained logic-based routing algorithms are called as Repetitive Turn Model (RTM). Simulation results show that RTM could achieve up to 51% performance improvement as compared to Odd-Even routing algorithm.
- 28 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 27 (7) , 2062-2073
Local Congestion Avoidance in Network-on-Chip
Network-on-Chip (NoC) has been made the communication infrastructure for many-core architecture. NoC are subject to congestion, which is claimed to be avoided by many researchers. However, there is no completely understanding of congestion in literature, which hinders its solution. Toward this direction, we firstly carry out study on congestion in this paper. We find that congestion usually occurs at a portion of nodes in a local network region. Moreover, local congestion will significantly decrease system performance and mostly impact some particular communication pairs. Then we attempt to solve local congestion by addressing different local region size, based on Divide-Conquer approach and routing pressure. It avoids congestion in every local region by keeping routing pressure of every local region minimum. Using different local region size will create different routings. Our study shows that the local region size is closely related with the routing performance. When local region size is 5 × 5 the optimal routing performance of large size network could be achieved.
- 28 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 27 (7) , 2062-2073
Local Congestion Avoidance in Network-on-Chip
Network-on-Chip (NoC) has been made the communication infrastructure for many-core architecture. NoC are subject to congestion, which is claimed to be avoided by many researchers. However, there is no completely understanding of congestion in literature, which hinders its solution. Toward this direction, we firstly carry out study on congestion in this paper. We find that congestion usually occurs at a portion of nodes in a local network region. Moreover, local congestion will significantly decrease system performance and mostly impact some particular communication pairs. Then we attempt to solve local congestion by addressing different local region size, based on Divide-Conquer approach and routing pressure. It avoids congestion in every local region by keeping routing pressure of every local region minimum. Using different local region size will create different routings. Our study shows that the local region size is closely related with the routing performance. When local region size is 5 × 5 the optimal routing performance of large size network could be achieved.