首页> 外文期刊>IEICE Transactions on fundamentals of electronics, communications & computer sciences >Clique-Based Architectural Synthesis of Flow-Based Microfluidic Biochips
【24h】

Clique-Based Architectural Synthesis of Flow-Based Microfluidic Biochips

机译:基于群体的基于流程的微流生物芯片的合成

获取原文
获取原文并翻译 | 示例
           

摘要

Microfluidic biochips, also referred to "lab-on-a-chip," have been recently proposed to integrate all the necessary functions for biochemical analyses. This technology starts a new era of biology science, where a combination of electronic and biology is first introduced. There are several types of microfluidic biochips; among them there has been a great interest in flow-based microfluidic biochips, in which the flows of liquid is manipulated using integrated microvalves. By combining several microvalves, more complex resource units such as micropumps, switches and mixers can be built. For efficient execution, the flows of liquid routes in microfluidic biochips need to be scheduled under some resource constraints and routing constraints. The execution time of a biochemical application depends strongly on the binding and scheduling result. The most previously developed binding and scheduling algorithm is based on heuristics, and there has been no method to obtain optimal results. Considering the above, we propose an optimal method by casting the problem to a clique problem. Moreover, this paper also presents some heuristic techniques for computational time reduction. Experiments demonstrate that the proposed method is able to reduce the execution time of biochemical applications by more than 15% compared with the previous approach. Moreover, the proposed heuristic method is able to produce the results at no or little cost of optimality, in significantly shorter time than the optimal method.
机译:最近已经提出了微流体生物芯片,也称为“芯片实验室”,以整合生化分析的所有必要功能。这项技术开启了生物科学的新纪元,该时代首次引入了电子与生物学的结合。微流控生物芯片有几种类型。其中,基于流动的微流生物芯片引起了极大的兴趣,其中使用集成的微阀控制液体的流动。通过组合几个微型阀,可以构建更复杂的资源单元,例如微型泵,开关和混合器。为了有效执行,需要在某些资源约束和路由约束下安排微流生物芯片中的液体路由流动。生化应用程序的执行时间在很大程度上取决于绑定和调度结果。最先开发的绑定和调度算法是基于启发式算法的,目前还没有方法获得最佳结果。考虑到上述情况,我们通过将问题转化为集团问题提出了一种最优方法。此外,本文还提出了一些启发式技术来减少计算时间。实验表明,与以前的方法相比,该方法能够将生化应用的执行时间减少15%以上。此外,所提出的启发式方法能够以极少的时间比最优方法花费很少的最优成本来产生结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号