{"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}
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.