UltraSparc (can find out more details if needed)
Solaris 2.5.1, JDK 1.2beta2.

!!!!!!!!!!!!!!!!! Benchmark results !!!!!!!!!!!!!!!!!!!!!!!!!

**************CHOLESKI DECOMPOSITION******************

Choleski_1024_s.java
compile Choleski_1024_s.java ...
/project/pss_zgs/runtime/Adlib/src/adJava/adjavac -O
Choleski_1024_s.java
run Choleski_1024_s.java ...
osprey1.npac.syr.edu: Rt = 55.880, Ut = 53.930, St = 0.010 

Choleski_1024_s.C
compile Choleski_1024_s.C ...
/project/pss_zgs/runtime/Adlib/src/script/ad++ -O Choleski_1024_s.C
run a.out
/project/pss_zgs/runtime/Adlib/src/script/prun 1 a.out
osprey1.npac.syr.edu: Rt = 14.330, Ut = 13.460, St = 0.000 

Choleski_1024_s.f
compile Choleski_1024_s.f ...
f77  -O Choleski_1024_s.f AdlibClock.o
run a.out
osprey2.npac.syr.edu: Rt = 12.630, Ut = 12.620, St = 0.000 


***************JACOBI ITERATION***********************

Jacobi_1024_s.java
compile Jacobi_1024_s.java ...
/project/pss_zgs/runtime/Adlib/src/adJava/adjavac -O Jacobi_1024_s.java
run Jacobi_1024_s.java ...
osprey2.npac.syr.edu: Rt = 58.390, Ut = 58.310, St = 0.000 

Jacobi_1024_s.C
compile Jacobi_1024_s.C ...
/project/pss_zgs/runtime/Adlib/src/script/ad++ -O Jacobi_1024_s.C
run a.out
/project/pss_zgs/runtime/Adlib/src/script/prun 1 a.out
osprey2.npac.syr.edu: Rt = 18.570, Ut = 18.530, St = 0.000 

Jacobi_1024_s.f
compile Jacobi_1024_s.f ...
f77  -O Jacobi_1024_s.f AdlibClock.o
run a.out
osprey2.npac.syr.edu: Rt = 12.100, Ut = 12.090, St = 0.000

!!!!!!!!!!!!!!!!! Benchmark sources !!!!!!!!!!!!!!!!!!!!!!!!!

***************** Jacobi_1024_s.java ***********************

/*
 * File         : Jacobi_s.java
 * Author       : Guansong Zhang
 * Created      : Mon Feb  2 10:36:02 1998
 * Revision     : $Revision: 1.1 $
 * Updated      : $Date: 1998/02/20 17:01:49 $
 * Copyright: Northeast Parallel Architectures Center
 *            at Syracuse University 1998
 */

import spmd.*;

class Jacobi_s {

  static final int n=1024;

  public static void main(String argv[]) {
    float a [][] = new float [n][n];

    int i, j;

    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	if (i==0 || i==n-1 || j==0 || j==n-1)
	  a[i][j]=1;
	else
	  a[i][j]=0;
      }
    }

    /*
    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	System.out.print(a[i][j]+" ");
      };
    
      System.out.println();
    }
    */

    float b [][] = new float [n][n];

    for (int iter=0; iter <100; iter++) {

      if (iter==10)
	Clock.start();


      /* this will use memcpy cause system overhead on solaris 2.5.1
      for (i=0; i<n; i++) {
	for (j=0; j<n; j++) {      

	  b[i][j]=a[i][j];
	}
      }
      */

      for (i=1; i<n-1; i++) {
	for (j=1; j<n-1; j++) {

	  b[i][j]=a[i][j];
	}
      }

      for (i=1; i<n-1; i++) {
	for (j=1; j<n-1; j++) {

	  a[i][j]=((b[i-1][j]+b[i+1][j]+b[i][j-1]+b[i][j+1])*(float)0.25);
	}
      }
    }

    Clock.stop();

    /*
    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	System.out.print(a[i][j]+" ");
      };
    
      System.out.println();
    }
    */
  }
}

***************** Jacobi_1024_s.C ***********************
/*
 * File         : Jacobi.C
 * Author       : Guansong Zhang
 * Created      : Tue Feb  3 13:35:51 1998
 * Revision     : $Revision$
 * Updated      : $Date$
 * Copyright: Northeast Parallel Architectures Center
 *            at Syracuse University 1998
 */


#include "math.h"
#include "adlib.h"

const int n = 1024;
float a [n][n], b [n][n];

int main(int argc, char** argv) {

  int i, j ;

  for (i=0; i<n; i++) {
    for (j=0; j<n; j++) {
      if (i==0 || i==n-1 || j==0 || j==n-1)
	a[i][j]=1;
      else
	a[i][j]=0;
    }
  }

  for (int iter=0; iter<100; iter++) {

    if (iter==10)
      AdlibClock(0);

    /* for poor solaris 2.5.1
    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {      
	
	b[i][j]=a[i][j];
      }
    }
    */

    for (i=1; i<n-1; i++) {
      for (j=1; j<n-1; j++) {

	b[i][j]=a[i][j];
      }
    }

    for (i=1; i<n-1; i++) {
      for (j=1; j<n-1; j++) {    

	a[i][j]=((b[i-1][j]+b[i+1][j]+b[i][j-1]+b[i][j+1])*0.25);
      }
    }
  }

  AdlibClock(1);
}

