首页> 外文会议>ACM international symposium on physical design 2010 >A Two-Stage ILP-Based Droplet Routing Algorithm for Pin-Constrained Digital Microfluidic Biochips
【24h】

A Two-Stage ILP-Based Droplet Routing Algorithm for Pin-Constrained Digital Microfluidic Biochips

机译:基于两阶段ILP的管脚约束数字微流控生物芯片液滴路由算法

获取原文

摘要

With the increasing design complexities, the design of pin-constrained digital microfluidic biochips (PDMFBs) is of practical importance for the emerging marketplace. However, the solution of current pin-count aware technique is inevitably limited by simply adopting it after the droplet routing stage. In this paper, we propose the first droplet routing algorithm for PDMFBs that can integrate pin-count technique with droplet routing stage. Furthermore, our algorithm is capable of simultaneously minimizing the number of control pins, the number of used cells, and the latest arrival time. We first present a basic integer linear programming (ILP) formulation to optimally solve the droplet routing problem for PDMFBs with simultaneous multi-objective optimization. Due to the complexity of this ILP formulation, we also propose a two-stage technique of global routing followed by incremental ILP-based routing to reduce the solution space. To further reduce the runtime, we present a deterministic ILP formulation that casts the original routing optimization problem into a decision problem, and solve it by a binary solution search method that searches in logarithmic time. Extensive experiments demonstrate that in terms of the number of the control pins, the number of the used cells, and the latest arrival time, we acquire much better achievement than all the state-of-the-art algorithms in any aspect.
机译:随着设计复杂度的增加,引脚受限的数字微流生物芯片(PDMFB)的设计对于新兴市场具有实际重要性。然而,通过在小滴路由阶段之后简单地采用它,不可避免地限制了当前的引脚数感知技术的解决方案。在本文中,我们提出了第一个PDMFB的液滴路由算法,该算法可以将引脚计数技术与液滴路由阶段集成在一起。此外,我们的算法能够同时最小化控制引脚的数量,已用单元的数量以及最新到达时间。我们首先提出一种基本的整数线性规划(ILP)公式,以同时解决多目标优化问题来最优地解决PDMFB的液滴路由问题。由于此ILP公式的复杂性,我们还提出了一种两阶段的全局路由技术,然后是基于增量ILP的路由,以减少解决方案空间。为了进一步减少运行时间,我们提出了确定性的ILP公式,该公式将原始路由优化问题转换为决策问题,并通过对数时间搜索的二元解搜索方法进行求解。大量的实验表明,就控制引脚的数量,所用单元的数量以及最迟到达时间而言,我们在任何方面都比所有最新算法都取得了更好的成绩。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号