数字微流控生物芯片中去除交叉污染的液滴路径和洗涤液滴调度算法

Indrajit Pan, Soumyajit Chatterjee, T. Samanta
{"title":"数字微流控生物芯片中去除交叉污染的液滴路径和洗涤液滴调度算法","authors":"Indrajit Pan, Soumyajit Chatterjee, T. Samanta","doi":"10.1109/ISDA.2012.6416529","DOIUrl":null,"url":null,"abstract":"Cross-contamination is incurred during droplet routing in digital microfluidic biochip (DMFB) because of intersection and overlap in the routing paths. Those intersected or overlapped regions are termed as contamination sites. In this paper, we propose a scheme for concurrent routing of multiple droplets with avoidance or minimization in cross-contamination, followed by a wash droplet scheduling operation for residue removal in the contamination sites. The proposed method is based on a hierarchical partitioning method that generates an unbalanced tree structure containing routing nets in the different nodes on the tree. The proposed partitioning technique is guided by the bounding boxes of the routing nets that help in avoiding intersection in routing paths in different partitioned zone/area. During droplet routing, our aim is to optimize resource utilizations, and minimize cross-contamination in a partition. Any cross-contamination site is washed with proper scheduling of wash droplets in the intermediate routing stages, and a shortest path based wash droplet operation is adopted to minimize routing overhead, or total routing completion time. Different observations are made by applying our algorithm on real benchmarks, and experimental results show improvement in many cases.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Droplet routing and wash droplet scheduling algorithm to remove cross-contamination in digital microfluidic biochip\",\"authors\":\"Indrajit Pan, Soumyajit Chatterjee, T. Samanta\",\"doi\":\"10.1109/ISDA.2012.6416529\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cross-contamination is incurred during droplet routing in digital microfluidic biochip (DMFB) because of intersection and overlap in the routing paths. Those intersected or overlapped regions are termed as contamination sites. In this paper, we propose a scheme for concurrent routing of multiple droplets with avoidance or minimization in cross-contamination, followed by a wash droplet scheduling operation for residue removal in the contamination sites. The proposed method is based on a hierarchical partitioning method that generates an unbalanced tree structure containing routing nets in the different nodes on the tree. The proposed partitioning technique is guided by the bounding boxes of the routing nets that help in avoiding intersection in routing paths in different partitioned zone/area. During droplet routing, our aim is to optimize resource utilizations, and minimize cross-contamination in a partition. Any cross-contamination site is washed with proper scheduling of wash droplets in the intermediate routing stages, and a shortest path based wash droplet operation is adopted to minimize routing overhead, or total routing completion time. Different observations are made by applying our algorithm on real benchmarks, and experimental results show improvement in many cases.\",\"PeriodicalId\":370150,\"journal\":{\"name\":\"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISDA.2012.6416529\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2012.6416529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在数字微流控生物芯片(DMFB)中,由于液滴路径的交叉和重叠,在液滴路径中会产生交叉污染。交叉或重叠的区域称为污染点。在本文中,我们提出了一种避免或最小化交叉污染的多液滴并发路径的方案,然后进行洗涤液滴调度操作以去除污染部位的残留物。该方法基于分层划分方法,生成包含不同节点路由网络的不平衡树结构。所提出的分区技术以路由网络的边界框为指导,避免了不同分区区域内路由路径的交叉。在液滴路由过程中,我们的目标是优化资源利用率,最大限度地减少分区内的交叉污染。在中间布线阶段,对交叉污染部位进行合理的洗涤水滴调度,并采用基于最短路径的洗涤水滴操作,以最小化布线开销或总布线完成时间。在实际的基准测试中,我们的算法得到了不同的观察结果,在许多情况下,实验结果显示出改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Droplet routing and wash droplet scheduling algorithm to remove cross-contamination in digital microfluidic biochip
Cross-contamination is incurred during droplet routing in digital microfluidic biochip (DMFB) because of intersection and overlap in the routing paths. Those intersected or overlapped regions are termed as contamination sites. In this paper, we propose a scheme for concurrent routing of multiple droplets with avoidance or minimization in cross-contamination, followed by a wash droplet scheduling operation for residue removal in the contamination sites. The proposed method is based on a hierarchical partitioning method that generates an unbalanced tree structure containing routing nets in the different nodes on the tree. The proposed partitioning technique is guided by the bounding boxes of the routing nets that help in avoiding intersection in routing paths in different partitioned zone/area. During droplet routing, our aim is to optimize resource utilizations, and minimize cross-contamination in a partition. Any cross-contamination site is washed with proper scheduling of wash droplets in the intermediate routing stages, and a shortest path based wash droplet operation is adopted to minimize routing overhead, or total routing completion time. Different observations are made by applying our algorithm on real benchmarks, and experimental results show improvement in many cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Prediction of risk score for heart disease using associative classification and hybrid feature subset selection WSDL-TC: Collaborative customization of web services Knowledge representation and reasoning based on generalised fuzzy Petri nets Interval-valued fuzzy graph representation of concept lattice Community optimization: Function optimization by a simulated web community
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1