EBK COMPUTER SYSTEMS
EBK COMPUTER SYSTEMS
3rd Edition
ISBN: 8220101459107
Author: O'HALLARON
Publisher: YUZU
bartleby

Concept explainers

Question
Book Icon
Chapter 5, Problem 5.13HW

A.

Program Plan Intro

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 suitable for programs that use a repetitive calculation.
  • The processor’s activity sequencing is measured by a clock that provides signal of some frequency.

A.

Expert Solution
Check Mark

Explanation of Solution

Diagram for instruction sequence:

EBK COMPUTER SYSTEMS, Chapter 5, Problem 5.13HW , additional homework tip  1

EBK COMPUTER SYSTEMS, Chapter 5, Problem 5.13HW , additional homework tip  2

Explanation:

  • The data dependencies between instructions are been depicted in diagram.
  • The given instruction sequence is been decoded into operations.
  • It creates a critical path of operations.
  • The data flow between instructions is been shown in diagram.

B.

Program Plan Intro

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 suitable for programs that use a repetitive calculation.
  • The processor’s activity sequencing is measured by a clock that provides signal of some frequency.

B.

Expert Solution
Check Mark

Explanation of Solution

Lower bound on CPE:

  • The lower bound on CPE is been determined by critical path.
  • For data type “double”, it denotes the float add cell.
  • The lower bound on CPE is 3.0 based on the architecture.

C.

Program Plan Intro

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 suitable for programs that use a repetitive calculation.
  • The processor’s activity sequencing is measured by a clock that provides signal of some frequency.

C.

Expert Solution
Check Mark

Explanation of Solution

Lower bound on CPE:

  • The lower bound on CPE is been determined by critical path.
  • For data type “integer”, it denotes the long add cell.
  • The lower bound on CPE is 1.0 based on the architecture.

D.

Program Plan Intro

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 suitable for programs that use a repetitive calculation.
  • The processor’s activity sequencing is measured by a clock that provides signal of some frequency.

D.

Expert Solution
Check Mark

Explanation of Solution

Given C Code:

// Define method inner4

void inner4(vec_ptr u, vec_ptr v, data_t *dest)

{

// Declare variable

long i;

//Compute length of vector

long length = vec_length(u);

//Get first vector

data_t *udata = get_vec_start(u);

//Get second vector

data_t *vdata = get_vec_start(v);

//Initialize variable

data_t sum = (data_t) 0;

//Loop

for (i = 0; i < length; i++)

{

//Compute product and add

sum = sum + udata[i] * vdata[i];

}

//Store result

*dest = sum;

}

CPE value for floating-point versions:

  • The inner product computed is been accumulated in temporary.
  • The float add operation is only on key path.
  • The multiplication operation takes 5 clock cycles.
  • The overall operation takes 3 cycles to complete on average.
  • Hence, CPE value for floating-point versions is 3.0.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
(1 point) By dragging statements from the left column to the right column below, give a proof by induction of the following statement: an = = 9" - 1 is a solution to the recurrence relation an = 9an-18 with ao = : 0. The correct proof will use 8 of the statements below. Statements to choose from: Note that a₁ = 9a0 + 8. Now assume that P(n) is true for all n ≥ 0. Your Proof: Put chosen statements in order in this column and press the Submit Answers button. Let P(n) be the predicate, "a = 9″ – 1". απ = 90 − 1 = Note that Let P(n) be the predicate, "an 9" - 1 is a solution to the recurrence relation an = 9an-1 +8 with ao = 0." - Now assume that P(k + 1) is true. Thus P(k) is true for all k. Thus P(k+1) is true. Then ak+1 = 9ak +8, so P(k + 1) is true. = 1 − 1 = 0, as required. Then = 9k — 1. ak Now assume that P(k) is true for an arbitrary integer k ≥ 1. By the recurrence relation, we have ak+1 = ak+1 = = 9ak + 8 = 9(9k − 1) + 8 This simplifies to 9k+19+8 = 9k+1 − 1 Then 9k+1 − 1 = 9(9*…
Given the following request to an AI chatbot, which response is more accurate? (You should use Google to verify that the factual claims in each response are accurate.)   Prompt Is this true? The first recorded use of the phrase "when pigs fly" in print is in a 1616 play by Ben Jonson called "The Devil is an Ass," in which a character says, "When pigs fly, good-night!!" Response   Response A Response B Yes, that's true! The phrase "when pigs fly" indeed appears in Ben Jonson's 1616 play The Devil is an Ass and was said during the second act in a conversation between Fitzdottrel and Pug. The phrase was first used to express skepticism or disbelief, suggesting that something is as unlikely to happen as the fanciful idea of pigs flying. This usage is often cited as one of the earliest instances of the phrase in print.   The claim that the phrase "when pigs fly" was first recorded in Ben Jonson's 1616 play "The Devil is an Ass" is not accurate. There is no evidence from the…
This is for my Computer Organization & Assembly Language Class
Knowledge Booster
Background pattern image
Computer Engineering
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole