Register allocation and spilling via graph coloring
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Architectural-level synthesis of digital microfluidics-based biochips
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Design automation issues for biofluidic microchips
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Droplet routing in the synthesis of digital microfluidic biochips
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Module placement for fault-tolerant microfluidics-based biochips
Proceedings of the 41st annual Design Automation Conference
Placement of digital microfluidic biochips using the t-tree formulation
Proceedings of the 43rd annual Design Automation Conference
Integrated droplet routing in the synthesis of microfluidic biochips
Proceedings of the 44th annual Design Automation Conference
BioRoute: a network-flow based routing algorithm for digital microfluidic biochips
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Modeling and Controlling Parallel Tasks in Droplet-Based Microfluidic Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Performance Characterization of a Reconfigurable Planar-Array Digital Microfluidic System
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Tabu search-based synthesis of dynamically reconfigurable digital microfluidic biochips
CASES '09 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems
ILP-based pin-count aware design methodology for microfluidic biochips
Proceedings of the 46th Annual Design Automation Conference
A progressive-ILP-based routing algorithm for the synthesis of cross-referencing biochips
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Design automation and test solutions for digital microfluidic biochips
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Cross-contamination aware design methodology for pin-constrained digital microfluidic biochips
Proceedings of the 47th Design Automation Conference
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ILP-based pin-count aware design methodology for microfluidic biochips
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Cross-contamination avoidance for droplet routing in digital microfluidic biochips
Proceedings of the Conference on Design, Automation and Test in Europe
Routing-based synthesis of digital microfluidic biochips
CASES '10 Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems
CrossRouter: a droplet router for cross-referencing digital microfluidic biochips
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
A SAT-based routing algorithm for cross-referencing biochips
Proceedings of the System Level Interconnect Prediction Workshop
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
In this paper, we propose a high-performance droplet router for digital microfluidic biochip (DMFB) design. Due to recent advancements in bio-MEMS, the design complexity and the scale of a DMFB are expected to explode in near future, thus requiring strong support from CAD as in conventional VLSI design. Among multiple design stages of a DMFB, droplet routing which schedules the movement of each droplet in a time-multiplexed manner is a critical challenge due to high complexity as well as large impacts on performance. Our algorithm first routes a droplet with higher bypassibility which less likely blocks the movement of the others. When multiple droplets form a deadlock, our algorithm resolves it by backing off some droplets for concession. A final compaction step further enhances timing as well as fault-tolerance by tuning each droplet movement greedily. Experimental results on hard benchmarks show that our algorithm achieves over 35x and 20x better routability with comparable timing and fault-tolerance than the popular prioritized A* search [2] and the state-of-the-art network-flow based algorithm [18], respectively