Wu Jigang
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
Wu Jigang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Thambipillai Srikanthan
Nanyang Technological University
9 shared publications - Guang Chen
Centre for High Performance Embedded Systems, School of Computing Engineering, Nanyang Technological University, Republic of Singapore, 639798
1 shared publication - Guang-Wei Zou
Nanyang Technological University
1 shared publication Kai Wang
Nanyang Technological University
1 shared publication- Tao Jiao
Nanyang Technological University
1 shared publication Thambipillai Srikanthan
Senior Member, IEEE, Centre for High Performance Embedded Systems, School of Computing Engineering, Nanyang Technological University, Republic of Singapore, 639798
1 shared publication
Latest Publications
- 16 May 2009
- Published by Springer Nature in Frontiers of Computer Science in China
- Vol. 3 (3) , 315-321
Minimizing interconnect length on reconfigurable meshes
- 16 May 2009
- Published by Springer Nature in Frontiers of Computer Science in China
- Vol. 3 (3) , 315-321
Minimizing interconnect length on reconfigurable meshes
- 28 October 2008
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 12 (4) , 345-375
Algorithmic aspects for functional partitioning and scheduling in hardware/software co-design
- 28 October 2008
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 12 (4) , 345-375
Algorithmic aspects for functional partitioning and scheduling in hardware/software co-design
- 1 July 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (4) , 644-651
New Model and Algorithm for Hardware/Software Partitioning
- 1 July 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (4) , 644-651
New Model and Algorithm for Hardware/Software Partitioning
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 228-233
Temperature-Aware Submesh Allocation Scheme for Heat Balancing on Chip-Multiprocessors
This paper explores the thermal problems in future CMPs in multiprogrammed environment for heat balancing. We first give the observation of the temperature variation of cores in this scenario. Then we propose a temperature-aware submesh allocation scheme to manage cores with submeshes and allocate submeshes of cores to jobs under temperature-aware policies to balance heat chip-wide. Several scheduling policies are suggested and a HotSpot-based thermal simulator is used to evaluate the scheme and its policies under the workloads of benchmark programs. Simulation results show that our proposed scheme with global coolest policy and global neighbor-aware policy can lead to lower peak temperatures and effectively reduce the temporal variance and spatial variance of temperatures of cores to achieve better heat balance.
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 228-233
Temperature-Aware Submesh Allocation Scheme for Heat Balancing on Chip-Multiprocessors
This paper explores the thermal problems in future CMPs in multiprogrammed environment for heat balancing. We first give the observation of the temperature variation of cores in this scenario. Then we propose a temperature-aware submesh allocation scheme to manage cores with submeshes and allocate submeshes of cores to jobs under temperature-aware policies to balance heat chip-wide. Several scheduling policies are suggested and a HotSpot-based thermal simulator is used to evaluate the scheme and its policies under the workloads of benchmark programs. Simulation results show that our proposed scheme with global coolest policy and global neighbor-aware policy can lead to lower peak temperatures and effectively reduce the temporal variance and spatial variance of temperatures of cores to achieve better heat balance.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 149-158
One-dimensional Search Algorithms for Hardware/Software Partitioning
Hardware/software (HW/SW) partitioning is one of the key challenges in HW/SW co-design. This paper presents a new formulation to handle the HW/SW partitioning problem, which has been proved to be NP-hard. The proposed formulation transforms the partitioning problem into an extended 0-1 knapsack problem that is approximately solved in this paper by scanning a one-dimensional search space, instead of scanning a two-dimensional search space as presented in the literature cited in this paper. Two heuristic algorithms are proposed to explore the feasible partitions to meet the given constraints. The time complexity of the latest heuristic algorithm is significantly reduced from O(d x ldr d y ldr n 3 ) to O(n log n + d ldr (n + m)) for the given graphs with n nodes and m edges, where d x ldr d y is the number of the fragments of the scanned two-dimensional search space, and d is that of the scanned one-dimensional search space. Empirical results show that the proposed algorithms run extremely fast and still produce better or similar solutions in comparison with the latest algorithm.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 149-158
One-dimensional Search Algorithms for Hardware/Software Partitioning
Hardware/software (HW/SW) partitioning is one of the key challenges in HW/SW co-design. This paper presents a new formulation to handle the HW/SW partitioning problem, which has been proved to be NP-hard. The proposed formulation transforms the partitioning problem into an extended 0-1 knapsack problem that is approximately solved in this paper by scanning a one-dimensional search space, instead of scanning a two-dimensional search space as presented in the literature cited in this paper. Two heuristic algorithms are proposed to explore the feasible partitions to meet the given constraints. The time complexity of the latest heuristic algorithm is significantly reduced from O(d x ldr d y ldr n 3 ) to O(n log n + d ldr (n + m)) for the given graphs with n nodes and m edges, where d x ldr d y is the number of the fragments of the scanned two-dimensional search space, and d is that of the scanned one-dimensional search space. Empirical results show that the proposed algorithms run extremely fast and still produce better or similar solutions in comparison with the latest algorithm.
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1152-1155
New Reconfiguration Algorithm for Degradable VLSI Arrays
A new rerouting approach is proposed in this paper for the reconfiguration of two-dimensional degradable VLSI arrays under the constraint of row and column rerouting. The proposed approach chooses the local best processing element in each step to construct the leftmost logical columns, in order to utilize as many non-faults lying in the excluded rows as possible to enlarge the harvest of the algorithm. A more efficient reconfiguration algorithm is obtained by replacing the old rerouting approach with the new one. Experimental results clearly demonstrate the notable improvements in harvest over the most efficient algorithm cited in the literature. The harvest improvement increases with the increase of fault size, both for maximal target arrays and maximal square target arrays
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1152-1155
New Reconfiguration Algorithm for Degradable VLSI Arrays
A new rerouting approach is proposed in this paper for the reconfiguration of two-dimensional degradable VLSI arrays under the constraint of row and column rerouting. The proposed approach chooses the local best processing element in each step to construct the leftmost logical columns, in order to utilize as many non-faults lying in the excluded rows as possible to enlarge the harvest of the algorithm. A more efficient reconfiguration algorithm is obtained by replacing the old rerouting approach with the new one. Experimental results clearly demonstrate the notable improvements in harvest over the most efficient algorithm cited in the literature. The harvest improvement increases with the increase of fault size, both for maximal target arrays and maximal square target arrays
- 1 December 2006
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 38 (3) , 223-235
Algorithmic aspects of area-efficient hardware/software partitioning
- 1 December 2006
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 38 (3) , 223-235
Algorithmic aspects of area-efficient hardware/software partitioning
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1875-1878
Efficient Algorithms for Hardware/Software Partitioning to Minimize Hardware Area
Area efficiency is one of the major considerations in constraint aware hardware/software partitioning process. This paper models hardware/software partitioning as an optimization problem with the objective of minimizing area utilization under the constraints of execution time and power consumption. An efficient heuristic algorithm running in O(n log n) is proposed by extending the method solving the 0-1 knapsack problem. Also, an exact algorithm based on dynamic programming is proposed to produce the optimal solution for small-sized problems. Computational results show that the proposed heuristic algorithm yields very good approximate solutions while dramatically reduces the execution time
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1875-1878
Efficient Algorithms for Hardware/Software Partitioning to Minimize Hardware Area
Area efficiency is one of the major considerations in constraint aware hardware/software partitioning process. This paper models hardware/software partitioning as an optimization problem with the objective of minimizing area utilization under the constraints of execution time and power consumption. An efficient heuristic algorithm running in O(n log n) is proposed by extending the method solving the 0-1 knapsack problem. Also, an exact algorithm based on dynamic programming is proposed to produce the optimal solution for small-sized problems. Computational results show that the proposed heuristic algorithm yields very good approximate solutions while dramatically reduces the execution time
- 1 September 2005
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 20 (5) , 647-653
Power Efficient Sub-Array in Reconfigurable VLSI Meshes
- 1 September 2005
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 20 (5) , 647-653
Power Efficient Sub-Array in Reconfigurable VLSI Meshes
- 2 December 2004
- Published by Elsevier in Information Sciences
- Vol. 167 (1-4) , 233-237
An efficient data structure for branch-and-bound algorithm
- 2 December 2004
- Published by Elsevier in Information Sciences
- Vol. 167 (1-4) , 233-237
An efficient data structure for branch-and-bound algorithm