Proceedings of the 20th Symposium on Great Lakes Symposium on VLSI 2010
DOI: 10.1145/1785481.1785583
|View full text |Cite
|
Sign up to set email alerts
|

A novel droplet routing algorithm for digital microfluidic biochips

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 38 publications
(44 citation statements)
references
References 10 publications
0
44
0
Order By: Relevance
“…The placement defined by the virtual topology provides dedicated routing cells which ease the router's job. We simplify an existing router [22] to compute droplet paths very quickly. (Fig.…”
Section: Contributionmentioning
confidence: 99%
See 1 more Smart Citation
“…The placement defined by the virtual topology provides dedicated routing cells which ease the router's job. We simplify an existing router [22] to compute droplet paths very quickly. (Fig.…”
Section: Contributionmentioning
confidence: 99%
“…Bio Route [34] and Huang's algorithm [12] both report runtimes below one second on a desktop PC. The router used in our online flow, a modified version of Roy's maze router [22], achieves comparable runtimes, while achieving deadlock freedom.…”
Section: Routingmentioning
confidence: 99%
“…Within a 10-week period, the students were able to implement two genetic scheduling algorithms [12][14], a simulated annealing-based placer [15], and one router of nontrivial complexity [13]. Several of the students have continued to work with the simulator, either as volunteer researchers or for independent-studies course projects, and other students (mostly undergraduates and M.S.…”
Section: Implementation Status and Usability Studymentioning
confidence: 99%
“…As the schedules and placements may differ as well, we did not obtain the same routing instances as prior work [13], so the routing times are likewise different. Unsurprisingly, the schedulers based on genetic algorithms [12][14] achieve better quality results than standard list scheduling [14]; however, the runtime of the genetic algorithms is significantly higher, as they are iterative improvement algorithms, whereas, list scheduling is a greedy heuristic.…”
Section: Implementation Status and Usability Studymentioning
confidence: 99%
See 1 more Smart Citation