ARCHTEST. Version 3. 950114.
by W. W. Collier, mpdiag@acm.org.
09:00:05.359 950223
HP Vectra XU 5/90
Default answers to the following questions are shown in brackets.
Specify how to generate the data to be analyzed.
1. Execute real multiprocessing code to generate data.
2. Execute the real mp code, but with only one processor.
3. Generate data randomly with errors.
4. Generate data randomly, but without errors.
5. Use static data with errors.
6. Use static data without errors.
(Choices 2-6 are for debugging.) Choice [1]: 1
Enter the number of processors (from 2 to 8) [2]: 2
Define logical length of arrays (max=500000) [20000]: 20000
The following tests can be run:
2 3 4 5 6 7 8 9 10 11 12 13 14
310 610
220 320 420 520 620 720
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Note added July 1996.
The numbering scheme for some tests was changed in late 1995.
The numbers for the following tests have not changed.
200 300 400 500 600 700 800 900
Two tests, 310 and 610, have been deleted. They created
extraneous cache traffic in a fixed format in order to see if that
introduced relaxed behavior. Currently, any test can have extraneous
cache traffic introduced in a random fashion by setting run time
parameters.
The names of these tests have been changed
220 320 420 520 620 720
to
210 310 410 510 610 710
The change in numbers should cause little confusion in
interpreting the results. The relaxation that a test seeks to detect
is determined only by the initial digit in its number. See the file
ANALYSIS to understand the relaxations that each of the tests seeks
to detect.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Specify which tests to run [all]: all
Synchronize the start of test processes? [n]: n
Parameters for this run:
Type of run: 1. Execute real multiprocessing code to generate data.
Output file name: ahpxu900.out.
Number of processors: 2.
Length of the arrays: 20000.
Synchronize processes: n.
Test(s) to run: 200 220 300 310 320 400 420 500 520 600 610 620 700 720 800 900 1000 1100 1200 1300 1400 1500
================================================================================
Test T200. Seek a violation of A(CMP,RO,WO).
Seek 2.1. U[i] > U[i+2]
Seek 2.2. U[2i+1] > U[2i+2]
Seek 2.3. U[21] > U[2i+1] + 1
Start execution of Test 200 at: 09:00:29.609 950223
End execution of Test 200 at: 09:00:29.640 950223
i U V X Y
0 5674 0 0 0
1999 7677 0 0 0
3998 9678 0 0 0
5997 11679 0 0 0
7996 13679 0 0 0
9995 15680 0 0 0
11994 17681 0 0 0
13993 19682 0 0 0
15992 19999 0 0 0
17991 19999 0 0 0
19990 19999 0 0 0
Start analysis of Test 2 at: 09:00:29.906 950223
End analysis of Test 2 at: 09:00:29.921 950223
Analysis of T2 data:
i U V X Y
================================================================================
Test T220. Seek a violation of A(CMP,RO,WO).
Seek 2.1. U[i] > U[i+2]
Seek 2.2. U[2i+1] > U[2i+2]
Seek 2.3. U[21] > U[2i+1] + 1
Start execution of Test 220 at: 09:00:30.156 950223
End execution of Test 220 at: 09:00:30.187 950223
i U V X Y
0 4497 0 0 0
1999 6503 0 0 0
3998 8506 0 0 0
5997 10509 0 0 0
7996 12511 0 0 0
9995 14514 0 0 0
11994 16517 0 0 0
13993 18520 0 0 0
15992 19999 0 0 0
17991 19999 0 0 0
19990 19999 0 0 0
Start analysis of Test 2 at: 09:00:30.468 950223
End analysis of Test 2 at: 09:00:30.484 950223
Analysis of T2 data:
i U V X Y
================================================================================
The number of processors (2) is too few to run Test T300.
================================================================================
The number of processors (2) is too few to run Test T310.
================================================================================
The number of processors (2) is too few to run Test T320.
================================================================================
Test T400. Seek a violation of A(CMP,PO).
Seek 4.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 4.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 4.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 4.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 400 at: 09:00:30.921 950223
End execution of Test 400 at: 09:00:30.968 950223
i U V X Y
0 0 4835 0 0
1999 0 6836 0 0
3998 0 8835 0 0
5997 1160 10834 0 0
7996 3158 12833 0 0
9995 5157 14832 0 0
11994 7156 16831 0 0
13993 9155 18830 0 0
15992 11154 19999 0 0
17991 13153 19999 0 0
19990 15112 19999 0 0
Start analysis of Test 4/7 at: 09:00:31.468 950223
End analysis of Test 4/7 at: 09:00:31.500 950223
Analysis of T4 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
================================================================================
Test T420. Seek a violation of A(CMP,PO).
Seek 4.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 4.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 4.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 4.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 420 at: 09:00:31.828 950223
End execution of Test 420 at: 09:00:31.859 950223
i U V X Y
0 0 4663 0 0
1999 0 6694 0 0
3998 0 8699 0 0
5997 1302 10704 0 0
7996 3295 12709 0 0
9995 5288 14714 0 0
11994 7283 16719 0 0
13993 9277 18721 0 0
15992 11270 19999 0 0
17991 13262 19999 0 0
19990 15258 19999 0 0
Start analysis of Test 4/7 at: 09:00:32.140 950223
End analysis of Test 4/7 at: 09:00:32.171 950223
Analysis of T4 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
================================================================================
The number of processors (2) is too few to run Test T500.
================================================================================
The number of processors (2) is too few to run Test T520.
================================================================================
The number of processors (2) is too few to run Test T600.
================================================================================
The number of processors (2) is too few to run Test T610.
================================================================================
The number of processors (2) is too few to run Test T620.
================================================================================
Test T700. Seek a violation of A(CMP,UPO,RO,WO,WA).
Seek 7.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 7.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 7.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 7.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 700 at: 09:00:32.796 950223
End execution of Test 700 at: 09:00:32.843 950223
i U V X Y
0 0 4289 19999 19999
1999 0 6289 0 0
3998 0 8288 0 0
5997 1706 10288 0 0
7996 3706 12286 0 0
9995 5704 14285 0 0
11994 7704 16284 0 0
13993 9702 18282 0 0
15992 11701 19999 0 0
17991 13701 19999 0 0
19990 15700 19999 0 0
Start analysis of Test 4/7 at: 09:00:33.140 950223
End analysis of Test 4/7 at: 09:00:33.171 950223
Analysis of T7 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
================================================================================
Test T720. Seek a violation of A(CMP,UPO,RO,WO,WA).
Seek 7.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 7.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 7.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 7.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 720 at: 09:00:33.562 950223
End execution of Test 720 at: 09:00:33.593 950223
i U V X Y
0 0 5207 19999 0
1999 0 7233 0 0
3998 0 9142 0 0
5997 765 11141 0 0
7996 2853 13140 0 0
9995 4851 15139 0 0
11994 6850 17138 0 0
13993 8849 19137 0 0
15992 10848 19999 0 0
17991 12847 19999 0 0
19990 14846 19999 0 0
Start analysis of Test 4/7 at: 09:00:33.890 950223
End analysis of Test 4/7 at: 09:00:33.921 950223
Analysis of T7 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
================================================================================
Test T8. Seek a violation of A(CMP,UPO,CON).
Start execution of Test 800 at: 09:00:34.187 950223
End execution of Test 800 at: 09:00:34.234 950223
i w[i][0] w[i][1] w[i][2] w[i][3]
0 0 48270 2 3
1999 19990 19991 19992 19993
3998 39980 39981 39982 39983
5997 59970 59971 59972 59973
7996 79960 79961 79962 79963
9995 99950 99951 99952 99953
11994 119940 119941 119942 119943
13993 139930 139931 139932 139933
15992 159920 159921 159922 159923
17991 179910 179911 179912 179913
19990 199900 199901 199902 199903
Start analysis of Test 8 at: 09:00:34.531 950223
End analysis of Test 8 at: 09:00:34.890 950223
Analysis of T8 data:
i w[][0] w[][1] w[][2] w[][3]
Save output from Test 8? [n]
================================================================================
The number of processors (2) is too few to run Test T900.
================================================================================
Test T1000. Seek a critsec failure.
Seek 10. Operand A != 0.
Start execution of Test 1000 at: 09:00:37.093 950223
End execution of Test 1000 at: 09:00:37.125 950223
================================================================================
Failing tests: None.
Run this job another time? [y] n