Assume:CPU Clock = 1 GHz1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.)1 memory access requires 100 clock cycles (Read or Write)Problem size: N = 1,000,000 (1 million)There is no cost associated with the loop index variable: do not count any arithmeticinstructions for initializing or incrementing the loop index value, do not count any memoryaccesses for accessing and using the loop index variable in your computation of a sum.Assume the loop index variable is "free of charge"There is no memory cost of accessing and updating your accumulator variable (e.g., sum+= ...), but there is an arithmetic operation involved in updating the accumulator variable.Questions:1. For algorithm #1 shown below (direct sum):• How many arithmetic instructions are required by this algorithm?• How many memory accesses are required by this algorithm?• How many clocks are required by this algorithm?• What is the CPI (cycles per instruction) required by this algorithm?•What is the estimated execution time for this algorithm in seconds or fractions ofseconds, not counting the print and any problem setup?Algorithm #1 - Direct SumObjective: compute the sum of integers 0..N-1sum = 0for i in range(0,N):sum += iprint("sum = ", sum)

Answered: Image /qna-images/answer/d999aa87-93f5-49a9-aec1-9d47e0cedef4.jpg

Answered: CPU Clock = 1 GHz 1 OP requires 5 clock…

CPU Clock = 1 GHz 1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.) 1 memory access requires 100 clock cycles (Read or Write)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.5: Variables And Declaration Statements

Problem 9E: (Practice) a. Using Figure 2.14 and assuming the variable name rate is assigned to the byte at...

See similar textbooks

Similar questions

(Practice) a. Using Figure 2.14 and assuming the variable name rate is assigned to the byte at memory address 159, determine the addresses corresponding to each variable declared in the following statements. Also, fill in the correct number of bytes with the initialization data included in the declaration statements. (Use letters for the characters, not the computer codes that would actually be stored.) floatrate; charch1=M,ch2=E,ch3=L,ch4=T; doubletaxes; intnum,count=0; b. Repeat Exercise 9a, but substitute the actual byte patterns that a computer using the ASCII code would use to store characters in the variables ch1, ch2, ch3, and ch4. (Hint: Use Appendix B.)
Lab Task: You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm Write a C program to simulate the MVT and MFT memory management techniques. Write a C program to simulate the following contiguous memory allocation techniques Worst-fit Best-fit First-fit TASK1: DESCRIPTION MFT (Multiprogramming with a Fixed number of Tasks) is one of the old memory management techniques in which the memory is partitioned into fixed size partitions and each job is assigned to a partition. The memory assigned to a partition does not change. MVT (Multiprogramming with a Variable number of Tasks) is the memory management technique in which each job gets just the amount of memory it needs. That is, the partitioning of memory is dynamic and changes as jobs enter and leave the system. MVT is a more ``efficient'' user of resources. MFT suffers with the problem of internal fragmentation and MVT suffers with…
The CPU clock is 1 GHz. One OP requires 5 clock cycles (for example arithmetic instruction and conditional). Each memory access (read or write) requires 100 clock cycles and the problem size is 1 million or n = 1,000,000. There is no memory access cost of loop index variable: don't count any arithmetic instructions for initializing or incrementing the loop index value. Assume the loop index variable is free of charge. There is an arithmetic operation involved in updating the accumulator variable. Algorithm Sum = 0 For i in range (0, n); Sum += i; Print (“sum =, sum) How many memory accesses and clocks are required by this algorithm?
CODE IN MACHINE LANGUAGE USING LC-3 Write an assembly program to set R0=1 if there's a 5 in one of ten memory locations, starting at x3100. At the beginning of the program, set R0 = 0. If no 5 is found, it should leave R0 set to 0. Please submit your assembly program below. I will run it with my data. Extra credit - 20 points: If a 5 is found, output the following message to the console. "A 5 was found at x31xx." 31xx is the hex address of the 5. Here is the test data I used to generate the screen print below. It is not the test data I will use to grade your project. .ORIG x3100.FILL #10.FILL #20.FILL #30.FILL #40.FILL #50.FILL #5.FILL #70.FILL #5.FILL #90.FILL #100.END
Question below 11. USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be solved using Greedy Algorithm Strategy. Jack and Jill’s parents decide to make their children do some house chores. So they list a set of activities that can be completed in a whole day. In order to complete each activity a certain amount of time (in hours) is required. The parents randomly call each of their children several times separately to choose from the given activities. In each call the children choose an activity based on the following conditions: In each call, each of them chooses one activity Jack has to choose an activity that has not been selected yet. Jill, being very little, should choose an activity that Jack has already chosen so that she can help her older brother because she cannot do such tasks by herself. Jack does not like doing chores, so he decides he would choose the activity that requires the shortest amount of time to complete among the…
Identify and fix any memory bugs you find in the following program:
Sea t (k) a function that denotes the number of times that the instruction sum + = i + j will be executed in the code that follows. k is assumed to be a positive integer. Find the exact formula for t (k). Find a simple function A (k) such that t (k) = Θ (A (k)). Justify the answer with the corresponding theorems. (Note: you are not asking what the value is end of the sum variable)
Assembly language Part 1: When a variable is stored in memory, it is associated with an address. To obtain the address of a variable, the & operator can be used. Write a C program addressOfScalar.c by inserting the code below in the main function. Questions: 1) Run the C program, attach a screenshot of the output in the answer sheet. 2) Attach the source code in the answer sheet 3) Then explain why the address after intvar is incremented by 4 bytes instead of 1 byte.
C PROGRAMMING HELP! I tried a threaded reply and bartleby wasn't having it. Soooo: Please create the header file as specified and implement it into my script. Thank you for your help, it is seriously appreciated! The header file deals with the following instruction prompt: Find the roots of the second order nontrivial solution.D2y+a1Dy+a2 = 0 => λ 2+a1 λ +a2 = 0Create a header file for this step. I believe the portion of the script that needs to be turned into a utilized header file is located in the main() function. Thank you so much for your help, pasted is a copy of my script so far: #include <stdio.h>#include <math.h> void compute_coefficients(double lambda1, double lambda2, double *C1, double *C2, double *C_alpha, double *theta);void display_output(double lambda1, double lambda2, double C1, double C2, double C_alpha, double theta); int main(){ int a, b, c; double lambda1, lambda2, C1, C2, C_alpha, theta; printf("Enter a, b, and c where a*D2y + b*Dy + c*y =…
A straightforward explanation of dynamic memory allocation is provided below.
Write a code in sim8085 for the following problem: The pressure of two boilers is monitored and controlled by a microcomputer works based on microprocessor programming. A set of 6 readings of first boiler, recorded by six pressure sensors, which are stored in the memory location starting from 2050H. A corresponding set of 6 reading from the second boiler is stored at the memory location starting from 2060H. Each reading from the first set is expected to be higher than the corresponding position in the second set of readings. Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. If all the readings of first set is higher than the second set, store 00 in the ‘D’ register. If any one of the readings is lower than the corresponding reading of second set, stop the process and store FF in the register ‘D’. Data (H): First set: 78, 89, 6A, 80, 90, 85 Second Set:71, 78, 65, 89, 56, 75
A layman's description of dynamic memory allocation is given here.