ILP-Based Pin-Count Aware Design Methodology for Microfluidic Biochips Chiung-Yu Lin and Yao-Wen Chang Department of EE, NTU DAC 2009.

Slides:



Advertisements
Similar presentations
MICRO-BUMP ASSIGNMENT FOR 3D ICS USING ORDER RELATION TA-YU KUAN, YI-CHUN CHANG, TAI-CHEN CHEN DEPARTMENT OF ELECTRICAL ENGINEERING, NATIONAL CENTRAL UNIVERSITY,
Advertisements

Optimal Bus Sequencing for Escape Routing in Dense PCBs H.Kong, T.Yan, M.D.F.Wong and M.M.Ozdal Department of ECE, University of Illinois at U-C ICCAD.
A Graph-Partitioning-Based Approach for Multi-Layer Constrained Via Minimization Yih-Chih Chou and Youn-Long Lin Department of Computer Science, Tsing.
Optimization of Placement Solutions for Routability Wen-Hao Liu, Cheng-Kok Koh, and Yih-Lang Li DAC’13.
NCKU CSIE EDALAB Shang-Tsung Yu, Sheng-Han Yeh, and Tsung-Yi Ho Electronic Design Automation Laboratory.
Native-Conflict-Aware Wire Perturbation for Double Patterning Technology Szu-Yu Chen, Yao-Wen Chang ICCAD 2010.
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
Wen-Hao Liu1, Yih-Lang Li, and Cheng-Kok Koh Department of Computer Science, National Chiao-Tung University School of Electrical and Computer Engineering,
A Waveband Switching Architecture and Algorithm for Dynamic Traffic IEEE Communications Letters, Vol.7, No.8, August 2003 Xiaojun Cao, Vishal Anand, Chunming.
Meng-Kai Hsu, Sheng Chou, Tzu-Hen Lin, and Yao-Wen Chang Electronics Engineering, National Taiwan University Routability Driven Analytical Placement for.
Optimal Testing of Digital Microfluidic Biochips: A Multiple Traveling Salesman Problem R. Garfinkel 1, I.I. Măndoiu 2, B. Paşaniuc 2 and A. Zelikovsky.
Coupling-Aware Length-Ratio- Matching Routing for Capacitor Arrays in Analog Integrated Circuits Kuan-Hsien Ho, Hung-Chih Ou, Yao-Wen Chang and Hui-Fang.
Droplet-Aware Module-Based Synthesis for Fault-Tolerant Digital Microfluidic Biochips Elena Maftei, Paul Pop, and Jan Madsen Technical University of Denmark.
Simulated-Annealing-Based Solution By Gonzalo Zea s Shih-Fu Liu s
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,
A Scheduling and Routing Algorithm for DMFS Ring Layouts with Bus-phase Addressing Megha Gupta Srinivas Akella.
Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.
Combining High Level Synthesis and Floorplan Together EDA Lab, Tsinghua University Jinian Bian.
Tabu Search-Based Synthesis of Dynamically Reconfigurable Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark.
Chih-Hung Lin, Kai-Cheng Wei VLSI CAD 2008
MGR: Multi-Level Global Router Yue Xu and Chris Chu Department of Electrical and Computer Engineering Iowa State University ICCAD
Area-I/O Flip-Chip Routing for Chip-Package Co-Design Progress Report 方家偉、張耀文、何冠賢 The Electronic Design Automation Laboratory Graduate Institute of Electronics.
Authors: Jia-Wei Fang,Chin-Hsiung Hsu,and Yao-Wen Chang DAC 2007 speaker: sheng yi An Integer Linear Programming Based Routing Algorithm for Flip-Chip.
NCKU CSIE EDALAB Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan Tsung-Wei.
Etron Project: Placement and Routing for Chip-Package-Board Co-Design
Horizontal Benchmark Extension for Improved Assessment of Physical CAD Research Andrew B. Kahng, Hyein Lee and Jiajia Li UC San Diego VLSI CAD Laboratory.
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.
Low-Power Gated Bus Synthesis for 3D IC via Rectilinear Shortest-Path Steiner Graph Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, and Shih-Hung Weng UC San.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 EECS 527 Paper Presentation High-Performance.
BSG-Route: A Length-Matching Router for General Topology T. Yan and M. D. F. Wong University of Illinois at Urbana-Champaign ICCAD 2008.
Efficient Multi-Layer Obstacle- Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu,Meng-Xiang Li, Yao-Wen Chang.
Bus-Pin-Aware Bus-Driven Floorplanning B. Wu and T. Ho Department of Computer Science and Information Engineering NCKU GLSVLSI 2010.
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.
The Fast Optimal Voltage Partitioning Algorithm For Peak Power Density Minimization Jia Wang, Shiyan Hu Department of Electrical and Computer Engineering.
Path Scheduling on Digital Microfluidic Biochips Dan Grissom and Philip Brisk University of California, Riverside Design Automation Conference San Francisco,
Ping-Hung Yuh, Chia-Lin Yang, and Yao-Wen Chang
SVM-Based Routability-Driven Chip-Level Design for Voltage-Aware Pin-Constraint EWOD Chips Qin Wang 1, Weiran He, Hailong Yao 1, Tsung-Yi Ho 2, Yici Cai.
Register Placement for High- Performance Circuits M. Chiang, T. Okamoto and T. Yoshimura Waseda University, Japan DATE 2009.
Exact routing for digital microfluidic biochips with temporary blockages OLIVER KESZOCZE ROBERT WILLE ROLF DRECHSLER ICCAD’14.
1. Placement of Digital Microfluidic Biochips Using the T-tree Formulation Ping-Hung Yuh 1, Chia-Lin Yang 1, and Yao-Wen Chang 2 1 Dept. of Computer Science.
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,
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fang Shen, Wei-Chih Tseng NTU &Synopsys An Efficient Pre-assignment Routing Algorithm for Flip-Chip Designs.
1 SYNTHESIS of PIPELINED SYSTEMS for the CONTEMPORANEOUS EXECUTION of PERIODIC and APERIODIC TASKS with HARD REAL-TIME CONSTRAINTS Paolo Palazzari Luca.
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.
On Routing Fixed Escaped Boundary Pins for High Speed Boards T. Tsai, R. Lee, C. Chin and Y. Kajitani Global UniChip Corp. Hsinchu, Taiwan DATE 2011.
Reliability-Oriented Broadcast Electrode- Addressing for Pin-Constrained Digital Microfluidic Biochips Department of Computer Science and Information Engineering.
NCKU CSIE EDALAB Tsung-Wei Huang, Chun-Hsien Lin, and Tsung-Yi Ho Department of Computer Science and Information Engineering.
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.
Fast Online Synthesis of Generally Programmable Digital Microfluidic Biochips Dan Grissom and Philip Brisk University of California, Riverside CODES+ISSS.
1 of 16 April 25, 2006 System-Level Modeling and Synthesis Techniques for Flow-Based Microfluidic Large-Scale Integration Biochips Contact: Wajid Hassan.
Maze Routing Algorithms with Exact Matching Constraints for Analog and Mixed Signal Designs M. M. Ozdal and R. F. Hentschke Intel Corporation ICCAD 2012.
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,
1 NTUplace: A Partitioning Based Placement Algorithm for Large-Scale Designs Tung-Chieh Chen 1, Tien-Chang Hsu 1, Zhe-Wei Jiang 1, and Yao-Wen Chang 1,2.
Wajid Minhass, Paul Pop, Jan Madsen Technical University of Denmark
System in Package and Chip-Package-Board Co-Design
High-Performance Global Routing with Fast Overflow Reduction Huang-Yu Chen, Chin-Hsiung Hsu, and Yao-Wen Chang National Taiwan University Taiwan.
Physically Aware HW/SW Partitioning for Reconfigurable Architectures with Partial Dynamic Reconfiguration Sudarshan Banarjee, Elaheh Bozorgzadeh, Nikil.
ILP-Based Synthesis for Sample Preparation Applications on Digital Microfluidic Biochips ABHIMANYU YADAV, TRUNG ANH DINH, DAIKI KITAGAWA AND SHIGERU YAMASHITA.
Synthesis of Digital Microfluidic Biochips with Reconfigurable Operation Execution Elena Maftei Technical University of Denmark DTU Informatics
Routing-Based Synthesis of Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark CASES’101Routing-Based Synthesis.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
1 Double-Patterning Aware DSA Template Guided Cut Redistribution for Advanced 1-D Gridded Designs Zhi-Wen Lin and Yao-Wen Chang National Taiwan University.
11 Yibo Lin 1, Xiaoqing Xu 1, Bei Yu 2, Ross Baldick 1, David Z. Pan 1 1 ECE Department, University of Texas at Austin 2 CSE Department, Chinese University.
1 Placement-Aware Architectural Synthesis of Digital Microfluidic Biochips using ILP Elena Maftei Institute of Informatics and Mathematical Modelling Technical.
Prof. Yu-Chee Tseng Department of Computer Science
Elena Maftei Technical University of Denmark DTU Informatics
Fault-Tolerant Architecture Design for Flow-Based Biochips
Microfluidic Biochips
Presentation transcript:

