Given C code: double aprod(double a[], long n) { long i; double x, y, z; double r = 1; for(i=0; i<n-2; i+=3) { x = a[i]; y = a[i + 1]; z = a[i+2]; r = rxyz; } for(;i<n ; i++) r=a[i]; return r; } 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. Memory aliasing: It denotes a case where two pointers might designate to memory location that is same. The compiler should assume that unlike pointers might be aliased for safe optimizations. The program aspects that could limit chances for a compiler in generating optimized code denote optimization blockers. If a compiler is unable to determine whether two pointers might be aliased, it should adopt that either case would be possible. The possible optimization set is been limited in this case.

Question

Want to see the full answer?

Answer 1

Question

Chapter 5.9, Problem 5.8PP

Program Plan Intro

Given C code:

double aprod(double a[], long n)

{

long i;

double x, y, z;

double r = 1;

for(i=0; i<n-2; i+=3)

{

x = a[i];

y = a[i + 1];

z = a[i+2];

r = rxyz;

}

for(;i<n ; i++)

r=a[i];

return r;

}

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.

Memory aliasing:

It denotes a case where two pointers might designate to memory location that is same.

The compiler should assume that unlike pointers might be aliased for safe optimizations.

The program aspects that could limit chances for a compiler in generating optimized code denote optimization blockers.

If a compiler is unable to determine whether two pointers might be aliased, it should adopt that either case would be possible.

The possible optimization set is been limited in this case.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Dynamic Programming) Recall the rod cutting problem. We are given a non-negative integer n and an array P[1..n] of prices. We wish to cut the rod into a number of pieces whose lengths sum to n in order to sell the pieces. We are paid P[i] for selling a piece of length i. Our goal is to find the maximum total selling price for our pieces of rod. Consider a variant of the problem where we can cut the rod into at most k pieces where k ≤ n is given as part of the input. Describe an efficient algorithm for this version of the problem.

c++ solve with the function Given 2 arrays of integers with size n. Check whether the given arrays are equal. INPUT:56 9 1 4 74 7 1 6 9OUTPUT:YES (Because each element in the first array corresponds to an element in the second)

PYTHON/ COMPUTATIONAL STOICHIOMETRY Please help me build the stochiometric matrix for the chemical reaction.kindly use the code provided to guide your solution. 1.7 A + 2.1 B + 1.5 C <=> 3 D + 3.8 E + 1.2 F Code Block to build stoichiometric matrix: import numpy as np # Initialize the stoichiometric matrix as zeros_mtrx = np.zeros((len(reactions), len(species))) for (i_row, r) in enumerate(reactions): left = r.split('<=>')[0].strip() right = r.split('<=>')[1].strip() left_terms = left.split('+') left_terms = [t.strip() for t in left_terms] # in-place clean up right_terms = right.split('+') right_terms = [t.strip() for t in right_terms] # in-place clean up for t in left_terms: # reactants tmp = t.split(' ') # split stoichiometric coeff and species name if len(tmp) == 2: # stoich coeff and species name coeff = float(tmp[0].strip()) species_member = tmp[1].strip() j_col…