Johnathan Fiske, *Dan Grissom, Philip Brisk

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

Force-Directed List Scheduling for DMFBs Kenneth ONeal, Dan Grissom, Philip Brisk Department of Computer Science and Engineering Bourns College of Engineering.
FPGA (Field Programmable Gate Array)
Copyright  2003 Dan Gajski and Lukai Cai 1 Transaction Level Modeling: An Overview Daniel Gajski Lukai Cai Center for Embedded Computer Systems University.
A Field-Programmable Pin-Constrained Digital Microfluidic Biochip Dan Grissom and Philip Brisk University of California, Riverside Design Automation Conference.
NCKU CSIE EDALAB Shang-Tsung Yu, Sheng-Han Yeh, and Tsung-Yi Ho Electronic Design Automation Laboratory.
Level set based Image Segmentation Hang Xiao Jan12, 2013.
Geiger-Muller detector and Ionization chamber
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.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Characterisation and Reliability Testing of THz Schottky Diodes Chris Price University of Birmingham, UK
1 Energy Savings and Speedups from Partitioning Critical Software Loops to Hardware in Embedded Systems Greg Stitt, Frank Vahid, Shawn Nematbakhsh University.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Linear Scan Register Allocation POLETTO ET AL. PRESENTED BY MUHAMMAD HUZAIFA (MOST) SLIDES BORROWED FROM CHRISTOPHER TUTTLE 1.
Tabu Search-Based Synthesis of Dynamically Reconfigurable Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark.
Fuzzy control of a mobile robot Implementation using a MATLAB-based rapid prototyping system.
Design and Verification Tools for Continuous Fluid Flow- based Microfluidic Devices Jeffrey McDaniel, Auralila Baez, Brian Crites, Aditya Tammewar, Philip.
A HIGH RESOLUTION 3D TIRE AND FOOTPRINT IMPRESSION ACQUISITION DEVICE FOR FORENSICS APPLICATIONS RUWAN EGODA GAMAGE, ABHISHEK JOSHI, JIANG YU ZHENG, MIHRAN.
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
NCKU CSIE EDALAB Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan Tsung-Wei.
What is a Protocol A set of definitions and rules defining the method by which data is transferred between two or more entities or systems. The key elements.
A Field-Programmable Pin-Constrained Digital Microfluidic Biochip Dan Grissom and Philip Brisk University of California, Riverside Design Automation Conference.
Power Reduction for FPGA using Multiple Vdd/Vth
Automatic Synthesis of Microfluidic Large Scale Integration Chips from a Domain-Specific Language Jeffrey McDaniel, Christopher Curtis, Philip Brisk University.
Wen-Hao Liu 1, Yih-Lang Li 1, and Kai-Yuan Chao 2 1 Department of Computer Science, National Chiao-Tung University, Hsin-Chu, Taiwan 2 Intel Architecture.
High-Level Interconnect Architectures for FPGAs Nick Barrow-Williams.
Electric Potential Difference Physics A Current #1.
ASIP Architecture for Future Wireless Systems: Flexibility and Customization Joseph Cavallaro and Predrag Radosavljevic Rice University Center for Multimedia.
1 Extending Atmel FPGA Flow Nikos Andrikos TEC-EDM, ESTEC, ESA, Netherlands DAUIN, Politecnico di Torino, Italy NPI Final Presentation 25 January 2013.
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.
Design & Co-design of Embedded Systems Next Step: Transaction-Level Modeling Maziar Goudarzi.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
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,
Introduction to Electricity Electric charges come in two varieties. We have named these positive and negative. To be mathematically consistent all of electricity.
Reliability-Oriented Broadcast Electrode- Addressing for Pin-Constrained Digital Microfluidic Biochips Department of Computer Science and Information Engineering.
Fast Online Synthesis of Generally Programmable Digital Microfluidic Biochips Dan Grissom and Philip Brisk University of California, Riverside CODES+ISSS.
NCKU CSIE EDALAB Tsung-Wei Huang and Tsung-Yi Ho Department of Computer Science and Information Engineering National Cheng.
Parallel Routing for FPGAs based on the operator formulation
1 of 16 April 25, 2006 System-Level Modeling and Synthesis Techniques for Flow-Based Microfluidic Large-Scale Integration Biochips Contact: Wajid Hassan.
FPGA Hardware Synthesis Jessica Baxter. Reference M. Haldar, A. Nayak, N. Shenoy, A. Choudhary and P. Banerjee, “FPGA Hardware Synthesis from MATLAB”,
Wajid Minhass, Paul Pop, Jan Madsen Technical University of Denmark
Multimedia Computing and Networking Jan Reduced Energy Decoding of MPEG Streams Malena Mesarina, HP Labs/UCLA CS Dept Yoshio Turner, HP Labs.
Streaming Applications for Robots with Real Time QoS Oct Supun Kamburugamuve Indiana University.
Integrated Microsystems Lab. EE372 VLSI SYSTEM DESIGNE. Yoon 1-1 Panorama of VLSI Design Fabrication (Chem, physics) Technology (EE) Systems (CS) Matel.
ILP-Based Synthesis for Sample Preparation Applications on Digital Microfluidic Biochips ABHIMANYU YADAV, TRUNG ANH DINH, DAIKI KITAGAWA AND SHIGERU YAMASHITA.
FPGA Logic Cluster Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Synthesis of Digital Microfluidic Biochips with Reconfigurable Operation Execution Elena Maftei Technical University of Denmark DTU Informatics
CP 208 Digital Electronics Class Lecture 6 March 4, 2009.
Routing-Based Synthesis of Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark CASES’101Routing-Based Synthesis.
Proximity Optimization for Adaptive Circuit Design Ang Lu, Hao He, and Jiang Hu.
1 Placement-Aware Architectural Synthesis of Digital Microfluidic Biochips using ILP Elena Maftei Institute of Informatics and Mathematical Modelling Technical.
Partial Reconfigurable Designs
Support for Program Analysis as a First-Class Design Constraint in Legion Michael Bauer 02/22/17.
Jacob R. Lorch Microsoft Research
Digital Electronics Class Lecture October 22, 2008
Elena Maftei Technical University of Denmark DTU Informatics
Bluetooth Based Smart Sensor Network
Dynamic Programming.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Microfluidic Biochips
Design Automation for Flow-based Microfluidic BioChips
FPGA Glitch Power Analysis and Reduction
HIGH LEVEL SYNTHESIS.
Transaction Level Modeling: An Overview
Area Coverage Problem Optimization by (local) Search
Presentation transcript:

