Modify the following code in Figure 1.0 for summation of two integer values to parallelize the summation operation across 3 computing cores based on data parallelism. int X [900]; int Y [600]; int sum; for (i=1; i<=900; i++) { for (j=1; j<=6003; j++) { sum= X[i] + YO); } }

Modify the following code in Figure 1.0 for summation of two integer values to parallelize the summation operation across 3 computing cores based on data parallelism. int X [900]; int Y [600]; int sum; for (i=1; i<=900; i++) { for (j=1; j<=6003; j++) { sum= X[i] + YO); } }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Write the assembly code for this C statement as a MIPS procedure: for ( i=0; i<100; i++) A[i] = 0;…

A: Lets see the solution.

Q: Consider the following fragment of C code for (i=0; i<=100; i=i+1) { a[i] = b[i] + c; }…

A: The objective of the question is to translate a given C code fragment into RISC-V assembly language,…

Q: Translate the following high-level code into a MIPS assembly code. Test your code in the QtSpim. For…

A: Solution:-

Q: void Func(int a[], int & r) { int i; for (i = 0; i < 100; i++) { a[i] = r + i/2; } } The…

A: Assembly code for the Func() function is given below: The function prologue saves the base pointer…

Q: I need an assembly code in x8086 for the following question: Declare an even array , use add between…

A: Task : Consider two arrays - one and two. If the last element in array one is multiple of 2, then…

Q: write MIPS assembly code which, when run under QtSpim, will do the following: This program works…

A: Start.Load the addresses and values of input_array, output_array, array_length, and amount_to_add…

Q: Translate the code to MIPS assembly code. Please make sure it will run on MARS IDE. Thank you

A: MIPS is an assembly language of MIPS processors. It is a reduced-instruction set architecture…

Q: dont use AI to do itQ1). Suppose $s0 stores the base address of word array A and $t0 is associated…

A: Detailed answers shown belowExplanation:

Q: 5.9 What is contained in array arr1 after each of the following sets of statements is executed? (a)…

A: We have given a code in MATLAB. We have to obtain the modified value of arr1 for the parts (a) and…

Q: Translate the following C code into MIPS assembly code, using the minimum number of instructions.…

A: Let's translate the given C code into MIPS assembly code. Here's a step-by-step breakdown:C…