***************** Jacobi_1024_s.f ***********************

      PROGRAM JACOBI
      PARAMETER (N=1024)
      REAL A(N,N), B(N,N)

      DO I=1, N
         DO J=1, N
            IF ((I .EQ. 1) .OR. (I .EQ. N) 
     &           .OR. (J .EQ. 1) .OR. (J .EQ. N)) THEN
               A(I,J)=1
            ELSE
               A(I,J)=0
            ENDIF
         ENDDO
      ENDDO

      DO ITER =1, 100
         IF (ITER .EQ. 11) THEN
            CALL AdlibClockStart()
         ENDIF

! for poor Solaris 2.5.1
!         DO J=1, N
!            DO I=1, N
!               B(I,J)=A(I,J)
!            ENDDO
!         ENDDO

         DO J=2, N-1
            DO I=2, N-1
               B(I,J)=A(I,J)
            ENDDO
         ENDDO

         DO J=2, N-1
            DO I=2, N-1
               A(I,J)=(B(I-1,J)+B(I+1,J)+B(I,J-1)+B(I,J+1))*0.25
            ENDDO
         ENDDO

      ENDDO

      CALL AdlibClockStop()

!      PRINT 111, ((A(I,J),I=1,N), J=1,N)
111   FORMAT(1x,f17.2)
      
      END


***************** Choleski_1024_s.java ***********************

/*
 * File         : Choleski_s.java
 * Author       : Guansong Zhang
 * Created      : Tue Feb  3 22:44:46 1998
 * Revision     : $Revision: 1.1 $
 * Updated      : $Date: 1998/02/20 17:01:45 $
 * Copyright: Northeast Parallel Architectures Center
 *            at Syracuse University 1998
 */

import spmd.*;

class Choleski_s {

  static final int n= 1024;

  public static void main(String argv[]) {
    float a [][] = new float [n][n];

    int i, j, k, s;

    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	if (j>=i)
	  a[i][j]=i+1;
	else
	  a[i][j]=j+1;
      }
    }

    /*
    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	System.out.print(a[i][j]+" ");
      };
    
      System.out.println();
    }
    */

    Clock.start();

    a[0][0]=(float)Math.sqrt(a[0][0]);

    /* This is for column major
    for (k=0; k<n-1; k++) {
      for (s=k+1; s<n; s++) {
	a[s][k]/=a[k][k];
      }

      for (j=k+1; j<n; j++) {
	for (i=j; i<n; i++) {
	  a[i][j]-=a[i][k]*a[j][k];
	}
      }

      a[k+1][k+1]=(float)Math.sqrt(a[k+1][k+1]);

    }
    */

    // reverse i, j for row major.

    for (k=0; k<n-1; k++) {
      for (s=k+1; s<n; s++) {
	a[k][s]/=a[k][k];
      }

      for (j=k+1; j<n; j++) {
	for (i=j; i<n; i++) {
	  a[j][i]-=a[k][i]*a[k][i];
	}
      }

      a[k+1][k+1]=(float)Math.sqrt(a[k+1][k+1]);

    }

    Clock.stop();

    /*
    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	System.out.print(a[i][j]+" ");
      };
    
      System.out.println();
    }
    */
  }
}

***************** Choleski_1024_s.C ***********************

/*
 * File         : Choleski_s.C
 * Author       : Guansong Zhang
 * Created      : Fri Feb 20 16:36:16 1998
 * Revision     : $Revision$
 * Updated      : $Date$
 * Copyright: Northeast Parallel Architectures Center
 *            at Syracuse University 1998
 */


#include "math.h"
#include "adlib.h"

const int n = 1024 ;
float a [n][n], b [n];

int main(int argc, char** argv) {

    int i, j, k, s;

    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	if (j>=i)
	  a[i][j]=i+1;
	else
	  a[i][j]=j+1;
      }
    }

    AdlibClock(0);

    a[0][0]=sqrt(a[0][0]);

    /* This is for column major
    for (k=0; k<n-1; k++) {
      for (s=k+1; s<n; s++) {
	a[s][k]/=a[k][k];
      }

      for (j=k+1; j<n; j++) {
	for (i=j; i<n; i++) {
	  a[i][j]-=a[i][k]*a[j][k];
	}
      }

      a[k+1][k+1]=(float)Math.sqrt(a[k+1][k+1]);

    }
    */

    // reverse i, j for row major.

    for (k=0; k<n-1; k++) {
      for (s=k+1; s<n; s++) {
	a[k][s]/=a[k][k];
      }

      for (j=k+1; j<n; j++) {
	for (i=j; i<n; i++) {
	  a[j][i]-=a[k][i]*a[k][i];
	}
      }

      a[k+1][k+1]=sqrt(a[k+1][k+1]);

    }

    AdlibClock(1);

    /*
    for (i=0; i<n; i++) {
      for (j=0; j<n; j++) {
	printf("%f ",a[i][j]);
      };
    
      printf("\n");
    }

    */
}

***************** Choleski_1024_s.f ***********************

      PROGRAM CHOLESKI
      PARAMETER (N=1024)
      REAL A(N,N), B(N)

      DO I=1,N
         DO J=1,N
            IF (J .GE. I)  THEN 
               A(I,J)=I
            ELSE
               A(I,J)=J
            ENDIF
         ENDDO
      ENDDO

      CALL AdlibClockStart()

      A(1,1)=SQRT(A(1,1))

      DO K=1, N-1
         DO S=K+1, N
            A(S,K)=A(S,K)/A(K,K)
         ENDDO

         DO J=K+1, N
            DO I=J, N
               A(I,J)=A(I,J)-A(I,K)*A(J,K)
            ENDDO
         ENDDO
         
         A(K+1, K+1)=SQRT(A(K+1,K+1))
         
      ENDDO

      CALL AdlibClockStop()

!      PRINT 111, ((A(I,J),I=1,N), J=1,N)
111   FORMAT(1x,f17.2)

      END