optimization binary

advertisement
Problem 2 : Variable Ordering Optimization for Ordered Binary Decision Diagrams
Team
A8
Circuit
size
Time
Space
1
135
0.05
70616
2
281
0.09
75144
clma
Paser error.
clmb
Paser error
-
-
S15850.1
C
-
-
S38417
C
S38584.1
K
S13207.1
C
S9234.1
C
des
C
C7552
Parse error
C6288
Parse error
Note
(1)
(2)
(3)
(4)
(5)
-
> 5h
-
Circuit 1 and 2 are open test cases. The rest cases are from LGSynth91.
“Size” is the size of reduced OBDD.
“K” is killed for running more than 5 hours or using more than 1G memory space.
“C” is crash.
Can’t pass node_check and abort.
Problem 2 : Variable Ordering Optimization for Ordered Binary Decision Diagrams
Team
A46
Circuit
size
Time
Space
1
44
< 1s
2M
2
862
< 1s
4M
clma
K
> 5h
-
clmb
C
-
-
-(5)
-
-
S38417
K
-
> 1G
S38584.1
K
> 5h
-
S13207.1
-(5)
-
-
S9234.1
K
> 5h
-
4405
5112s
326M
C7552
K
-
>1G
C6288
K
-
> 1G
S15850.1
des
Note
(6)
(7)
(8)
(9)
(10)
Circuit 1 and 2 are open test cases. The rest cases are from LGSynth91.
“Size” is the size of reduced OBDD.
“K” is killed for running more than 5 hours or using more than 1G memory space.
“C” is crash.
Can’t pass node_check and abort.
Problem 2 : Variable Ordering Optimization for Ordered Binary Decision Diagrams
Team
A47
Circuit
size
Time
Space
1
26
26
< 1s
<1s
3M
3M
2
221
220
< 1s
< 1s
3M
3M
clma
768
896
3s
1s
7M
7M
clmb
749
772
2s
1s
7M
7M
S15850.1
11043
- (5)
35s
-
13M
-
S38417
468835
300727
9855
4287
80M
80M
S38584.1
15078
14991
52s
56s
23M
23M
S13207.1
3055
- (5)
16s
-
8M
-
S9234.1
3147
3728
4s
3s
4M
4M
des
2975
2970
2s
2s
5M
5M
C7552
9983
6886
34s
12s
7M
7M
C6288
K
K
>10 h
> 10 h
-
Note
(1)
(2)
(3)
(4)
(5)
(6)
Circuit 1 and 2 are open test cases. The rest cases are from LGSynth91.
“Size” is the size of reduced OBDD.
“K” is killed for running more than 5 hours or using more than 2G memory space.
“C” is crash.
No valid result out.
Each case has 2 results. The first is from version A. The second is from version B. The
memory space is almost the same for these two versions.
Problem 2 : Variable Ordering Optimization for Ordered Binary Decision Diagrams
Team
A51
Circuit
size
Time
Space
1
26
26
< 1s
< 1s
1M
1M
2
226
246
< 1s
5s
1M
1M
clma
1056
-(6)
47s
-
6M
-
clmb
1023
C
39
-
3M
-
S15850.1
-(6)
-(6)
-
-
S38417
-(6)
-(6)
-
-
S38584.1
K
-(6)
-
>5h
-
S13207.1
-(6)
-(6)
-
-
S9234.1
K
-(6)
-
> 5h
-
des
2993
C
49
-
2M
-
C7552
5904
-(6)
738
-
8M
-
C6288
K
K
-
>5h
> 5h
Note
(1)
(2)
(3)
(4)
(5)
Circuit 1 and 2 are open test cases. The rest cases are from LGSynth91.
“Size” is the size of reduced OBDD.
“K” is killed for running more than 5 hours or using more than 1G memory space.
“C” is crash.
We only test two setting for each case. The first is to use DFS initial order and annealing
reordering. The second is to use mince initial and annealing reordering.
(6) No valid result.
Problem 2 : Variable Ordering Optimization for Ordered Binary Decision Diagrams
Team
A54
Circuit
size
Time
Space
1
50
< 1s
-
2
758
< 1s
-
clma
49390
0.66
-
clmb
48422
0.63
-
S15850.1
13659
0.25
-
S38417
32247
0.63
-
S38584.1
32911
0.58
-
S13207.1
11235
0.23
-
S9234.1
7972
01.5
-
C
-
-
C7552
2583
0.08
-
C6288
4769
0.07
-
des
Note
(11)
(1)
(2)
(3)
Circuit 1 and 2 are open test cases. The rest cases are from LGSynth91.
“Size” is the size of reduced OBDD.
“K” is killed for running more than 5 hours or using more than 1G memory space.
“C” is crash.
Problem 2 : Variable Ordering Optimization for Ordered Binary Decision Diagrams
Team
Circuit
A58
size
Time
Space
1
26
0.02
2
222
0.05
clma
1301
1.86
2.2M
clmb
677
1.55-
2.2M
11314
19.6-
4M
K
-
-
S38584.1
14989
42.97
11M
S13207.1
3098
13.09
3.6M
S9234.1
3629
3.06
1.5M
des
2969
1.57
2M
C7552
13656
19.43
C6288
K
-
S15850.1
S38417
Note
(1) Circuit 1 and 2 are open test cases. The rest cases are from LGSynth91.
(2) “Size” is the size of reduced OBDD.
(3) “K” is killed for running more than 5 hours or using more than 1G memory space.
(4) “C” is crash.
Download