ILP-Based Pin-Count Aware Design Methodology for Microfluidic Biochips Chiung-Yu Lin and Yao-Wen Chang Department of EE, NTU DAC 2009

Outline Introduction Pin demand and proposed flow Stage assignment Device assignment Placement and routing guideline Experimental results Conclusions

Introduction Digital microfluidic biochips, also referred to as lab- on-a-chip, have emerged as an alternative for conventional laboratory experiments. A biochip consists of a 2D electrode array and peripheral devices (optical detector, dispensing ports, etc.) Movement of the droplets are controlled by the electrodes.

Introduction Devices and reactions  Reservoirs/Dispensing ports: droplet generation  Optical detector: droplet detection  Mixer: mixing two droplets

Introduction The side view of the 2D array. A droplet moves to an adjacent electrode when this electrode is activated. A droplet can stay at one cell if its neighboring electrodes are not activated.

Introduction

Pin demand and proposed flow Classify the demand of pins N p into three categories:

Pin demand and proposed flow Stage assignment:  This stage minimizes P reaction by enables the synchronous control of the reactions.

Pin demand and proposed flow Device assignment:  This stage minimizes P branching by matching the reactions to specific devices.

Stage assignment Advantage of Synchronous Reactions  (a) Asynchronous: Mixers 1 and 2 are controlled separately and do not share a control pin. A shorter completion time is achieved.  (b) Synchronous: Mixers 1 and 2 are controlled together, the mixers must begin and cease their mixing reactions synchronously. Mixers 1 and 2 can share their control pins.

