Tabu Search-Based Synthesis of Dynamically Reconfigurable Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark.

Slides:



Advertisements
Similar presentations
Force-Directed List Scheduling for DMFBs Kenneth ONeal, Dan Grissom, Philip Brisk Department of Computer Science and Engineering Bourns College of Engineering.
Advertisements

ECE 667 Synthesis and Verification of Digital Circuits
A Field-Programmable Pin-Constrained Digital Microfluidic Biochip Dan Grissom and Philip Brisk University of California, Riverside Design Automation Conference.
Multi-dimensional Packet Classification on FPGA: 100Gbps and Beyond
Courseware Integer Linear Programming approach to Scheduling Sune Fallgaard Nielsen Informatics and Mathematical Modelling Technical University of Denmark.
NCKU CSIE EDALAB Shang-Tsung Yu, Sheng-Han Yeh, and Tsung-Yi Ho Electronic Design Automation Laboratory.
Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.
CPSC 335 Dr. Marina Gavrilova Computer Science University of Calgary Canada.
Carnegie Mellon ICAPS Sept, 2007 Benchmark Problems for Oversubscribed Scheduling Laura V. Barbulescu and Laurence A. Kramer and Stephen F. Smith.
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.
Droplet-Aware Module-Based Synthesis for Fault-Tolerant Digital Microfluidic Biochips Elena Maftei, Paul Pop, and Jan Madsen Technical University of Denmark.
Computer-Aided Design for Microfluidic Chips Based on Multilayer Soft Lithography Nada Amin 1, William Thies 2, Saman Amarasinghe 1 1 Massachusetts Institute.
Scheduling with Optimized Communication for Time-Triggered Embedded Systems Slide 1 Scheduling with Optimized Communication for Time-Triggered Embedded.
Data Partitioning for Reconfigurable Architectures with Distributed Block RAM Wenrui Gong Gang Wang Ryan Kastner Department of Electrical and Computer.
Storage Assignment during High-level Synthesis for Configurable Architectures Wenrui Gong Gang Wang Ryan Kastner Department of Electrical and Computer.
HW/SW Co-Synthesis of Dynamically Reconfigurable Embedded Systems HW/SW Partitioning and Scheduling Algorithms.
1 of 14 1 / 18 An Approach to Incremental Design of Distributed Embedded Systems Paul Pop, Petru Eles, Traian Pop, Zebo Peng Department of Computer and.
A Scheduling and Routing Algorithm for DMFS Ring Layouts with Bus-phase Addressing Megha Gupta Srinivas Akella.
Torino (Italy) – June 25th, 2013 Ant Colony Optimization for Mapping, Scheduling and Placing in Reconfigurable Systems Christian Pilato Fabrizio Ferrandi,
NCKU CSIE EDALAB Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan Tsung-Wei.
A Field-Programmable Pin-Constrained Digital Microfluidic Biochip Dan Grissom and Philip Brisk University of California, Riverside Design Automation Conference.
Recent Research and Emerging Challenges in the System-Level Design of Digital Microfluidic Biochips Paul Pop, Elena Maftei, Jan Madsen Technical University.
Programmable Microfluidics Using Soft Lithography J.P. Urbanski Advisor: Todd Thorsen Hatsopoulos Microfluidics Lab, MIT January 25/2006.
A Unified Modeling Framework for Distributed Resource Allocation of General Fork and Join Processing Networks in ACM SIGMETRICS
Operating Systems for Reconfigurable Systems John Huisman ID:
Software Pipelining for Stream Programs on Resource Constrained Multi-core Architectures IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEM 2012 Authors:
Automatic Synthesis of Microfluidic Large Scale Integration Chips from a Domain-Specific Language Jeffrey McDaniel, Christopher Curtis, Philip Brisk University.
Integrated Circuits and Systems Laboratory Darmstadt University of Technology Design Space Exploration of incompletely specified Embedded Systems.
CMPE 511 Computer Architecture A Faster Optimal Register Allocator Betül Demiröz.
Energy/Reliability Trade-offs in Fault-Tolerant Event-Triggered Distributed Embedded Systems Junhe Gan, Flavius Gruian, Paul Pop, Jan Madsen.
1 Towards Optimal Custom Instruction Processors Wayne Luk Kubilay Atasu, Rob Dimond and Oskar Mencer Department of Computing Imperial College London HOT.
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.
ILP-Based Pin-Count Aware Design Methodology for Microfluidic Biochips Chiung-Yu Lin and Yao-Wen Chang Department of EE, NTU DAC 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.
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,
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
2013/12/09 Yun-Chung Yang Partitioning and Allocation of Scratch-Pad Memory for Priority-Based Preemptive Multi-Task Systems Takase, H. ; Tomiyama, H.
Task Graph Scheduling for RTR Paper Review By Gregor Scott.
Johnathan Fiske, *Dan Grissom, Philip Brisk
2004/06/01 1 Issues about Scheduling for Dependent Multimedia Tasks 電機所控制組 R 馮天俊 R 戴兆弘 Adviser :陳少傑 老師 Date : 2004/06/01.
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.
Wajid Minhass, Paul Pop, Jan Madsen Technical University of Denmark
Martin Kruliš by Martin Kruliš (v1.1)1.
Outline Motivation and Contributions Related Works ILP Formulation
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.
Output Grouping-Based Decomposition of Logic Functions Petr Fišer, Hana Kubátová Department of Computer Science and Engineering Czech Technical University.
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
1 Hardware-Software Co-Synthesis of Low Power Real-Time Distributed Embedded Systems with Dynamically Reconfigurable FPGAs Li Shang and Niraj K.Jha Proceedings.
System-Level Modeling and Simulation of the Cell Culture Microfluidic Biochip ProCell Wajid Hassan Minhass †, Paul Pop †, Jan Madsen † Mette Hemmingsen.
Synthesis of Digital Microfluidic Biochips with Reconfigurable Operation Execution Elena Maftei Technical University of Denmark DTU Informatics
Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems Domițian Tămaș-Selicean and Paul Pop Technical University of Denmark.
Synthesis of Reliable Digital Microfluidic Biochips using Monte Carlo Simulation Elena Maftei, Paul Pop, Florin Popenţiu Vlădicescu Technical University.
An Algorithm for Automatically Obtaining Distributed and Fault Tolerant Static Schedules Alain Girault - Hamoudi Kalla - Yves Sorel - Mihaela Sighireanu.
Static Translation of Stream Program to a Parallel System S. M. Farhad The University of Sydney.
Routing-Based Synthesis of Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark CASES’101Routing-Based Synthesis.
Optimization of Time-Partitions for Mixed-Criticality Real-Time Distributed Embedded Systems Domițian Tămaș-Selicean and Paul Pop Technical University.
Synthesis of Biochemical Applications on Digital Microfluidic Biochips with Operation Variability Mirela Alistar, Elena Maftei, Paul Pop, Jan Madsen.
1 Placement-Aware Architectural Synthesis of Digital Microfluidic Biochips using ILP Elena Maftei Institute of Informatics and Mathematical Modelling Technical.
Architecture Synthesis for Cost Constrained Fault Tolerant Biochips
Elena Maftei Technical University of Denmark DTU Informatics
Improved schedulability on the ρVEX polymorphic VLIW processor
Fault-Tolerant Architecture Design for Flow-Based Biochips
Microfluidic Biochips
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Final Project presentation
Presentation transcript:

