首页> 外文会议>ACM international symposium on physical design >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的第一个液滴路由算法,可以使用液滴路由阶段集成PIN计数技术的PDMFB。此外,我们的算法能够同时最小化控制引脚的数量,使用的电池数量和最新到达时间。我们首先介绍一个基本的整数线性编程(ILP)配方,以最佳地解决PDMFB的液滴路由问题,具有同时多目标优化。由于这种ILP制定的复杂性,我们还提出了一种全局路由的两级技术,然后是基于ILP的基于ILP的路由来减少解决方案空间。为了进一步减少运行时,我们提出了一个确定性ILP制定,它将原始路由优化问题投入到决策问题中,并通过在对数时间中搜索的二进制解决方案搜索方法来解决。广泛的实验表明,就控制引脚的数量而言,使用的电池的数量和最新到达时间,我们在任何方面都获得了比所有最先进的算法更好的成就。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号