Consider the following fragment of C code:

Assume that R, G, B, Y, U, and V are arrays of 64-bit integers. Assume that all data values and their addresses are kept in memory (at addresses 1000, 2000, 3000, 4000, 5000, and 6000 for R, G, B, Y, U, and V, respectively) except when they are operated on. Assume that values in registers are lost between iterations of the loop. Assume all addresses and words are 64 bits.

a. Write the code for RISC-V. How many instructions are required dynamically? How many memory-data references will be executed? What is the code size in bytes?

b. Write the code for x86. How many instructions are required dynamically? How many memory-data references will be executed? What is the code size in bytes? Compare your results to the multimedia instructions (MMX) and vector implementations discussed in the A.8.

Transcribed Image Text:

for (p=0; p <8; p++) { Y[p] =(9798*R[p] +19235*G[p] +3736*B[p])/32768; U[p] = (-4784*R[p] - 9437*G[p] +4221*B[p])/32768 +128; V[p] =(20218*R[p]-16941*G[p]-3277*B[p])/32768 +128;