Tabu Search-Based Synthesis of Dynamically Reconfigurable Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark DTU Informatics

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs Digital Microfluidic Biochip Biochip created at Duke University

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 3 Microfluidic Biochips Applications – Sampling and real time testing of air/water for biochemical toxins – Detection of adverse atmospheric conditions – DNA analysis and sequencing – Clinical diagnosis – Point of care devices Types: – Continuous flow microfluidic biochips – Digital microfluidic biochips

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 4 Microfluidic Biochips Advantages: – High throughput (reduced sample / reagent consumption)‏ – Space (miniaturization)‏ – Time (parallelism)‏ – Automation (minimal human intervention)‏ Challenges: – Design complexity – Radically different design and test methods required

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 5 Outline Motivation Architecture Typical Design Tasks Problem Formulation Proposed Solution  Tabu Search-Based Synthesis  Dynamic Placement Algorithm Experimental Evaluation Conclusions

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 6 Architecture and Working Principles Biochip architectureCell architecture Electrowetting-on-dielectric Operations: Dispensing Transport Mixing Splitting Storage

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 7 Architecture and Working Principles Biochip architectureCell architecture Electrowetting-on-dielectric Operations: Dispensing Transport Mixing Splitting Storage

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 8 Architecture and Working Principles Biochip architectureCell architecture Electrowetting-on-dielectric Operations: Dispensing Transport Mixing Splitting Storage

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 9 Design Tasks Operation Area(cells)‏ Time(s)‏ Mixing Dilution 2x2 1x3 2x

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 10 Design Tasks Allocation Operation Area(cells)‏ Time(s)‏ Mixing Dilution 2x2 1x3 2x

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 11 Design Tasks Binding & Scheduling Allocation Operation Area(cells)‏ Time(s)‏ Mixing Dilution 2x2 1x3 2x

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 12 Design Tasks Binding & Scheduling Placement & Routing Allocation Operation Area(cells)‏ Time(s)‏ Mixing Dilution 2x2 1x3 2x

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 13 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 18 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 20 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 22 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 23 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 24 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 25 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 26 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 27 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 28 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 29 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 30 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 31 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 32 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 33 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 34 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 35 Reconfigurability Constraint on the overhead brought by droplet routing.

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 36 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 37 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 38 Reconfigurability

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 39 Reconfigurability Without dynamic reconfiguration: t+18

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 40 Problem Formulation Input – Sequencing graph – Library of modules – Area constraint Output – Implementation which minimizes application execution time Allocation of modules from modules library Binding of modules to operations in sequencing graph Scheduling of operations Placement of modules on the array

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 41 Related Work F. Su and K. Chakrabarty Unified high-level synthesis and module placement for defect-tolerant microfluidic biochips. In Proceedings of Design Automation Conference P.-H. Yuh, C.-L. Yang and Y.-W. Chang Placement of defect-tolerant digital microfluidic biochips using the T- tree formulation. ACM Journal on Emerging Technologies in Computing Systems 3(3).

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 42 Related Work F. Su and K. Chakrabarty Unified high-level synthesis and module placement for defect-tolerant microfluidic biochips. In Proceedings of Design Automation Conference P.-H. Yuh, C.-L. Yang and Y.-W. Chang Placement of defect-tolerant digital microfluidic biochips using the T- tree formulation. ACM Journal on Emerging Technologies in Computing Systems 3(3). These works consider fixed modules for all operations.

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 43 Optimisation Strategy Design Optimisation: – Allocation of modules from the library – Binding of modules to operations – Priorities of operations – Schedule of the operations  Placement of modules is performed inside scheduling – Placement of the modules  Algorithm proposed for DR-FPGAs  Free space manager that divides the free space into rectangles  Search engine that selects the best empty rectangle  We have modified MER in order to minimise the fragmentation of free space on the chip Tabu Search List Scheduling MER (Maximal Empty Rectangles)

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 45 Dynamic Placement Algorithm

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 46 Dynamic Placement Algorithm

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 47 Dynamic Placement Algorithm

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 48 Dynamic Placement Algorithm

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs Experimental Evaluation  TS Algorithm implemented in Java  3 set of tests 1.Quality of the proposed algorithm  Comparison with an Integer Linear Programming (ILP) approach 2.Improvement brought by dynamic reconfiguration  Comparison between complete TS algorithm and the same algorithm without considering dynamic reconfiguration 3.Comparison with the approach proposed by Yuh et al.

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 50 Experimental Results Quality of the solution: comparison with an ILP Implementation PCR In Vitro Diagnosis

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 51 Experimental Results Improvement brought by dynamic reconfiguration in schedule length 60min 10min 1min Colorimetric protein assay

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 52 Experimental Results Comparison with Yuh et al. Colorimetric protein assay

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 53 Conclusions  Addressed design problems characteristic to digital microfluidic biochips.  Proposed a Tabu Search-based method for the unified allocation, binding, scheduling and dynamic placement.  Shown that by taking advantage of the reconfigurability of digital microfluidic biochips during the execution of operations leads to improvements.

13/10/2009 Tabu Search-Based Synthesis of Dynamically Reconfigurable DMBs 54 …and answers