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 biochemical assays, increase in the longest length of flow channel will delay the assay completion time and lead to variation of fluid, thereby affecting the correctness of outcome. The increasing number of components, including the pre-placed components, on the chip makes the flow channel routing problem even more complicated. In this paper, we propose an efficient obstacleavoiding rectilinear Steiner minimum tree algorithm to deal with flow channel routing problem in flow-based microfluidic biochips. Based on the concept of Kruskal algorithm and formulating the considerations as a bi-criteria function, our algorithm is capable of simultaneously minimizing the total length and the longest length of flow channel.

Relative-Scheduling-Based High-Level Synthesis for Flow-Based Microfluidic Biochips

“…Later HLS research mostly adopted this problem formulation and added several practical constraints to the synthesis process. Tseng et al [12] and Liu et al [13] investigated the storage of intermediate assay products. Li et al [14] modelled immediate execution, which requires two dependent operations to be scheduled one-after-the-other without delay.…”