Proceedings of the 51st Annual Design Automation Conference 2014
DOI: 10.1145/2593069.2593084
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips

Abstract: Rapid growth in capacity makes flow-based microfluidic biochips a promising candidate for biochemical analysis because they can integrate more complex functions. However, as the number of components grows, the total length of flow channels between components must increase exponentially. Recent empirical studies show that long flow channels are vulnerable due to blocking and leakage defects. Thus, it is desirable to minimize the total length of flow channels for robustness. Also, for timing-sensitive biochemica… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
4
1

Relationship

2
7

Authors

Journals

citations
Cited by 20 publications
(12 citation statements)
references
References 19 publications
0
12
0
Order By: Relevance
“…The result of scheduling with storage minimization is shown in the columns t E and ts, where t E is the execution time of the assay defined in (5). The runtime of solving the optimization problem (6)- (7) is shown in the column ts, which was limited to 30 minutes for the solver to return the best-effort results.…”
Section: Resultsmentioning
confidence: 99%
“…The result of scheduling with storage minimization is shown in the columns t E and ts, where t E is the execution time of the assay defined in (5). The runtime of solving the optimization problem (6)- (7) is shown in the column ts, which was limited to 30 minutes for the solver to return the best-effort results.…”
Section: Resultsmentioning
confidence: 99%
“…Researchers have proposed placers using simulated annealing [11,14,21] and iterated cluster expansion (ICE) [17]. Non-planar routing algorithms may reduce fluid routing channel length, but do not limit the number of channel crossings [8]. These approaches are unlikely to yield workable mVLSI chips that can be fabricated, and should not be used to lay out planar mVLSI netlists.…”
Section: Non-planar Mvlsi Netlist Embeddingmentioning
confidence: 99%
“…This is followed by the physical synthesis of the flow layer, i.e., placement of components and routing of flow channels while following the design rules. Researchers have proposed placement algorithms [29]- [31] for the flow layer, routing approaches for the flow layer [29], [32], as well as integrated approaches for the placement and routing [29].…”
Section: Fault-tolerant Designmentioning
confidence: 99%