Question

Try to write two pseudo-codes for the tree-structural global sum, one for a shared-memory setting and the other for a distributed-memory setting. First consider how this might be done in a shared-memory setting. Then consider how this might be done in a distributed-memory setting. In the shared-memory setting, which variables are shared and which are private?

and

Suppose we have a program that generates large quantities of random floating point data that it stores in an array. In order to get some feel for the distribution of the data, we can make a frequency histogram of the data. A frequency histogram is a graph with vertical columns that represent the frequency of a data point or range of data points occurring in a set of data. Recall that to make a histogram, we simply divide the range of the data up into equal sized subintervals, or bins, determine the number of measurements in each bin, and plot a bar graph showing the relative sizes of the bins or display how many floating point values are cast into each bin. As a very small example, suppose our data are 1.3, 2.9, 0.4, 0.3, 1.3, 4.4, 1.7, 0.4, 3.2, 0.3, 4.9, 2.4, 3.1, 4.4, 3.9, 0.4, 4.2, 4.5, 4.9, 0.9 Then the data lie in the range 0-5, and if we choose to have five bins, for example, 0-1, 1-2, …, and 4-5, the histogram might look something like In the exercise, you do not need to draw the histogram plot but you are required to display the frequency of range of floating point values. Task: Write a serial program that solves the frequency histogram problem. Given the following inputs, output an array containing the frequency count of floating point values being cast in each bin: - the array of data_count floats, data; - the count of floating-point values, data_count - the minimum floating-point value, min_meas; - the maximum floating-point value, max_meas; - the number of bins, bin_count. Note: You just need to display the frequency in the text format. No plot is needed. Please use pointers instead of regular array operations.

i want an exact solution of that not that one that is in the solution already have

Answer 1