Question: Write a C program using MPI to implement parallel odd - even sort. Use 8 cores ( ntasks and tasks per node should be 8

Write a C program using MPI to implement parallel odd

-

even sort.

Use

8

cores

(

ntasks and tasks per node should be

8

in your script

),

each one will hold

1

value.

Each core will have

2

variables for values. The first

(

)

should store the value the core currently

has, and the second

(

)

will be the value that it will receive from the neighboring core at each

phase.

Assign each core a value such that they are unsorted i

.

.

the values C

0,

1,

2,

3,

4,

5,

6,

7

should be unsorted

(

where Ci indicates the value core with rank i has

) .

You can do this by

giving each core the value

8 -

rank

for example, or use a random number generator. There are

multiple ways to do this, be as creative as you like.

The algorithm begins proceeds by alternating

2

phases.

Phase

1

: Core

0

and Core

1

communicate

(

use MPI send and receive commands

)

values and if

0 >

1

then store C

1

in core

0

and C

0

in core

1

.

.

exchange values, otherwise do nothing.

Then similarly Core

2

and Core

3

communicate values and if C

2 >

3

then store C

3

in core

2

and

2

in core

3

.

.

exchange values, otherwise do nothing. Then Core

4

and Core

5

communicate

values and if C

4 >

5

then store C

5

in core

4

and C

4

in core

5

.

.

exchange values, otherwise do

nothing. Finally, Core

6

and Core

7

communicate values and if C

6 >

7

then store C

7

in core

6

and C

6

in core

7

.

.

exchange values, otherwise do nothing.

Phase

2

: Core

1

and Core

2

communicate

(

use MPI send and receive commands

)

values and if

1 >

2

then store C

2

in core

1

and C

1

in core

2

.

.

exchange values, otherwise do nothing.

Then similarly Core

3

and Core

4

communicate values and if C

3 >

4

then store C

4

in core

3

and

3

in core

4

.

.

exchange values, otherwise do nothing. Finally, Core

5

and Core

6

communicate

values and if C

5 >

6

then store C

6

in core

5

and C

5

in core

6

.

.

exchange values, otherwise do

nothing.

Repeat this process

4

times.

After this is complete, have each core send their current value to core

0,

and have core

0

the values in sorted order

(

see Hello

2 .

c example in slides

) .

Use a for loop to receive values from

each core and print as you receive them, this ensures they will be printed in order of rank

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

-> PLEASE READ CAREFULLY =20 then make sure tasks per node is fixed at 20 i n your script when you experiment. 2. Bonus (2 points). Generalize your code in part 1 to take into account an odd number...

Write a C program using MPI to implement parallel odd - eve n sort . Use 8 cores (ntasks and tasks per node should be 8 in your script) , each one will hold 1 value . Each core will have 2 variables...

Modeling and Simulation Using Parallel Computing Assignment 1. Write a C program using MPI to implement parallel odd-even sort for the given total values of elements and cores. Your code will support...

Can I get an example on how to set this up using #include and #include . Write a C program using MPI to implement parallel odd - even sort for the given total values of elements and cores. Your code...

1 . Write a C program using MPI to implement parallel odd - even sort for the given total values of elements and cores. Your code will support 2 m elements to sort, that is , the number of elements...

Write a C program using MPI to implement parallel odd-even sort for the given total values of elements and cores. Your code will support 2m elements to sort, that is, the number of elements to sort...

) Consider integer division of one two's-complement binary number by another. Programming languages may vary in the result when one argument is negative. What differing conventions might they be...

) Explain the collision detection mechanism applied in standard wired medium access control associated with CSMA and indicate why this might be unsuitable for wireless networks. [2 marks] (ii)...

can someone solve this Modern workstations typically have memory systems that incorporate two or three levels of caching. Explain why they are designed like this. [4 marks] In order to investigate...

1. Write an MPI program in C that will have each process (core) print the following message X+1 times: Hello from process X, where X is the rank of the given process. That is, process with rank 0...

Use the approximate operation count 2n/3 for Gaussian elimination to estimate how much longer it takes to solve n equations in n unknowns if n is doubled.

How do these control activities help protect a company against error, theft, and fraud?

Nature of Partnership Taxation ( LO 1 0 . 1 ) Jekyll is a limited partner in the JH Partnership. His investment in JH is $ 1 0 , 0 0 0 . If JH fails and is forced to wind up operations, Jekyll s...

Which of the following is true regarding "cheat days"? sopha