Yu-Wei Wu Yi-Yu Shi Sudip Roy Tsung-Yi Ho3

Slides:



Advertisements
Similar presentations
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Advertisements

Optimization of Placement Solutions for Routability Wen-Hao Liu, Cheng-Kok Koh, and Yih-Lang Li DAC’13.
Yi-Lin Chuang1, Sangmin Kim2, Youngsoo Shin2, and Yao-Wen Chang National Taiwan University, Taiwan KAIST, Korea 2010 DAC.
Hsi-An Chien Ting-Chi Wang Redundant-Via-Aware ECO Routing ASPDAC2014.
3D-STAF: Scalable Temperature and Leakage Aware Floorplanning for Three-Dimensional Integrated Circuits Pingqiang Zhou, Yuchun Ma, Zhouyuan Li, Robert.
A Novel Cell Placement Algorithm For Flexible TFT Circuit With Mechanical Strain And Temperature Consideration Jiun-Li Lin, Po-Hsun Wu, and Tsung-Yi Ho.
X-Architecture Placement Based on Effective Wire Models Tung-Chieh Chen, Yi-Lin Chuang, and Yao-Wen Chang Graduate Institute of Electronics Engineering.
Meng-Kai Hsu, Sheng Chou, Tzu-Hen Lin, and Yao-Wen Chang Electronics Engineering, National Taiwan University Routability Driven Analytical Placement for.
A Size Scaling Approach for Mixed-size Placement Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan School of Electrical and Computer Engineering.
Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, Mixed Integer Programming Models.
Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement Xu He, Tao Huang, Linfu Xiao, Haitong Tian, Guxin Cui and Evangeline F.Y. Young.
An Optimal Algorithm of Adjustable Delay Buffer Insertion for Solving Clock Skew Variation Problem Juyeon Kim, Deokjin Joo, Taehan Kim DAC’13.
Ahmed Awad Atsushi Takahash Satoshi Tanakay Chikaaki Kodamay ICCAD’14
Rate-Distortion Optimal Skeleton-Based Shape Coding Haohong Wang, Aggelos K. Katsaggelos, and Thrasyvoulos N. Pappas Image Processing, Proceedings.
An ILP-based Automatic Bus Planner for Dense PCBs P. C. Wu, Q. Ma and M. D. F. Wong Department of Electrical and Computer Engineering, University of Illinois.
38 th Design Automation Conference, Las Vegas, June 19, 2001 Creating and Exploiting Flexibility in Steiner Trees Elaheh Bozorgzadeh, Ryan Kastner, Majid.
Supply Voltage Degradation Aware Analytical Placement Andrew B. Kahng, Bao Liu and Qinke Wang UCSD CSE Department {abk, bliu,
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
A Proposal for Routing-Based Timing-Driven Scan Chain Ordering Puneet Gupta 1 Andrew B. Kahng 1 Stefanus Mantik 2
On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.
Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing Y.Thomas Hou, Yi Shi, Jianping Pan, Scott F.Midkiff Mobile.
Floorplanning and Signal Assignment for Silicon Interposer-based 3D ICs W. H. Liu, M. S. Chang and T. C. Wang Department of Computer Science, NTHU, Taiwan.
Optimally Minimizing Overlay Violation in Self-aligned Double Patterning Decomposition for Row-based Standard Cell Layout in Polynomial Time Z. Xiao, Y.
CDCTree: Novel Obstacle-Avoiding Routing Tree Construction based on Current Driven Circuit Model Speaker: Lei He.
1 Target-Oriented Scheduling in Directional Sensor Networks Yanli Cai, Wei Lou, Minglu Li,and Xiang-Yang Li* The Hong Kong Polytechnic University, Hong.
Chih-Hung Lin, Kai-Cheng Wei VLSI CAD 2008
A Topology-based ECO Routing Methodology for Mask Cost Minimization Po-Hsun Wu, Shang-Ya Bai, and Tsung-Yi Ho Department of Computer Science and Information.
Xin-Wei Shih and Yao-Wen Chang.  Introduction  Problem formulation  Algorithms  Experimental results  Conclusions.
Pattern Selection based co-design of Floorplan and Power/Ground Network with Wiring Resource Optimization L. Li, Y. Ma, N. Xu, Y. Wang and X. Hong WuHan.
Block-level 3D IC Design with Through-Silicon-Via Planning Dae Hyun Kim, Rasit Onur Topaloglu, and Sung Kyu Lim Department of Electrical and Computer Engineering,
Etron Project: Placement and Routing for Chip-Package-Board Co-Design
Fast Thermal Analysis on GPU for 3D-ICs with Integrated Microchannel Cooling Zhuo Fen and Peng Li Department of Electrical and Computer Engineering, {Michigan.
TSV-Aware Analytical Placement for 3D IC Designs Meng-Kai Hsu, Yao-Wen Chang, and Valerity Balabanov GIEE and EE department of NTU DAC 2011.
1 Hiding Data in Images by Simple LSB Substitution Source: Pattern Recognition, Vol. 37, pp , 2004 Authors: Chi-Kwong Chan and L.M. Cheng Speaker:
A NEW ECO TECHNOLOGY FOR FUNCTIONAL CHANGES AND REMOVING TIMING VIOLATIONS Jui-Hung Hung, Yao-Kai Yeh,Yung-Sheng Tseng and Tsai-Ming Hsieh Dept. of Information.
Regularity-Constrained Floorplanning for Multi-Core Processors Xi Chen and Jiang Hu (Department of ECE Texas A&M University), Ning Xu (College of CST Wuhan.
Reconstructing shredded documents through feature matching Authors: Edson Justino, Luiz S. Oliveira, Cinthia Freitas Source: Forensic Science International.
Mobile Robot Navigation Using Fuzzy logic Controller
Jason Cong‡†, Guojie Luo*†, Kalliopi Tsota‡, and Bingjun Xiao‡ ‡Computer Science Department, University of California, Los Angeles, USA *School of Electrical.
Approximation algorithms for TSP with neighborhoods in the plane R 郭秉鈞 R 林傳健.
IO CONNECTION ASSIGNMENT AND RDL ROUTING FOR FLIP-CHIP DESIGNS Jin-Tai Yan, Zhi-Wei Chen 1 ASPDAC.2009.
Tao Lin Chris Chu TPL-Aware Displacement- driven Detailed Placement Refinement with Coloring Constraints ISPD ‘15.
1 Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen Chang, Chia-Lin Yang National Taiwan.
A SAT-Based Routing Algorithm for Cross-Referencing Biochips Ping-Hung Yuh 1, Cliff Chiung-Yu Lin 2, Tsung- Wei Huang 3, Tsung-Yi Ho 3, Chia-Lin Yang 4,
1 University of Texas at Austin Machine Learning Group 图像与视频处理 计算机学院 Motion Detection and Estimation.
LatchPlanner:Latch Placement Algorithm for Datapath-oriented High-Performance VLSI Design Minsik Cho, Hua Xiang, Haoxing Ren, Matthew M. Ziegler, Ruchir.
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh University of Maryland Bruce Golden University.
Hsing-Chih Chang Chien Hung-Chih Ou Tung-Chieh Chen Ta-Yu Kuan Yao-Wen Chang Double Patterning Lithography-Aware Analog Placement.
D. M. J. Tax and R. P. W. Duin. Presented by Mihajlo Grbovic Support Vector Data Description.
An Efficient Linear Time Triple Patterning Solver Haitong Tian Hongbo Zhang Zigang Xiao Martin D.F. Wong ASP-DAC’15.
Escape Routing of Mixed-Pattern Signals Based on Staggered-Pin- Array PCBs K. Wang, H. Wang and S. Dong Department of Computer Science & Technology, Tsinghua.
PARR:Pin Access Planning and Regular Routing for Self-Aligned Double Patterning XIAOQING XU BEI YU JHIH-RONG GAO CHE-LUN HSU DAVID Z. PAN DAC’15.
ILP-Based Inter-Die Routing for 3D ICs Chia-Jen Chang, Pao-Jen Huang, Tai-Chen Chen, and Chien-Nan Jimmy Liu Department of Electrical Engineering, National.
Exploiting Group Recommendation Functions for Flexible Preferences.
Exact Differentiable Exterior Penalty for Linear Programming Olvi Mangasarian UW Madison & UCSD La Jolla Edward Wild UW Madison December 20, 2015 TexPoint.
Routability-driven Floorplanning With Buffer Planning Chiu Wing Sham Evangeline F. Y. Young Department of Computer Science & Engineering The Chinese University.
BOB-Router: A New Buffering-Aware Global Router with Over-the-Block Routing Resources Yilin Zhang1, Salim Chowdhury2 and David Z. Pan1 1 Department of.
LEMAR: A Novel Length Matching Routing Algorithm for Analog and Mixed Signal Circuits H. Yao, Y. Cai and Q. Gao EDA Lab, Department of CS, Tsinghua University,
Visual Clustering in Parallel Coordinates Author: HongZhou,Xiaoru Yuan, Huamin Qu, Weiwei Cui, Baoquan Chen Presenter: Yingyu Wu.
System in Package and Chip-Package-Board Co-Design
Pixel Parallel Vessel Tree Extraction for a Personal Authentication System 2010/01/14 學生:羅國育.
Partial Reconfigurable Designs
Data Driven Resource Allocation for Distributed Learning
VLSI Quadratic Placement
You can check broken videos in this slide here :
EE5780 Advanced VLSI Computer-Aided Design
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range
A Block Based MAP Segmentation for Image Compression
Micrositing for Wind Turbines
Presentation transcript:

Yu-Wei Wu Yi-Yu Shi Sudip Roy Tsung-Yi Ho3 Obstacle-Avoiding Wind Turbine Placement for Power-Loss and Wake-Effect Optimization Yu-Wei Wu Yi-Yu Shi Sudip Roy Tsung-Yi Ho3 ASP-DAC’15

Outline Introduction Preliminaries Proposed Method Experimental result Conclusions

Introduction The main difficulty in designing a wind farm is the wind turbine placement problem that would directly influence the produced power. The most considered factor in the wind turbine placement problem is to reduce the wake effect.

Introduction When the wind flows through the wind turbines, the wake effect is caused due to the fact that each wind turbine produces abnormal turbulence behind it and effects downstream indirectly. Hence, minimizing the wake effect can lead to maximizing the power generation.

Introduction In the wind turbine placement problem the blocks are in irregular shape and they can overlap without violation of the center of the wind turbine into the obstacle. Along with the wake effect, we additionally consider wirelength and obstacle-avoiding at the same time.

Preliminaries Let X = {x1, . . . , xn} and Y = {y1, . . . , yn} be the sets of x and y-coordinates of n wind turbines with m obstacles in the plane. We use the penalty function to incorporate the constraint and wirelength cost as

Wirelength Model As the half-perimeter wirelength(HPWL) is not differentiable, we use the log-sum-exp wirelength model [10] in our wirelength computation given by Eq.(2).

Bell-shaped Function In order to smooth the non-differentiable and non-smoothing density, we use the bell-shaped function [11] as follows

Constraints Constraint 1: Wind turbines may be damaged by turbulence when they are too close to each other. Constraint 2: An obstacle means that the location is not suitable to set up the wind turbine.

Power Output We use the Park wake model [4] to evaluate the wake effects. The expected value of power generation (η) of the whole wind farm is given by

Proposed Method Region Separation Based on Wake Effect Obstacle-Avoidance Method Gradually Approximation Method Wind Turbine Placement

Region Separation Based on Wake Effect

We consider the wake effect block as an irregular shape in the plane We consider the wake effect block as an irregular shape in the plane. We adjust the size of wake effect block (wv) for computing the wake effect density in a bin as follows

12

Obstacle-Avoidance Method After obtaining the next location of a wind turbine by separateRegion(),the center of the wind turbine may move on to the obstacle Ob. In the next round, the wind turbine may escape from the obstacle Ob and again it hides.

Gradually Approximation Method we diffuse the wind turbines through gradually increasing the wake effect distances using a procedure increasingWakeEffect(). Fig.7 shows how the wake effect distances gradually increase.

Wind Turbine Placement

Experimental result We implement the proposed method using C++ on a 64-bit Linux machine with 3.4-GHz processor and 8GB RAM.

Conclusion In this paper, we have proposed an algorithm to solve the wind turbine placement problem with the help of the analytical method and based on the gradually approximation method. In the best of our knowledge, for the first time, we have considered wake effect, wirelength and obstacle-avoiding all together at the same time.