2013 IEEE International SOC Conference 2013
DOI: 10.1109/socc.2013.6749681
|View full text |Cite
|
Sign up to set email alerts
|

Latency-optimization synthesis with module selection for digital microfluidic biochips

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 15 publications
0
7
0
Order By: Relevance
“…The majority of work on DMFB compilation targets devices that do not feature sensory feedback or control flow; as such, the scope of compilation was limited to programs that consisted of a single basic block. Discrete formulations of the various compilation stages of scheduling [21,30,50,63,70,80], placement [14,28,48,57,58,79,87,88,90], and droplet routing [9,15,34,41,42,71,72,81,91] were explored, along with wash-droplet [35,89,92] to eliminate contamination on the surface of the chip. The compiler described here is a general framework and could implement any of these algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…The majority of work on DMFB compilation targets devices that do not feature sensory feedback or control flow; as such, the scope of compilation was limited to programs that consisted of a single basic block. Discrete formulations of the various compilation stages of scheduling [21,30,50,63,70,80], placement [14,28,48,57,58,79,87,88,90], and droplet routing [9,15,34,41,42,71,72,81,91] were explored, along with wash-droplet [35,89,92] to eliminate contamination on the surface of the chip. The compiler described here is a general framework and could implement any of these algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…Our papers describing force-directed list scheduling [59] and path scheduling [23] include comparisons with the other algorithms using the framework. Two algorithms that have not (yet) been implemented within the framework include optimal scheduling via integer linear programming (ILP) [15,69] and a heuristic called Latency Optimal Scheduling with MOdule Selection (LOSMOS) [43]. The ILPs that have been published thus far are specific to two different assay topologies, and we have not yet tried to generalize them.…”
Section: Schedulingmentioning
confidence: 99%
“…Under the traditional model of DMFB scheduling [15,22,23,43,59,63,69], the latency of each operation is known statically. Under routing-based synthesis, the latency of operations such as mixing and dilution is not determined until the routes are known, thus scheduling and routing must be performed together [51].…”
Section: Routing-based Synthesismentioning
confidence: 99%
See 1 more Smart Citation
“…Concurrent droplet routing in opposite directions is not possible using a three-phase bus (a) but becomes possible with a direct-addressing bus (b).A. Abdoli, P. Brisk Microelectronics Journal 77 (2018)[34][35][36][37][38][39][40][41][42][43][44][45][46][47][48] …”
mentioning
confidence: 99%