Consider the following program fragment that deals with a table T with 17 rows and 1024 columns, computing an average for each column and printing it to screen, where i is row index and j is column index:

for j = [0.....1023] {

temp = 0;

for i = [0.....16]:

temp = temp + T[i][j];

print(temp/17.0);

}

T[i][j] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is paged and holds 16 pages of size 1024 words, the page replacement policy is "least recently used", if T is stored in the virtual address space in row major format.

What is fault ratio of row major to column major arrangements?