long enough that fas is killing it. a LONG time. and right now i'm not actually doing any swapping (i have the disk size large enough that i don't need to). -gwa- On Sat, 31 Mar 2001, David Holland wrote:

Just to clarify, that's printing out a message every time an element is calculated and using random replacement (and on an incomplete system, actually). But still, it's REALLY slow... Nick

For the time being, try working with this code instead (make this "matmult2"): /* matmult2.c * Test program to do matrix multiplication on large arrays. * * This version uses a storage-inefficient technique to get a * shorter running time for the same memory usage. * * Intended to stress virtual memory system. * * Ideally, we could read the matrices off of the file system, * and store the result back to the file system! */ #include <unistd.h> #include <stdio.h> #define Dim 72 /* sum total of the arrays doesn't fit in * physical memory */ int A[Dim][Dim]; int B[Dim][Dim]; int C[Dim][Dim]; int T[Dim][Dim][Dim]; int main() { int i, j, k; for (i = 0; i < Dim; i++) /* first initialize the matrices */ for (j = 0; j < Dim; j++) { A[i][j] = i; B[i][j] = j; C[i][j] = 0; } for (i = 0; i < Dim; i++) /* then multiply them together */ for (j = 0; j < Dim; j++) for (k = 0; k < Dim; k++) T[i][j][k] = A[i][k] * B[k][j]; for (i = 0; i < Dim; i++) for (j = 0; j < Dim; j++) for (k = 0; k < Dim; k++) C[i][j] += T[i][j][k]; printf("matmult2 finished.\n"); return (C[Dim-1][Dim-1]); /* and then we're done */ } -- - David A. Holland | VINO project home page: dholland(a)eecs.harvard.edu | http://www.eecs.harvard.edu/vino