• Home
  • Search
  • URBER: Ultrafast Rule-Based Escape Routing Method for Large-Scale Sample Delivery Biochips
  • Cite Icon8
  • https://doi.org/10.1109/tcad.2018.2883908Copy DOI Icon

URBER: Ultrafast Rule-Based Escape Routing Method for Large-Scale Sample Delivery Biochips

  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In high-throughput drug screening applications, as manual drug sample delivery is time-consuming and error-prone, there is an urgent need for accurate and efficient drug sample delivery biochip for large-scale microwell arrays. This paper proposes a new microfluidic biochip architecture, where drugs are automatically prepared with different concentration values, and then delivered into multiple microwells. For large-scale drug sample delivery biochips, the routing of drug sample delivery channels is a very challenging task without effective routing solutions. This paper proposes an ultrafast rule-based escape routing method, called URBER, to address the large-scale routing of drug sample delivery channels, which scales well in both runtime and memory even for a very large problem size. URBER runs very fast because it routes channels based on a set of predefined rules, which avoids runtime consumed in solution space exploration. All benchmarks for 30 ${\le }~{N}$ , ${M} {\le }~100$ have been tested, where ${N}$ and ${M}$ are the number of columns and rows of the terminal array. Among these benchmarks, about ~91.9% are routed with optimal solutions, and the runtime is order of magnitudes faster than optimal min-cost flow-based methods (speedup is from ~600 to ~340 k). Specifically, for all benchmarks with ( ${M}/{N}$ ) ${\in }$ ((3/4), (4/3)), optimal routing solutions are always obtained. URBER also shows promise of routing large-scale designs with up to 500 k terminals efficiently.

Similar Papers
  • Research Article
  • Citations366

Minimum-Energy Multicast in Mobile Ad Hoc Networks Using Network Coding

  • Oct 01, 2004
  • IEEE Transactions on Communications
  • Y Wu +2
  • Conference Article

Novelty of TAH framework in computing reduced wire length two- and three-layer routing solutions

  • Oct 01, 2007
  • Surajit Das +2
  • Conference Article
  • Citations1

A new technique for modifying the Hungarian method

  • Jan 01, 2023
  • AIP conference proceedings
  • Zahraa K Hashim +1
  • Conference Article
  • Citations4

An Efficient Scan Chain Partitioning Scheme with Reduction of Test Data under Routing Constraint

  • Oct 01, 2006
  • Geewhun Seok +3
  • Conference Article
  • Citations2

Computing area and wire length efficient routes for channels

  • Jan 04, 1995
  • R.K Pal +3
  • Book Chapter

Geometric Programming with Equality Constraints

  • Jan 01, 1989
  • Lahbib Chibani
  • Research Article
  • Citations17

A mathematical programming-based scheduling framework for multitasking environments

  • Jan 01, 2007
  • European Journal of Operational Research
  • Shakib Shakeri +1
  • Research Article
  • Citations112

A neural network job-shop scheduler

  • Jan 20, 2008
  • Journal of Intelligent Manufacturing
  • Gary R Weckman +2
  • Research Article
  • Citations67

A non dominated ranking Multi Objective Genetic Algorithm and electre method for unequal area facility layout problems

  • Mar 26, 2013
  • Expert Systems with Applications
  • Giuseppe Aiello +2
  • Conference Article
  • Citations4

Multi-objective Security Driven Job Scheduling for Computational Cloud Systems

  • Oct 01, 2013
  • Jakub Gasior +1
  • Research Article
  • Citations14

Adaptive Time-Varying Routing for Energy Saving and Load Balancing in Wireless Body Area Networks

  • Jan 01, 2024
  • IEEE Transactions on Mobile Computing
  • Zhiqi Lin +3
  • Research Article
  • Citations1

Algorithms for Generating Random Channel Instances for Channel Routing Problem

  • Jan 01, 2010
  • International Journal of Applied Research on Information Technology and Computing
  • Achira Pal +4
  • Book Chapter
  • Citations11

Algorithms for Restoration Planning in a Telecommunications Network

  • Jan 01, 1999
  • S Cwilich +4
  • Research Article
  • Citations8

Visual hierarchical clustering of supply chain using growing hierarchical self-organising map algorithm

  • Oct 16, 2015
  • International Journal of Production Research
  • Manojit Chattopadhyay +2
  • Book Chapter
  • Citations7

Algorithms for Minimizing Bottleneck Crosstalk in Two-Layer Channel Routing

  • Jul 26, 2019
  • Tarak Nath Mandal +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.