Answered: Process 0: int rank = 0; int commsize =…

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

Topic Video

Question

For this MPI Times Table Program please create a program(C++) that runs on N processes to create a N-1xN-1 times table that behaves in the following way:
• Process 0 will: Receive one vector of size N-1 from each of the other N-1 processes and output
their contents, starting with process 1 and ending with process N.
• Processes 1-N will: Send one vector of size N-1 to process 0 containing the first N-1 multiples of
its own process number.

Process 0:
int rank = 0;
int commsize = 4;
for(int i = 1; i < commsize; i++)
{
}
//receive a vector from process i
if (//receive was successful)
for (int j = 1; j < size OfVec; j++)
cout << vec[i]<<"";
Output:
1
2 3
2 4 6
3 69
Process 1:
//send a vector of 1, 2, 3 to Process 0
Process 2:
//send a vector of 2, 4, 6 to Process 0
Process 3:
//send a vector of 3, 6, 9 to Process 0

Expert Solution

Step by step

Solved in 4 steps with 2 images

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