159735 Assignment 3

Comments: This was a very difficult assignment since, although there is parallelism in the algorithm it is difficult to achieve a good speedup. I gave marks to solutions where you tried to understand how the algorithm works and did at least some parallelisation. Even if it your solution does too much communication it may still have received good marks because it could have run faster on a machine with a different architecture.

ID

Time

Works?

Marks

Comments

01077635

41s

No

5

Splits up the clauses across the processes but only iterates locally and doesn't send updates.

02170027

33s (for 1000 vars)

No

7

Good attempt but does much too much communication.

03278999

5s

No

4

Only iterates locally and doesn't even send anything.

04061535


No

3

Doesn't compile

04189426

1.4s

No

8

Crashes, but your method is valid and it could be made to work. You also understand how the algorithm works.

04231708

1m14s

Yes

9

Not a great speedup but at least it works.

04244354



3

No real change to my original code

04250095

1m6s

Yes

6

Only runs on 2 processes with all the work being done by 1 process.

05119308

1m1s(for 10000 vars)

Yes

7

Good attempt but does much too much communication.

05158494



0

You submitted a solution for assignment 2

06235808


No

7

Crashes, but a good attempt although it does a lot of communication.

07217579



3

No real change to my original code

08497461



3

No real change to my original code

08602700

41s

No

5

Splits up the clauses across the processes but only iterates locally and doesn't send updates.

09116907

24s

No

6

Splits up the clauses across the processes but only iterates locally and doesn't send updates. Good attempt though.

98016864

1m20s

Yes

6

All the processing is done on the master node, good attempt though.