Suppose we were to implement an operation in which each processor starts with an array of m words , and needs to get the global sum of the respective words in the array at each processor. We implement this operation on a 8-node ring by performing a Single node accumulation of the elements of the array, followed by a one-to-all broadcast of the result array.

Suppose we were to implement an operation in which each processor starts with an array of m words , and needs to get the global sum of the respective words in the array at each processor. We implement this operation on a 8-node ring by performing a Single node accumulation of the elements of the array, followed by a one-to-all broadcast of the result array.

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

Similar questions

Write a MPI program in C to multiply two n-by-n matrices using p processors with 1 <= p <= 8. Fill up the matrices with some constant values so that it would be easier for you to verify the resulting matrix for correctness. You may use collective operations or send/receive primitives.
Need help turning this code into Python Code please. function A = StiffnessAssembler1D(x) n = length(x)-1; A = sparse(n-1,n-1); for i = 1:n-2 h = x(i+2) - x(i+1); A(i,i) = A(i,i) + 1/h; A(i,i+1) = A(i,i+1) - 1/h; A(i+1,i) = A(i+1,i) - 1/h; A(i+1,i+1) = A(i+1,i+1) + 1/h; end A(1,1) = A(1,1) + 1/h; A(n-1,n-1) = A(n-1,n-1) + 1/h; end function b = SourceAssembler1D(x,f,g) n = length(x)-1; b = sparse(n-1,1); for i = 1:n-2 h = x(i+2) - x(i+1); b(i) = b(i) + f(x(i+1))*h/2; b(i+1) = b(i+1) + f(x(i+2))*h/2; end b(1) = b(1) + g(1)/h +f(x(2))*h/2; b(n-1) = b(n-1) + g(2)/h +f(x(n))*h/2; end u_exact = @(x) (exp(x).*cos(x)/2)'; aa=0:0.01:2; plot(aa,u_exact(aa),'r--') hold on; h = 0.5; x = 0:h:2; g = [0.5 exp(2)*cos(2)/2]; A = StiffnessAssembler1D(x); f = @(x) exp(x)*sin(x); b = SourceAssembler1D(x, f, g); u_freedom = A\b; u = [g(1);u_freedom;g(2)]; plot(x,u); legend('Exact Solution','Numerical Solution'); hold off
2. Explain how you can sort a sequence of n integers from a range of size nglgn in O(n log log n) time (assuming each integer fits in a constant number of machine words). 3. An in-place algorithm uses a constant number of machine words of memory on top of the memory initially occupied by its input and eventually occupied by its output. Give code or pseudo-code for an in-place version of QuickSort.
Show L = { w|w is in {0, 1, 2}* with no(w) > n:(w) and no(w) 2 n2(w), where no(w) is the number of Os in w, n:(w) is the number of 1s in w, and n2(w) is the number of 2s in w } is not context free. Use w = Op+11P2P+1 as your string and assume p is the pumping length.
Make and implement a mergesort variation that gives an int[] array perm, where perm[i] is the index of the array's i th smallest element, rather than rearranges the array's elements.
The improved algorithm for finding the occurrences of sequence P[1, . . . , m]in sequence T[1, . . . , n] can also be implemented in Perl in a straightforwardway, as shown in the following Perl script. Recall that the suffix array of thesequence T[1, . . . , n] will be a permutation of array positions 0, 1, . . . , n − 1,because Perl arrays do not start with position 1 but, rather, with position 0.
NEED ANSWER ASAP!
Describe an efficient algorithm for finding a maximum spanning tree in G, which would maximize the bandwidth between two switching centers. Describe the problem in terms of input and expected output clearly. Develop a program that accepts a network G of switching centers and the bandwidth between them (not all are connected directly with each other) and two switching centers a and b; it will output the maximum bandwidth between any two switches a and b. Please give solution in Java/C/Python language
Trace the stack contents throughout the execution of the call mod in the following pseudo-code of a recursive programme mod that computes a mod b given a, b as inputs (23, 7). procedure mod (a, b) if (a < b) then mod := a else { x := a − b 1 : mod( , ) 1 1 y = x b mod:= 1 y } end mod
Now suppose that you are given two unsorted arrays A and B, con-taining m and n elements respectively. You are also given a blackbox O(n) selection algorithm SEL that can be called on A and Bseparately and, in addition, a small number (say, ten) of extra mem-ory words that can be used to store some extra data. Using SELas a subroutine, design an O(n + m) algorithm for finding the kthsmallest element in the combined set of O(m + n) elements.You may not merge the two arrays in another array and call an algo-rithm (either SEL or something you wrote) on this third array. Thisis because there is no extra memory available to build this third array.
Consider the following variation on MergeSort: instead of dividing a list (say, of integers) evenly (that is, half and half or half and half plus 1) at all levels of recursion, we choose to divide a list this way - a left list that consists of exactly one integer and a right list that consists of the remaining integers. The time-complexity of this variation of MergeSort is: (a) O(n log n) (b) O(n²) (c) O(n) (d) none of the above
By choosing an acceptable pivot and a reasonable cut-off value for the sort, one may enhance the performance of a quicksort.