Q: 2nd Code: void main ( ) { float in_matrix [2][2] = {{1.5,2.25},{20, 10}}; long long int g = inverse…

A: Given below is the RISC-V Assemble code for the given snippet of code-

Q: Explain briefly the associative memory operation when the argument register A the key register K…

A: Fixed memory can be thought of as a unit of memory where data is stored that can be identified to be…

Q: Translating this C code into assembly language, draw the stack for this function. Suppose the…

A: The assembly language program for above said function can be written as follows func(int, char):…

Q: write MIPS assembly code which, when run under QtSpim, will do the following: This program works…

A: Start.Load the addresses and values of input_array, output_array, array_length, and amount_to_add…

Q: Convert the following C code into ARM assembly code. // x in X1, y in X2, return sum in XO int…

A: Given that, Convert the following C code into ARM assembly code. // x in X1, y in X2, return sum in…

Q: Convert the following C code to native hardware MIPS assembly. The variables a, b and x are signed…

A: sge Rdest, $s0, $s1 # if (a >= b), if a>=b, it stores value 1 in Rdest beq Rdest, $0,…

Q: What addresses in memory contain array A?

A: Given: What addresses in memory contain array A?

Q: Suppose you have a RISC machine with a 2.7 GHz clock (i.e., the clock ticks 2.7 billion times per…

A: The answer is...

Q: program

A: In this question we have to write a program in 8086 microprocessor that takes 16 bit number and…

Q: Provide MIPS assembly code for the following loop: while(i!=0) A[i] = A[i-1] + 5; |--; Make the…

A: The answer is...

Q: Convert the following C code into ARM assembly code. n in X1, return count in XO int even(int n) {…

A: The method involved with utilizing a constructing agent like as to change over from (ARM) low level…

Q: c) For this task you have to implement the given method with the help of MIPS instruction. int foo…

A: Given code,

Q: else } { int e = *p/2; *p += e-a; L2: L4: movq 24(%rbp),%rax movl (%rax), %eax movl %eax, %edx $31,…

A: Start.Set up the stack frame by pushing the old base pointer, moving the stack pointer to the base…

Q: label in the middle of an instruction 1 order(int Int): 2 addi sd sd sp, sp, -64 ra, 56(sp) se,…

A: RISC-V is an instruction set language which is based on RISC (Reduced Instruction Set Computer)…

Q: Convert the following C code into ARM assembly code. // pointer to v in X1, n in X2, return prod in…

A: Given code: //pointer to v in X1, n in X2, return prod in X0 double arraytimes(double *v,int n){…

Q: I need help with finding the memory location of d That is the only thing I require assistance with

A: Program ApproachStartInclude header filesFunction declarationPrint the memory location of variable…

Q: Write MIPS code to calculate Arr[i+3] = Arr[i] (this is an assignment statement that transfers the…

A: Base address=0*12348000(address of the first element, arr[0] therefore, load base address:-…

Q: The values of array Y after executing the following code is: X DB 'ASSEMBLY' Y DB 5 DUP('*') STD MOV…

A: Solution)From code - Y='*#sse' Explanation- DUP will tell to print the * for 5 times which will be…

Q: Convert the following high-level code snippet into RISC-V assembly. Assume that the base addresses…

A: ARM assembly language is a low-level programming language used to write programs for ARM…

Q: Suppose, the base addresses of Array A and B are in $s0 and $s1 respectively, p is in $s2, and i is…

A: Suppose, the base addresses of Array A and B are in $s0 and $s1 respectively, p is in $s2, and i is…

Q: Topic : Writing MIPS code. 1.Consider the equation and write MIPS code for it:…

A: $s0 = Base address of array A[] $s1 = Base address of array B[] $s2 = X Given, X=(A[3]+B[5]) -…

Q: Ent recurSum(int n) if (n <= 1) return n; return n + recurSum(n - 1):

A: Write the MIPS assembly for the following code. Plzzzz attach a QtSpim screenshot that it works…

Q: #include 2 #include int main(void) { srand(time(@)); int arr[100]; int sum = 0; 4 6 7 %3D for(int…

A: just see the below code C program convert to RISCV assembly

Q: 2nd Code: void main ( ) { float in_matrix [2][2] = {{1.5,2.25},{20, 10}}; long long int g = inverse…

A: Given below is the RISC-V Assemble code for the given snippet of code

Q: a=0.0; i=10; while (i>0) { i=i-1; a=a*B[i]; } where a is a single-precision floating-point number…

A: sub.s $f0, $f0, $f0 #single precision floating point for subtraction operations addi…

Q: Implement the following C recursive function using RISC-V instructions. Use x6 to store the value of…

A: n is in x10x1 is the return addressx11 contains the result we use x5 ( a temporary register).…

Question

Modify the following code in Figure 1.0 for summation of two integer values to parallelize the
summation operation across 3 computing cores based on data parallelism.
int X [900];
int Y [600];
int sum;
for (i=1; i<=900; i++)
{
for (j=1; j<=600; j++)
{
sum= X[i] + Y[I]);
}
}

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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

Consider the following fragment of assembly code: data array word 127,60,120,127 count word 5 code хог ах ах stc mov cx.count mov esi,offset array labell: add al,byte ptr [esi] inc esi loop labell label2: A: [1 Point] How many times the body of the loop will be executed: B: [3 Points] On each pass through the loop, trace the value of AX register, CF and OF flags.
Consider: struct S7 { short m1; short m2; short m3; int m4 [12]; struct S7*next; }; int find_m4 (struct S7*p, int i) { return (&(p->m4[i])); } If we wrote find_m4() in x86-64 assembler, which instruction returns the correct value? O movl 8(%rdi, %rsi,4), %eax movq 6(%rdi, %rsi,8), %rax leaq 8(%rdi, %rsi,4), %rax leal 6(%rdi, %rsi,4), %eax None of these
Answer the given question with a proper explanation and step-by-step solution. Solve the assembly question regarding registers written in C code
please answer with proper explanation and step by step solution.
Use Keil ARM assembly to check whether an N × N matrix is a magic square. A magic square is an N × N matrix in which the sums of all rows, column, and the two diagonals add up to N (N2 + 1)/2. All matrix entries are unique numbers from 1 to N2. Register r1 will hold N. The matrix starts at location 0x20000010 (Base address) and ends at location (Base address + N2). It is assumed that all numbers are bytes, consider the 4-byte size of integers.Use the included picture The numbers 16, 3, 2, 13 will be stored at first four addresses, respectively. The numbers 5, 10, 11, and 8 would be stored at next four addresses, etc. If the matrix is a magic square, register r8 will be set (R8 should have a value 1) upon completion; otherwise, it will be cleared to 0. Please don't make it too complicated, if you can, I want to learn what I am writing down, if possible. Thank you!
write the mips assembly code
*using a 32-bit machine
3 C language into LC-3 Assembly Language
// Example 8.27a void Func(int a[], int & r) { int i; for (i = 0; i < 100; i++) { a[i] = r + i/2; }} The Intel assembler produces the following assembly code from Example 8.27a (32 bit mode): don't copy old bartleby answer it's wrong.
PROBLEM 1 For sorting a set of items, we can employ one of these famous algorithms, merge- sort, heapsort, quicksort, and shell-sort. We can program in both Java and Python, and we have the choice of using three different computers with different instruction set architectures: x86, ARM, and MIPS. Regarding microarchitecture, for x86 we have two choices, and for ARM and MIPS we have three choices for each of them. How many choices we have to run a sort algorithm? (Draw diagram).
I want to translate the following C code into MIPS assembly Also, assume the base address of A[0] is stored at $s0 Also assume that every element of the array A is a 4-byte integer int k = 5; while (k > 0){ A[k] = A[k] + k; k = k – 1;}