Miklos Cserzo wrote:
On Sat, 16 Jun 2001, Maurice Lombardi wrote:
I have only the following experience with large arrays on gpc/djgpp (DOS): There is a 50% - 100% variation in execution times due to memory cache considerations (this cache is presumably the "level 2" 256 or 512 kB cache of the Pentiums). Matrices are stored in pascal row-wise (same for C but the opposite is true for fortran). If you access elements row after row you minimize cache breaks. In a
So how have you stored and accessed your NxM elements ?
The maximal size of my array is 2000x2000. Let's say I have:
X:array[1..N,1..M] od real;
I access it as:
for i:= 1 to N do for j:= 1 to M do bla-bla-bla.. x[i,j];
That's what you call row-wise acces or just the opposite?
Yes. You fix the row number and then increase the column number. I suppose that it is for this "natural" way of writing that matrices are stored row-wise in Pascal, but I do not know. So you have an other problem. Can you give a code snippet to see if it is present on other computers/ systems/ gpc versions.
Maurice.