Stage assignment The Stage Assignment Problem Given a bioassay, stage assignment divides the reactions into a set of execution stages, and each stage is dedicated to a single category of reactions.  e.g., generation of certain sample/reagent, mixing, optical detection, etc.

Stage assignment Following are the constraints for the stage assignment: Capacity constraints:  The number of reactions in a stage is upper-bounded by the number of the devices belonging to the category of the stage. Uniqueness constraints:  A reaction exists in exactly one stage. Duration constraints:  The duration of a stage is the duration of the slowest reaction.

Stage assignment Sequence constraints:  Stages that belong to the same category are sorted and executed sequentially without overlapping. Precedence constraints:  If reaction R i must happen before reaction R j, then the stage that includes R j can begin only after the stage of R i ends.

Problem Formulation for Stage Assignment Given:

Problem Formulation for Stage Assignment Find:  A partitioning of S r into independent stages S m,1, S m,2, …, S m,Im, where S m,i represents the i-th stage for D m, and I m represents the max number of stages for D m.  Corresponding start time B m,i and finish time E m,i for these stages. Minimize:

ILP Formulation for Stage Assignment

Solution Space Reduction Reaction Category Mapping  All g n,m,i with m≠V n can be removed. Upper Bound for the Stage Number  Bound the number of stages used by each device category. Lower Bound for Assay Completion Time  Add a lower bound for the assay completion time into the ILP formulation to speed up the runtime.

Device Assignment Effect of Device Permutation  Device assignment can affect the number of branchings.  In (b), {1-1, 1-2, 2-1} three paths are used.  In (c), {1-1, 2-1} only two paths are used and thus fewer electrodes are needed for controlling the branchings.

Problem Formulation for Device Assignment Given:  S r, S d, V n, C m, S p, S m,i same as that from stage assignment. Find:  x n,z is the occurrence of that R n is assigned to the z-th device of the category. Minimize:  p m1,z1,m2,z2 denotes the existence of a path from the z 1 -th device of D m1 to the z 2 -th device of D m2.

ILP Formulation for Device Assignment

Solution-Space Reduction Redundancy Pruning Reduce the solution space by removing the path around universal peripheral reactions. R1 R2 R3 R4

Placement and Routing Guideline Pin-Count Saving Guidelines  Provide guarding cells between two electrodes that work in separate time spans.  Electrodes E1 and E2 are turned on for different routing paths in separate time slots, but they still cannot be controlled by the same pin because they are neighbors.

Placement and Routing Guideline Propose the following placement and routing guidelines:  The placement and routing for the entire bioassay should be decided simultaneously on a 2D plane.  Routing paths should not touch each other, except for necessary crossings or branchings.  Guarding electrodes should be placed between devices and devices.

Experimental Results

Conclusions ILP-based algorithms have been proposed for the stage and device assignments with effective solution-space reductions.