mpi | Rust-based MPEG-4 box inspector with TOML output

This is the code I have written for the MPI's Group Communication Primitives-Brod cast example using c language try with Ubuntu system. I wrote a code for the string and variable concatenation here.

When I am compiling this code it shows error like that.(Please refer the image)

Can anyone help me to solve this?

I have a MPI program under Intel C++ with its Intel MPI library.

According to the user input, the master process will broadcast data to other worker processes.

In worker processes, I use a do-while loop to keep receiving data from master

I am new to MPI. I am not figure out how to reslove it. In c printf shows the output but in mpi the printf function shows error...

Code:

I am trying to install EZTrace which is a tool that aims at generating automatically execution trace from HPC. I downloaded the installation folder from here, https://eztrace.gitlab.io/eztrace/index.html. After extracting it, I found a README file:

I have this code that I would like to edit and run it as an MPI code. The array in the code mass_array1 is a multi-dimensional array with total 'iterations' i*j around 80 million. I mean if I flatten the array into 1 dimensional array, there are 80 million elements.

The code takes almost 2 days to run which is quite annoying as it is only small part of the whole project. Since I can log into a cluster and run the code through 20 or so processors (or even more), can someone help me edit this code to an MPI code?

Even writing the MPI code in C language works.

I am new to programing with MPI and I have an exercise where I have to multiply 2 matrices using MPI_Send and MPI_Recv while sending both matrices to my processes and sending back the result to the root process. (both matrices are square and N is equal to the number of processes).

This is the code I have written:

I am learning MPI and currently trying to implement a all to all broadcasting using send and receive operations. I know that number of processors is going to be the power of 2 and I wanted to implement an effective solution for this problem. I structured my thoughts like following.

all to all in a balanced binary tree with 8 processors

First, the red copy and exchange operations are done. Then the green operations should be completed and finally, the purple operations would conclude the all to all message sharing.

Assuming:

• Processor 0 has the message A
• Processor 1 has the message B
• Processor 2 has the message C
• Processor 3 has the message D
• Processor 4 has the message E
• Processor 5 has the message F
• Processor 6 has the message G
• Processor 7 has the message H

Some of the steps:

1. Processor 0 shares its message with Processor 7 and vice versa. So they both have messages A and H.
2. Processor 1 shares its message with Processor 6 and vice versa. So they both have messages B and G.
3. Processor 2 shares its message with Processor 5 and vice versa. So they both have messages C and F.
4. Processor 3 shares its message with Processor 4 and vice versa. So they both have messages D and E. (The red operations are done at this step.)
5. Processor 0 shares its message with Processor 3 and vice versa. So they both have messages A H D and E.
6. Processor 1 shares its message with Processor 2 and vice versa. So they both have messages B G C and F

...

I could not write a satisfying code for finding out the pair given the rank of the current processor. I thought finding out all the possible pairs recursively at the beginning like a look-up table to be used. But I would like to ask if there is a better way I could continue with? Also is the approach correct?

I want to pass information to the main process using MPI PUT, but I get an error that the process exits without finalize.

For example, the error for two processes looks like this:

job aborted:

I'd like to color output text.

I mean, I'm getting logs: