ARCHTEST. Version 3. 950114.
by W. W. Collier, mpdiag@acm.org.
08:59:25.734 950223
AST Manhattan V Series 5090
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: aASTM900.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:01.265 950223
End execution of Test 200 at: 09:00:01.281 950223
i U V X Y
0 4243 0 0 0
1999 6006 0 0 0
3998 8008 0 0 0
5997 9739 0 0 0
7996 11739 0 0 0
9995 13205 0 0 0
11994 15206 0 0 0
13993 17207 0 0 0
15992 19208 0 0 0
17991 19999 0 0 0
19990 19999 0 0 0
Start analysis of Test 2 at: 09:00:01.406 950223
End analysis of Test 2 at: 09:00:01.421 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:01.546 950223
End execution of Test 220 at: 09:00:01.562 950223
i U V X Y
0 2872 0 0 0
1999 4878 0 0 0
3998 6881 0 0 0
5997 8884 0 0 0
7996 10886 0 0 0
9995 12889 0 0 0
11994 14892 0 0 0
13993 16539 0 0 0
15992 18542 0 0 0
17991 19999 0 0 0
19990 19999 0 0 0
Start analysis of Test 2 at: 09:00:01.703 950223
End analysis of Test 2 at: 09:00:01.718 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:01.921 950223
End execution of Test 400 at: 09:00:01.953 950223
i U V X Y
0 0 3236 0 0
1999 0 4845 0 0
3998 1152 6852 0 0
5997 3147 8825 0 0
7996 5141 10557 0 0
9995 7433 12560 0 0
11994 9428 14559 0 0
13993 11427 16831 0 0
15992 13174 19098 0 0
17991 15152 19999 0 0
19990 16880 19999 0 0
Start analysis of Test 4/7 at: 09:00:02.093 950223
Error 4.2. v[ 15646] = 18751 < 18752 and u[ 18752] = 15645 < 15646
Error 4.1. u[ 18752] = 15645 < 15646 and v[ 15646] = 18751 < 18752
End analysis of Test 4/7 at: 09:00:02.140 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
15643 13077 18480 0 0 2 2
15644 13078 18481 0 0 2 2
15645 13079 18751 0 0 2 1
15646 13080 18751 0 -1 2 2
15647 13081 18753 0 1 2 2
15648 13082 18753 0 0 2 3
15649 13083 18754 0 0 2 2
18749 15644 19999 2 2097152 269 1861
18750 15644 19999 1 2097152 270 1862
18751 15645 19999 0 2097152 270 1863
18752 15645 19999 -1 2097152 271 1864
18753 15647 19999 0 2097152 2 1865
18754 15648 19999 0 2097152 1 1866
18755 15649 19999 0 2097152 2 1867
================================================================================
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:02.515 950223
End execution of Test 420 at: 09:00:02.546 950223
i U V X Y
0 0 4095 0 0
1999 0 6457 0 0
3998 0 8777 0 0
5997 1628 10782 0 0
7996 3372 12787 0 0
9995 5213 14933 0 0
11994 7206 17008 0 0
13993 9057 18708 0 0
15992 10980 19999 0 0
17991 13278 19999 0 0
19990 15410 19999 0 0
Start analysis of Test 4/7 at: 09:00:02.703 950223
End analysis of Test 4/7 at: 09:00:02.734 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:03.046 950223
End execution of Test 700 at: 09:00:03.093 950223
i U V X Y
0 0 2796 19999 19999
1999 0 4249 0 0
3998 1748 6251 0 0
5997 3744 8795 0 0
7996 5380 11134 0 0
9995 7027 13511 0 0
11994 8855 15543 0 0
13993 10326 17383 0 0
15992 12442 18633 0 0
17991 14601 19999 0 0
19990 17570 19999 0 0
Start analysis of Test 4/7 at: 09:00:03.390 950223
End analysis of Test 4/7 at: 09:00:03.421 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:03.609 950223
End execution of Test 720 at: 09:00:03.640 950223
i U V X Y
0 0 3997 19999 0
1999 0 6024 0 0
3998 0 8781 0 0
5997 1972 11059 0 0
7996 3214 13523 0 0
9995 5166 15895 0 0
11994 6725 17681 0 0
13993 8466 19608 0 0
15992 10092 19999 0 0
17991 12379 19999 0 0
19990 14375 19999 0 0
Start analysis of Test 4/7 at: 09:00:03.796 950223
End analysis of Test 4/7 at: 09:00:03.812 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:03.968 950223
End execution of Test 800 at: 09:00:04.000 950223
i w[i][0] w[i][1] w[i][2] w[i][3]
0 0 49700 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:04.171 950223
End analysis of Test 8 at: 09:00:04.531 950223
Analysis of T8 data:
i w[][0] w[][1] w[][2] w[][3]
Save output from Test 8? [n] y
Save output from Test 8 in file aASTM900.800.
================================================================================
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:03:07.375 950223
End execution of Test 1000 at: 09:03:07.406 950223
================================================================================
Failing tests: 400.
Run this job another time? [y]