Wei Jiang

University of California, Los Angeles, Los Angeles, CA, USA

Are you Wei Jiang?

Claim your profile

Publications (3)1.22 Total impact

  • Source
    Article: Synthesis Algorithm for Application-Specific Homogeneous Processor Networks
    [show abstract] [hide abstract]
    ABSTRACT: The application specific multiprocessor system-on-a-chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high performance attributed to application specific optimizations. However, designing an optimal application specific multiprocessor system is still challenging because there are a number of important metrics, such as throughput, latency, and resource usage, which need to be explored and optimized. This paper addresses the problem of synthesizing an application-specific multiprocessor system for stream-oriented embedded applications to minimize system latency under the throughput constraint. We employ a novel framework for this problem, similar to that of technology mapping in the logic synthesis domain, and develop a set of efficient algorithms, including labeling and clustering for efficient generation of the multiprocessor architecture with application specific optimized latency. Specifically, the result of our algorithm is latency optimal for directed acyclic task graphs. Application of our approach to the Motion JPEG example on Xilinx's Virtex II Pro platform FPGA shows interesting design tradeoffs.
    IEEE Transactions on Very Large Scale Integration (VLSI) Systems 10/2009; · 1.22 Impact Factor
  • Source
    Conference Proceeding: Scheduling with integer time budgeting for low-power optimization
    [show abstract] [hide abstract]
    ABSTRACT: In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constraint matrix has a special property that enables a polynomial-time algorithm to solve the problem optimally with a guaranteed integral solution. Our theory can be directly applied to solving a scheduling problem in behavioral synthesis with the objective of minimizing the system power consumption. Given a set of scheduling constraints and a collection of convex power-delay tradeoff curves for each type of operation, our scheduler can intelligently schedule the operations to appropriate clock cycles and simultaneously select the module implementations that lead to low-power solutions. Experiments demonstrate that our proposed technique can produce near-optimal results (within 6% of the optimum by the ILP formulation), with 40x+ speedup.
    Design Automation Conference, 2008. ASPDAC 2008. Asia and South Pacific; 04/2008
  • Source
    Conference Proceeding: Behavior and communication co-optimization for systems with sequential communication media.
    Proceedings of the 43rd Design Automation Conference, DAC 2006, San Francisco, CA, USA, July 24-28, 2006; 01/2006

Institutions

  • 2006–2009
    • University of California, Los Angeles
      • Department of Computer Science
      Los Angeles, CA, USA