Script started on Thu Dec 15 17:59:19 1994
conx [emulator]	pram -t -c -r 8 prefix
1
2
3
4
5
6
7
8
CLOCK: 530
CLOCK: 743
CLOCK: 956
CLOCK: 1169
1
3
6
10
15
20
25
36
conx [emulator]	exit
exit

script done on Thu Dec 15 17:59:46 1994




The above is the result of 8(N) number with 8(N) processors.
The following are the result using different number of N:

N number and N processors
             clock 1   clock 2     clock3    clock4     clock5   clock6	
N=1	--->  530	        
N=2	--->  530	743         
N=4	--->  530	743   	    956       
N=8	--->  530	743  	    956       1169       
N=16	--->  530	743  	    956       1169       1382     
N=32	--->  530	743  	    956       1169       1382     1595

In this case, the differences are the same 213 cycles
(i.e. the algorithm is o(logN) ).  This results have more than one clock 
because of the strucure of our program.


The parallel prefix problem can be solved in logN with N processors.