Exploring Speed and Energy Tradeoffs in Droplet Transport for Digital Microfluidic Biochips Johnathan Fiske, *Dan Grissom, Philip Brisk University of California, Riverside 19th Asia & South PacificDesign Automation Conference Singapore, January 21, 2014

Microfluidics will replace traditional bench-top chemistry The Bottom Line Microfluidics will replace traditional bench-top chemistry

The Future of Chemistry Microfluidics “Digital” Discrete Droplet Based Miniaturization + Automation of Biochemistry

Applications Biochemical reactions and immunoassays Clinical pathology Drug discovery and testing Rapid assay prototyping Biochemical terror and hazard detection DNA extraction & sequencing

Digital Microfluidic Biochips (DMFB) 101 Top Plate Ground Electrode Droplet Hydrophobic Layer A Digital Microfluidic Biochip (DMFB) Bottom Plate CE1 CE2 CE3 Control Electrodes Basic Microfluidic Operations http://microfluidics.ee.duke.edu/

Digital Microfluidic Biochips (DMFB) 101 Droplet Actuation on a Prototype DMFB at the University of Tennessee

How do I make a reaction run on a DMFB? DMFB Mapping How do I make a reaction run on a DMFB?

CAD Synthesis Flow Synthesis: The process of mapping an application to hardware Similar to how applications are mapped to ICs Electrode Sequence

Synthesis Example 1.) Schedule 2.) Place 3.) Route

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Compaction Example Electrode Activations Corresponding Droplet Motion

Discrete Perspective Increase Voltage  Increase Velocity Compaction treated as discrete problem Single voltage used for all droplet movements All droplets move at same speed (requires halts) Pollack, M. G., Shenderov, A. D., and Fair, R. B. 2002. Electrowetting-based actuation of droplets for integrated microfluidics. Lab-on-a-Chip 2, 2 (Mar. 2002), 96-101. D2 WAITS

Continuous-Time Perspective Voltages can be changed Abandons synchronous droplet movement Reduce energy usage; maintain timing Compaction treated as continuous problem Multiple voltages used for droplet movements Droplets move at different speeds (avoid halts)

