55
Recent Research and Emerging Challenges in the System-Level Design of Digital Microfluidic Biochips Paul Pop, Elena Maftei, Jan Madsen Technical University of Denmark

Paul Pop, Elena Maftei , Jan Madsen Technical University of Denmark

  • Upload
    libra

  • View
    64

  • Download
    2

Embed Size (px)

DESCRIPTION

Recent Research and Emerging Challenges in the System-Level Design of Digital Microfluidic Biochips. Paul Pop, Elena Maftei , Jan Madsen Technical University of Denmark. Outline. Digital microfluidic biochips Architecture model: module vs. routing-based Application model - PowerPoint PPT Presentation

Citation preview

Page 1: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

Recent Research and Emerging Challenges in the System-Level Design of Digital Microfluidic Biochips

Paul Pop, Elena Maftei, Jan MadsenTechnical University of Denmark

Page 2: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

2

OutlineDigital microfluidic biochips

Architecture model: module vs. routing-based Application model

System-level design Module-based synthesis Routing-based synthesis

Challenges

Page 3: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

3

Architecture model

Biochip from Duke University

Page 4: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

4

Electrowetting on Dielectric

Page 5: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

6

Reconfigurability

S2

R2

B

S3

S1 W

R1

Dispensing Detection

Splitting/Merging Storage Mixing/Dilution

Non-reconfigurable

Reconfigurable

Page 6: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

7

Operation execution: Module based

S2

R2

B

S3

S1 W

R1

Operation Area (cells) Time (s)

Mix 2 x 4 3

Mix 2 x 2 4

Dilution 2 x 4 4

Dilution 2 x 2 5

Module library

2 x 4 module

Page 7: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

8

Operations: MixingDroplets can move anywhere

Fixed area: module-based operation execution

Unconstrained:routing-basedoperation execution

Page 8: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

9

Operation execution: Routing based

Droplets can move anywhere

Constrained to a module We know the completion time from

the module library.

Unconstrained, any route How can we find out the

operation completion times?

Page 9: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

10

Application model: from this…

Glucose assay steps on the biochipTrinder’s reaction, a colorimetric enzyme-based method

Several such reactions assays in parallel:“in-vitro diagnostics” application

Reconfigurable architecture

Page 10: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

11

Application model: …to this—an acyclic directed graph

“in-vitro diagnostics”application

Page 11: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

12

Another application example:“Colorimetric protein assay”

Page 12: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

13

Operation Area (cells) Time (s) Mixing 2x2 6 Mixing 2x3 5 Mixing 2x4 4

Dilution 2x2 6 Dilution 2x3 5 Dilution 2x4 3 Storage 1x1 –

System-level design tasks

Scheduling

Binding

Placement & routing

Allocation

S1

S2

S3 B

R1

R2

W

Store

Mixer1

Mixer2

Dil

uter

Detector

Mixer1

Mixer2

Diluter

Store

Detector

O7

O9

O3

O11

O10 O4

1 2

3

4

5 6

7

10

8

9

In S1 In R 1

Mix

Detect

In S2 In B

DiluteIn R 2

Mix

Detect

Source

Sink

Page 13: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

15

Module-Based Synthesis

Page 14: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

16

Module-Based SynthesisO7

O8

O9

Page 15: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

17

Module-Based SynthesisO7

O8

O9

Page 16: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

18

Module-Based Synthesis

O7 1x4

O8 1x4

Page 17: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

19

Module-Based Synthesis

O9 2x4

O10 1x4

Page 18: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

20

Module-Based Synthesis

O9 2x4

O10 1x4

Page 19: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

21

Module-Based Synthesis

Page 20: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

22

Problem FormulationGiven

Application: graph Biochip: array of electrodes Library of modules

Determine Allocation of modules from modules library Binding of modules to operations in the graph Scheduling of operations Placement of modules on the array

Such that the application execution time is minimized

Page 21: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

38

SolutionBinding of modules to operations

Schedule of the operations Placement of modules performed

inside scheduling

Placement of the modules Free space manager based on [Bazargan et al.

2000] that divides free space on the chip into overlapping rectangles

Other solutions proposed in the literature: Integer Linear Programming Simulated Annealing

Tabu Search

List Scheduling

Maximal Empty Rectangles

Page 22: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

44

Routing-Based Synthesis

Page 23: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

45

Routing-Based SynthesisO7

O8

O9

Page 24: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

46

Routing-Based Synthesis

