Xiaojun Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaojun Wang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Hong Zhang
Henan University of Economics and Law
5 shared publications Xu Chen
5 shared publicationsFeng Shi
4 shared publicationsChangzhen Hu
Beijing Institute of Technology
3 shared publicationsFei Yin
3 shared publications- Feng Shi
School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China
3 shared publications
Latest Publications
- 26 January 2020
- Published by Springer Nature
- p. 35-47
A Novel Speedup Evaluation for Multicore Architecture Based Topology of On-Chip Memory
- 26 January 2020
- Published by Springer Nature
- p. 35-47
A Novel Speedup Evaluation for Multicore Architecture Based Topology of On-Chip Memory
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 547-554
An Efficient Distributed Minimal Routing Algorithm for Triplet-Based WK-recursive Network
The design of an efficient routing algorithm is an important task since it not only determines the path that each packet follows but also affects the network performance, cost and power consumption. In this paper, we focus on exploring a distributed minimal routing algorithm for triplet-based WK-recursive network. By fully taking advantage of the characteristics of the network, we employ the concept S 3 group to establish a powerful coding system. Otherwise, a region-based data flow model is proposed to categorize message traffic as six types. To further improve the efficiency of computation, we leverage cyclic permutation of S 3 group to perform equivalent transformation between traffic models and hence the calculation is carried out in the same model. Using a extended cycle-accurate simulator Noxim, the experiment results show that our proposed design provides 18.6%-35.3% improvement in average network latency and 15.2%-21.8% improvement in average network throughput over the previous algorithm evaluated in this study.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 547-554
An Efficient Distributed Minimal Routing Algorithm for Triplet-Based WK-recursive Network
The design of an efficient routing algorithm is an important task since it not only determines the path that each packet follows but also affects the network performance, cost and power consumption. In this paper, we focus on exploring a distributed minimal routing algorithm for triplet-based WK-recursive network. By fully taking advantage of the characteristics of the network, we employ the concept S 3 group to establish a powerful coding system. Otherwise, a region-based data flow model is proposed to categorize message traffic as six types. To further improve the efficiency of computation, we leverage cyclic permutation of S 3 group to perform equivalent transformation between traffic models and hence the calculation is carried out in the same model. Using a extended cycle-accurate simulator Noxim, the experiment results show that our proposed design provides 18.6%-35.3% improvement in average network latency and 15.2%-21.8% improvement in average network throughput over the previous algorithm evaluated in this study.
- 1 January 2018
- Published by Inderscience Publishers in International Journal of Computational Science and Engineering
- Vol. 17 (4) , 422-431
Power-aware high level evaluation model of interconnect length of on-chip memory network topology
Interconnect power is the factor that dominates the power consumption on the on-chip memory architecture. Almost all dedicated wires and buses are replaced with packet switching interconnection networks which have become the standard approach to on-chip interconnection. Unfortunately, rapid advances in technology are making it more difficult to assess the interconnect power consumption of NoC. To resolve this problem, a new evaluating methodology for interconnect power evaluation based on topology of on-chip memory (IP-ETOM) is proposed in this paper. To validate this method, two multicore architectures 2D-mesh and triplet-based architecture (TriBA) are evaluated in this research work. The on-chip memory network model is evaluated based on characteristics of on-chip architecture interconnection. MATLAB is used for conducting the experiment that evaluates the interconnection power of TriBA and 2D-mesh.
- 1 January 2018
- Published by Inderscience Publishers in International Journal of Computational Science and Engineering
- Vol. 17 (4) , 422-431
Power-aware high level evaluation model of interconnect length of on-chip memory network topology
Interconnect power is the factor that dominates the power consumption on the on-chip memory architecture. Almost all dedicated wires and buses are replaced with packet switching interconnection networks which have become the standard approach to on-chip interconnection. Unfortunately, rapid advances in technology are making it more difficult to assess the interconnect power consumption of NoC. To resolve this problem, a new evaluating methodology for interconnect power evaluation based on topology of on-chip memory (IP-ETOM) is proposed in this paper. To validate this method, two multicore architectures 2D-mesh and triplet-based architecture (TriBA) are evaluated in this research work. The on-chip memory network model is evaluated based on characteristics of on-chip architecture interconnection. MATLAB is used for conducting the experiment that evaluates the interconnection power of TriBA and 2D-mesh.
- Open Access
- 1 January 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 15 (8) , 20180300
A novel look-ahead routing algorithm based on graph theory for triplet-based network-on-chip router
The WK-recursive network well conforms to implementation of large distributed systems due to its many favorable properties. In this paper, we employ the concept S3 group to establish an efficient look-ahead routing algorithm for the triplet-based WK-recursive network. Remarkably, we introduce a data flow model to categorize message traffic as six flow models. For the sake of simplicity, we further leverage the permutation group S3 to transform different flow models to one model and hence routing computing can be performed in the same model. It is demonstrated that our proposed design can achieve better network performance.
- 1 January 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 15 (8) , 20180300
Open AccessA novel look-ahead routing algorithm based on graph theory for triplet-based network-on-chip router
The WK-recursive network well conforms to implementation of large distributed systems due to its many favorable properties. In this paper, we employ the concept S3 group to establish an efficient look-ahead routing algorithm for the triplet-based WK-recursive network. Remarkably, we introduce a data flow model to categorize message traffic as six flow models. For the sake of simplicity, we further leverage the permutation group S3 to transform different flow models to one model and hence routing computing can be performed in the same model. It is demonstrated that our proposed design can achieve better network performance.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2872-2879
An evaluation power model for TriBA based application mapping and memory-on-chip
An application mapping algorithm is proposed for using the multicore architecture TriBA. Meanwhile a power consumption evaluating model based topology of on-chip memory network design is presented after application mapping strategy onto various multicore architecture topologies. This paper focuses on evaluating power of on-chip memory and communication network based the approaches of Kernighan-Lin tri-partitioning algorithm strategy. Utilizing the average hops of links between the components in System-on-Chip, this method computes the average hops which instructions access memory network and communication network on chip. Experimentations with the average hops and established benchmark VOPD show that the proposed method not only can quickly and effectively estimates power consumption but also direct the improvement of Network-on-Chip architecture by using the same application mapping strategy based on topology of multicore architectures.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2872-2879
An evaluation power model for TriBA based application mapping and memory-on-chip
An application mapping algorithm is proposed for using the multicore architecture TriBA. Meanwhile a power consumption evaluating model based topology of on-chip memory network design is presented after application mapping strategy onto various multicore architecture topologies. This paper focuses on evaluating power of on-chip memory and communication network based the approaches of Kernighan-Lin tri-partitioning algorithm strategy. Utilizing the average hops of links between the components in System-on-Chip, this method computes the average hops which instructions access memory network and communication network on chip. Experimentations with the average hops and established benchmark VOPD show that the proposed method not only can quickly and effectively estimates power consumption but also direct the improvement of Network-on-Chip architecture by using the same application mapping strategy based on topology of multicore architectures.
- 26 January 2017
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 22 (1) , 50-54
Brittleness analysis and important nodes discovery in large time-evolving complex networks
- 26 January 2017
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 22 (1) , 50-54
Brittleness analysis and important nodes discovery in large time-evolving complex networks
- 10 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 393, 570-573
Application of complexity and brittleness on software architecture
Just like the catastrophe in power grid, software system may collapse during its operation. It reflects the complexity in software system itself, and the brittleness of software system is the main reason which results in the collapse. The notion of complex system and brittleness is introduced into the study of software system and some aspects which can induce the system to collapse are also discussed. Specifically, the notions of complex system, complex network and brittleness are introduced at first, then a detailed description of the complexity of software system is given; following that a fast-slow alternative dynamic model is built, which consists of a slow-dynamic model and a fast-dynamic model. In the end, a complex theory framework of brittleness on software architecture is presented, which covers the brittleness of software architecture from the way of language description, the analytical method, modeling to the evaluation. This can give a comprehensive research platform on the brittleness of software system. Some main research areas are also given for future study.
- 10 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 393, 570-573
Application of complexity and brittleness on software architecture
Just like the catastrophe in power grid, software system may collapse during its operation. It reflects the complexity in software system itself, and the brittleness of software system is the main reason which results in the collapse. The notion of complex system and brittleness is introduced into the study of software system and some aspects which can induce the system to collapse are also discussed. Specifically, the notions of complex system, complex network and brittleness are introduced at first, then a detailed description of the complexity of software system is given; following that a fast-slow alternative dynamic model is built, which consists of a slow-dynamic model and a fast-dynamic model. In the end, a complex theory framework of brittleness on software architecture is presented, which covers the brittleness of software architecture from the way of language description, the analytical method, modeling to the evaluation. This can give a comprehensive research platform on the brittleness of software system. Some main research areas are also given for future study.
- 11 March 2016
- Published by Springer Nature in Lecture Notes in Electrical Engineering
- p. 677-684
Outlier Detection for Time-Evolving Complex Networks
- 11 March 2016
- Published by Springer Nature in Lecture Notes in Electrical Engineering
- p. 677-684
Outlier Detection for Time-Evolving Complex Networks