Formal Problem Formation Details In Paper

General Problem Formation Droplet paths broken into segments Max-length contiguous subsequence in one direction Droplet motion: Constant velocity/voltage along entire segment Only stops at beginning/end of segments Interference constraints at continuous-time positions Static Constraints Dynamic Constraints Interference Regions (IR) Prevent Droplet Collisions

Algorithmic Description Step 1: Route computation Roy’s maze-based droplet router (greedy) Computes routes that could overlap Never re-visit/re-compute routes

Algorithmic Description Step 2: Time-constrained, energy-aware compaction Given timing constraint 𝑇 𝑐 For each droplet path: Compute initial path velocity 𝑣𝑒𝑙= 𝑝𝑎𝑡ℎ𝐿𝑒𝑛𝑔𝑡ℎ 𝑇𝑐 Minimum Voltage for velocity derived from graph Least-squares-fit equation Noh, J. H., Noh, J., Kreit, E., Heikenfeld, J., and Rack, P. D. 2012. Toward active-matrix lab-on-a-chip: programmable electrofluidic control enabled by arrayed oxide thin film transistors. Lab-on-a-Chip 12, 2 (Jan. 2012), 353-360.

Algorithmic Description Step 2: Compaction (continued) Compute all segment timings from initial velocities For each droplet path 𝑃 𝑑 For each electrode position 𝑒 𝑑𝑖 in 𝑃 𝑑 Compare against each previously compacted path If no interference along segment: Accept segment If interference along segment: Speedup current droplet along its segment Adjust remaining segments to conserve energy Re-compute path timings for that droplet (0,8] (7,14] (8,13] (0,7] Example Coming!

Simple Example d1 (0,8] D2 s2 (7,14] (8,13] (0,7] D1 s1 d2 Compact D1.

Simple Example d1 (0,8] D2 s2 (7,14] (8,13] (0,7] D1 12 11 10 9 8 1 2 3 4 5 6 7 d1 (0,8] D2 s2 (7,14] (8,13] (0,7] Numbers on electrodes indicate the time the droplet arrives at the electrode. D1 Segment 1: 1 electrode/s Segment 2: 1 electrode/s s1 d2 No previous paths; D1 routes with no problems.

Simple Example d1 D2 s2 Segment 1: 1 electrode/s D1 s1 13 12 11 10 9 8 1 2 3 4 5 6 7 d1 D2 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. D1 Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 1 electrodes/s s1 d2 Now compact D2 against all previous droplet paths (D1).

Simple Example d1 s2 D2 Segment 1: 1 electrode/s s1 D1 13 1 12 11 10 9 8 2 3 4 5 6 7 d1 s2 D2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 1 electrodes/s s1 D1 d2 Now compact D2 against all previous droplet paths (D1).

Simple Example d1 s2 D2 Segment 1: 1 electrode/s s1 D1 13 1 12 2 11 10 9 8 3 4 5 6 7 d1 s2 D2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 1 electrodes/s s1 D1 d2 Now compact D2 against all previous droplet paths (D1).

Simple Example d1 s2 D2 Segment 1: 1 electrode/s s1 D1 13 1 12 2 11 3 10 9 8 4 5 6 7 d1 s2 D2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 1 electrodes/s s1 D1 d2 Now compact D2 against all previous droplet paths (D1).

Simple Example d1 s2 D2 Segment 1: 1 electrode/s s1 D1 13 1 12 2 11 3 10 4 9 8 5 6 7 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. D2 Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 1 electrodes/s s1 D1 d2 Now compact D2 against all previous droplet paths (D1).

Simple Example d1 s2 D2 Segment 1: 1 electrode/s s1 D1 13 1 12 2 11 3 10 4 9 5 8 5/6 6 7 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. D2 Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 1 electrodes/s s1 D1 d2 While compacting D2, detected interference at time 5 between D1 and D2.

Simple Example d1 D2 s2 Segment 1: 1 electrode/s D1 s1 13 12 11 10 9 8 1 2 3 4 5 6 7 d1 D2 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. D1 Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s s1 d2 Increases D2’s velocity/voltage (2.5x) and restart compaction for D2.

Simple Example d1 s2 D2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .8 11 1.2 10 9 8 1 2 3 4 5 6 7 d1 s2 D2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s s1 D1 d2 Re-compact D2 at 2.5x speed against all previous droplet paths (D1).