Page 25: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

47

Routing-Based Synthesis

Page 26: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

48

Routing-Based Synthesis

Page 27: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

49

Routing-Based Synthesis

Page 28: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

50

Routing-Based Synthesis

Page 29: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

51

Routing-Based Synthesis

Page 30: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

52

Routing-Based Synthesis

Page 31: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

53

Routing-Based Synthesis

Page 32: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

54

Routing-Based Synthesis

Page 33: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

55

Routing-Based Synthesis

Page 34: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

56

When will the operations complete?

For module-based synthesis we know the completion time from the module library.

But now there are no modules, the droplets can move anywhere:

How can we find out the operation completion times?

Page 35: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

57

Characterizing operations

If the droplet does not move: very slow mixing by diffusion

If the droplet moves, how long does it take to complete?

Mixing percentages:

p0, p90, p180 ?

Page 36: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

58

Characterizing operations

We know how long an operation takes on modules

Starting from this, can determine the percentages?

Page 37: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

59

Decomposing modulesSafe, conservative estimatesp90 = 0.1%, p180 = -0.5%, p0 = 0.29% and 0.58%

Moving a droplet one cell takes 0.01 s.

Page 38: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

60

Routing-Based Synthesis

Page 39: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

61

Routing-Based Synthesis

Page 40: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

62

Routing- vs. Module-Based Synthesis

Page 41: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

63

Routing- vs. Module-Based Synthesis

Module-Based SynthesisRouting-Based Synthesis

Page 42: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

64

Problem FormulationGiven

Application: graph Biochip: array of electrodes Library of non-reconfigurable devices

Determine Droplet routes for all reconfigurable operations Allocation and binding of non-reconfigurable modules from a library Scheduling of operations

Such that the application completion time is minimized

Page 43: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

65

Proposed Solution

Page 44: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

66

Proposed Solution

Meet

Execute

Page 45: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

67

Proposed Solution

Meet

Execute

Minimize the time until the droplet(s)arrive at destination

Minimize the completiontime for the operation

Page 46: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

68

GRASP-Based HeuristicGreedy Randomized Adaptive Search Procedure

For each droplet: Determine possible moves Evaluate possible moves Make a list of

best N possible moves Perform a randomly

chosen possible move

Page 47: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

69

GRASP-Based Heuristic Greedy Randomized Adaptive Search Procedure

For each droplet: Determine possible moves Evaluate possible moves Make a list of

best N possible moves Perform a randomly

chosen possible move

Page 48: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

70

GRASP-Based Heuristic Greedy Randomized Adaptive Search Procedure

For each droplet: Determine possible moves Evaluate possible moves Make a list of

best N possible moves Perform a randomly

chosen possible move

Page 49: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

71

GRASP-Based Heuristic Greedy Randomized Adaptive Search Procedure

For each droplet: Determine possible moves Evaluate possible moves Make a list of

best N possible moves Perform a randomly

chosen possible move

Page 50: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

72

GRASP-Based Heuristic Greedy Randomized Adaptive Search Procedure

For each droplet: Determine possible moves Evaluate possible moves Make a list of

best N possible moves Perform a randomly

chosen possible move

Page 51: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

73

Experimental Evaluation

Routing-Based Synthesis (RBS) vs. to Module-Based Synthesis (MBS)

Page 52: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

74

ConclusionsModule-based vs. routing-based

Module-based needs an extra routing step between the modules;Routing-based performs unified synthesis and routing

Module-based wastes space: only one module-cell is used;Routing-based exploits better the application parallelism

Module-based can contain the contamination to a fixed area; We have extended routing-based to address contamination

Page 53: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

76

Challenge:Design of Pin-Constrained Biochips

Direct Addressing Each electrode connected to an independent pin For large arrays (e.g., > 100 x 100 electrodes)

Too many control pins high fabrication cost Wiring plan not available

PCB design: 250 um via hole, 500 um x 500 um electrode

Via HolesWires

Nevertheless, we need high-throughput and low cost: DNA sequencing (106 base pairs), Protein crystallization (103 candidate conditions)

Disposable, marketability, $1 per chip

Page 54: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

77

Challenge: Fault-tolerant design

Electrode degradation

Electrode short

Hindered transportationImperfect splitting

Page 55: Paul Pop, Elena  Maftei , Jan Madsen Technical University of  Denmark

90

Challenge:Architecture-specific biochip design

Biochip from Duke University