Optimal Scheduling of Task on a Digital Microfluidic Biochips

Debasis Mandal; Rahul Karmakar; Akhil Kr. Das

In this paper a novel placement and scheduling algorithm for digital micro fluidic bio-chips has been presented. Micro fluidic-based biochips are soon expected to revolutionized clinical diagnosis, deoxyribonucleic acid (DNA) sequencing, and other laboratory procedures involving molecular biology. In contrast to continuous-flow system that relies on permanently etched micro channels, micro pumps, and micro valves. Digital micro fluidic offers a scalable system architecture and dynamic re configurability. Groups of unit cells in a micro fluidic array can be reconfigured to change their functionality during the concurrent execution of a set of bioassays. As more bioassays are executed concurrently on a biochips, systems integration and design complexity are expected to increase dramatically. We proposed a heuristics tree based algorithm to solve the problem of Placement {&} Scheduling for Microfluidic Biochips which is known to be NP complete. Experimental results show that the proposed algorithm is capable of efficient solution of the given problem posed as a task graph, and the dimension of the biochips and the time required for each biochips operation.

Select Volume / Issues:

• Volume 4 Issue 3, May. 2013

Year:

2013

Type of Publication:

Article

Keywords:

Microfluidic; Biochips; Placement; T Tree; Task Graph

Journal:

IJECCE

Volume:

4

Number:

3

Pages:

705-709

Month:

May