COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG
COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG
3rd Edition
ISBN: 9780134671123
Author: Bryant
Publisher: PEARSON
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:

COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG, Chapter 5, Problem 5.13HW , additional homework tip  1

COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG, 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
6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]
Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4
a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science 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