Information Technology Reference
In-Depth Information
2. compute the number of levels necessary for execution of the Bioassay. This
determines the concurrency of operations assigned to each level. Let there be k such
levels within the sequencing graph.
3. Determine maximum number of reconfigurable operations to occur at any given
level i.
4. Normally it has been found maximum number of Input operations occur at level 1 .
5. identify the non reconfigurable operations denoted in the sequence graph and
assign fixed locations for the said operations within the layout.
6. As found specifically in standard testbenches for routing (benchmark suite I)
dimension of the 2D array is maintained to be n x n for n number of input operations.
7. It has been found in almost all sequencing graph most of the nonreconfigurable
operations occur at level (k-1) while the last level k is assigned to the sink.
8. Tentatively assign fixed locations for these nonreconfigurable operations (with
segregation zones) from options available at the module library with execution time
prespecified by the Bioassay protocol.
9. Bind the prefixed reservoir locations at the boundary to the input
operations.(specifically for level 1)
10. For level i= 2 to k
11. if i = 2
Reconfigurable mixer modules are assigned for level 2 operation
proceeded by level 1 Input operations.
Reconfigurable Mixer locations are assigned at zones that corresponds to
the respective I/O operations at level 1 from which the operation is
directed in G
S
.
12.
For mixer locations at each level we attempt to choose the best options
available in the module library in terms of operation execution time.
A compromise in terms of area is made if the layout dimension constraints
as mentioned in step 6 permits.
However if area constraint may restrict the assignment we opt for the next
optimum choice in terms of execution time.
13.
We assign filler zones of one row or column between neighboring mixer
locations to ensure no violation fluidic constraints mentioned in section 3
while concurrent execution of route based reconfigurable mixing operations
at the identical level.
14.
If i > 2
Assign reconfigurable module locations at each successive level - such that
each Module can be located to share the cells being used in the earlier
level for operations with edges directed to the current one.
15. for any dilution operation that requires mixing followed by splitting - within
the reconfigurable mixing zone a cell is assigned for splitting operation after
scheduled mixing.
16. next i
17. Compute the maximum time for concurrent operation at each level.
18. Here we use parallel resources at each level - and locations are shared only
between different levels for reconfigurable operations.
