Annulleret

University proejct in C++

#####################################

Sequential algorithm implementation

Read the task carefully. Study the algorithm description in the paper and read the recommended or available literature. Design a proper algorithm to solve the problem.

Note, you have to extend the sequential algorithm into the parallel one. So this algorithm should be the core of your parallel solution finally.

Parallel algorithm implementation

Extend your sequential solution of the given problem into the parallel one

Implement the parallel algorithm on the MPI (Message Passing Interface)

#####################################

:Magic square

Problem MAS: magic square

Input data:

n = integer number, n>3

M = set of numbers {1,..,n2}

p = number of processors

Definition

S=n(1+n2)/2

Task:

Find an arrangement of the numbers from set M in an n x n matrix, with each number occurring exactly once, and such that the sum of the entries of any row, any column, or any main diagonal is S. This arrangement is called a magic square.

Output of the algorithm:

Row-wise listing of a magic square arrangement.

Sequential algorithm:(this implementation need to be done in two weeks deadline is 12 october.)

The sequential algorithm is of type SB-DFS with the search depth bounded by n2. An internal state is a permutation of the numbers from set M in an n x n matrix. Possible final states are permutations of numbers from set M that satisfy the property of a magic square. A backtrack is taken if at least one row, column, or diagonal has sum not equal to S. The algorithm terminates after finding the first solution. It always exists.

Solution for n=3. Sums of all rows, columns, and diagonals are 15.

Parallel algorithm:

The parallel algorithm is of type Master-Slave. Starting configurations are squares with the first s numbers placed row-wise, 2 ⇐ s ⇐ max(2,upper(10/n)).

******************************************************

Please read attached file, and ask questions if you have any, I need it ASAP no later then end of next week.

The tasks need to follow two implementation rule:sequential algorithm and [url removed, login to view] mean that the sequntinal need to get the parallel

Lower and right BID will WIN!

Færdigheder: C programmering, C++ Programmering, Software Arkitektur

Se mere: study programming, study algorithm, starting programming, solve sums, solution algorithm, set algorithm, sequential programming, sequential design, programming definition, programming algorithm questions, n2, max programming, matrix programming, master find, magic numbers programming, magic number programming, get programming done, dfs search algorithm, dfs search, dfs problem, dfs depth first search, dfs data, depth search algorithm, depth first search algorithm, depth first search

Om arbejdsgiveren:
( 0 bedømmelser ) Warsaw, Poland

Projekt-ID: #934068

11 freelancere byder i gennemsnit $126 for dette job

srinichal

I can deliver the same

$250 USD in 3 dage
(99 bedømmelser)
6.9
waqararshad

30$ and can do it in one day.....

$30 USD på 1 dag
(11 bedømmelser)
4.3
AndersonDunai

Hello, Sir. Please, see the PM. Thanks!

$60 USD på 1 dag
(4 bedømmelser)
1.7
halafoo

Check PMB please.

$150 USD in 7 dage
(0 bedømmelser)
0.0
hirensinojiya

I WILL DO THIS PROJECT.

$50 USD in 5 dage
(0 bedømmelser)
0.0
ShubhabrataKarma

I am confident of doing it.Waiting for your reply.

$200 USD in 5 dage
(0 bedømmelser)
0.0
leivio

hi, I graduated in Electrical Engineering and have experience developing C and C + +.

$120 USD in 5 dage
(0 bedømmelser)
0.0
kamranbabar

I have around 4 years of Industrial experience in the field of C/C++, So I think I can do this.

$200 USD in 7 dage
(0 bedømmelser)
0.0
mirzaosamawahid

want to work on your project

$250 USD in 10 dage
(0 bedømmelser)
0.0
droptopearl

....................................

$45 USD in 5 dage
(0 bedømmelser)
0.0
kunsa

Hello, I do well in algorithm. I have taken part in ACM. I think I can manage it.

$30 USD in 2 dage
(0 bedømmelser)
0.0