Given C Code: void psum1a(float a[], float p[], long n) { long i; float last_val, val; last_val = p[0] = a[0]; for(i=1; i<n; i++) { val = last_val + a[i]; p[i] = val; last_val = val; } } Cycles per element (CPE): The CPE denotes performance of program that helps in improving code. It helps to understand detailed level loop performance for an iterative program. It is appropriate for programs that use a repetitive computation. The processor’s activity sequencing is controlled by a clock that provides regular signal of some frequency. Loop unrolling: It denotes a program transformation that would reduce count of iterations for a loop. It increases count of elements computed in each iteration. It reduces number of operations that is not dependent to program directly. It reduces count of operations in critical paths of overall computations.

Question

Want to see the full answer?

Answer 1

Question

Chapter 5, Problem 5.19HW

Program Plan Intro

Given C Code:

void psum1a(float a[], float p[], long n)

{

long i;

float last_val, val;

last_val = p[0] = a[0];

for(i=1; i<n; i++)

{

val = last_val + a[i];

p[i] = val;

last_val = val;

}

}

Cycles per element (CPE):

The CPE denotes performance of program that helps in improving code.

It helps to understand detailed level loop performance for an iterative program.

It is appropriate for programs that use a repetitive computation.

The processor’s activity sequencing is controlled by a clock that provides regular signal of some frequency.

Loop unrolling:

It denotes a program transformation that would reduce count of iterations for a loop.

It increases count of elements computed in each iteration.

It reduces number of operations that is not dependent to program directly.

It reduces count of operations in critical paths of overall computations.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

In MIPS assembly, implement integer division using rounding (rather than truncation). This is accomplished by taking the remainder of the division and dividing it by the original divisor. If the new quotient is higher than or equal to one, multiply it by one.Otherwise, leave the original quotient alone.In MIPS assembly, implement integer division using rounding (rather than truncation). This is accomplished by taking the remainder of the division and dividing it by the original divisor. If the new quotient is higher than or equal to one, multiply it by one.Otherwise, leave the original quotient alone.In MIPS assembly, implement integer division using rounding (rather than truncation). This is accomplished by taking the remainder of the division and dividing it by the original divisor. If the new quotient is higher than or equal to one, multiply it by one.Otherwise, leave the original quotient alone.In MIPS assembly, implement integer division using rounding (rather than truncation).…

Note: Please Answer in C++ programming language. Kulyash is given an integer N. His task is to break Ninto some number of (integer) powers of 2. To achieve this, he can perform the following operation several times (possibly, zero): Choose an integer X which he already has, and break X into 2 integer parts (Y and Z) such that X = Y + Z. Find the minimum number of operations required by Kulyash to accomplish his task. Input 1 3 Output 1

2. There is a more efficient algorithm (in terms of the number of multiplications and additions used) for evaluating polynomials than the conventional algorithm described in the previous exercise. It is called Horner's method. This pseudocode shows how to use this method to find the value of anx" + an-1xn ++ a₁x + ao = 0 at x = c. procedure Horner(c, ao, a₁, a2,..., an: real numbers) y := an for i:=1 to n y := y*c+an-i return y(y = anc" +an-1c"1+...+ a₁c + ao} 2.a Evaluate 3x² + x + 1 at x = 2 by working through each step of the algorithm showing the values assigned at each assignment step. 2.b Exactly how many multiplications and additions are used by this algorithm to evaluate a polynomial of degree n at x = c? (Do not count additions used to increment the loop variable.)