Hardware Reference
In-Depth Information
1: Localize the fault operation according to feedback at checkpoints;
2: Determine the operations which need to be adjusted and store them into a priority queue
Q
;
3: Delete all initial synthesis results for operations in
Q
;
4:
while
Q
≠ /
do
5: Search available resource for operation
q
0
which has the highest priority in
Q
;
6: Remove
q
0
from
Q
;
7:
end while
Fig. 2.14
Pseudocode for dynamic re-synthesis of the bioassay
a
0
6
12
15
18
t
Mix 1
Mix 2
Mix 3
Mix 4
Mix 5
b
0
6
20
22
25
28
t
Mix 1
Mix 2
Mix 3
Mix 6 (Re-Mix 3)
Mix 4
Mix 5
Mix 1 has to be halted when
Mix
6
is executed.
c
0
6
10
11 12 15
18
t
Mix 1
Mix 2
Mix 3
Mix 6 (Re-Mix 3)
Mix 4
Mix 5
Fig. 2.15
(
a
) Scheduling result when no error occurs; (
b
) scheduling when an error occurs
in Mix 3. Mix 1 is halted when error operations are executed; (
c
)schedulingwhenanerroroccurs
in Mix 3. Here dynamic synthesis strategy is applied at time 10 and error-recovery operations begin
at time 11
An example of re-synthesis is shown in Fig.
2.15
. Figure
2.15
ashowsthe
schedule corresponding to the sequencing graph in Fig.
2.1
a. Figure
2.15
b, c both
show the schedules corresponding to the sequencing graph in Fig.
2.1
b. For the sake
of clarity, we only show the schedule for mixing operations. Here Fig.
2.15
bisthe
schedule obtained using the error-recovery algorithm of [
11
].
From Fig.
2.15
b, we can see that mixing operation Mix 1 is halted for 10
time slots when error-recovery operations are executed. The completion time of
the bioassay shown in Fig.
2.15
a increases from 18 time slots to 28 time slots,
which can be unacceptable for many applications. The dynamic scheduling result