Simple Example d1 s2 D2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .8 11 1.2 10 1.6 9 5 8 1 2 3 4 6 7 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. D2 Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s s1 D1 d2 Re-compact D2 at 2.5x speed against all previous droplet paths (D1).

Simple Example d1 s2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s s1 D1 D2 d2 D2 reached end of segment.

Simple Example d1 s2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 5.3 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 5.3 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 7.4 5.3 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 Segment 1: 1 electrode/s s1 D1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 7.4 5.3 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 D1 Segment 1: 1 electrode/s s1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 9.5 7.4 5.3 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. D1 Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 D1 Segment 1: 1 electrode/s s1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 9.5 7.4 5.3 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. D1 Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 D1 Segment 1: 1 electrode/s s1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 11.6 9.5 7.4 5.3 3.2 d1 s2 D1 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 D1 Segment 1: 1 electrode/s s1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 11.6 9.5 7.4 5.3 3.2 d1 s2 D1 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 D1 Segment 1: 1 electrode/s s1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 11.6 9.5 7.4 5.3 3.2 d1 s2 D1 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D2 d2 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example d1 s2 D1 Segment 1: 1 electrode/s s1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 11.6 9.5 7.4 5.3 3.2 d1 D1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D2 d1 D2 does not need to get there before D1; save energy and slow D2 down to 0.46 electrodes/sec.

Simple Example D1 d1 s2 Segment 1: 1 electrode/s s1 13 .4 12 .6 11 1.2 10 1.6 9 2 8 1 3 4 5 / 2.4 6 7 2.8 11.6 9.5 7.4 5.3 3.2 d1 s2 Numbers on electrodes indicate the time the droplet arrives at the electrode. Segment 1: 1 electrode/s Segment 2: 1 electrode/s Segment 3: 2.5 electrodes/s Segment 4: 0.46 electrodes/s s1 D2 d1 D2 compacted against D2 with no interference.

Simulation Details DMFB modeled after University of Tennessee’s active matrix design1 Electrode resistance = 1GΩ Electrode pitch (dimension) = 2.54mm Voltagemin = 13V, Voltagemax = 70V Voltage/velocity relationship: 1 Noh, J. H., Noh, J., Kreit, E., Heikenfeld, J., and Rack, P. D. 2012. Toward active-matrix lab-on-a-chip: programmable electrofluidic control enabled by arrayed oxide thin film transistors. Lab-on-a-Chip 12, 2 (Jan. 2012), 353-360.

Simulation Details Benchmarks Base Routing Flow2 Setup PCR, In-Vitro Diagnostics, Protein, ProteinSplit assays (common benchmarks) Base Routing Flow2 Step 1: Roy maze router (same as proposed) Step 2: Constant voltage Add stalls at beginning of routes to avoid interference Setup Schedules and placements same for both route compactors 2 Grissom, D., and Brisk, P. Fast online synthesis of generally programmable digital microfluidic biochips. In Proceedings of the ACM/IEEE International Conference on Hardware Software Codesign and System Synthesis (Tampere, Finland, October 07 - 12, 2012). CODES-ISSS '12, 413-422.

Results: Energy Savings Routing Sub-problem # Base flow performed at 30V, 50V and 70V Time constraints for continuous-time compaction derived from these runs Energy savings vary greatly between sub-problems Due to amount and complexity of droplets being routed

Results: Energy Savings Higher voltages  Better energy usage across platforms More V for less time can lead to energy savings 30V sees greatest savings because slower paths provide more opportunities for route speedups

Results: Energy Savings Energy Decreasing Energy Increasing Threshold exists where Increasing Voltage  Decreases Energy becomes not true Threshold depends on device characteristics Large savings can be incurred by decreasing voltage on halts Wait for 0.5s: @ 30V  450 V2s/GΩ @ 70V  2450 V2s/GΩ

Conclusion First model for continuous-time domain droplet routing (compaction) Varying voltage  varying velocity Multiple speeds allow for energy savings Higher voltages can have better energy usage Continuous-time domain droplet compaction can achieve energy savings across range of voltage Tradeoffs may vary based on characteristics of DMFB Base flow performed at 30V, 50V and 70V Time constraints derived from these runs More savings seen when compared to lower-voltage base cases

Thank You http://microfluidics.cs.ucr.edu/