!

CS 6230-001 Fall 2018 Grades YITONG DAI

Fall 2018
Total: 92.22%
Grades for YITONG DAI " Print Grades
Account Home Show All Details

Piazza Course Arrange By

Course assignments are not
Dashboard weighted.
Announcements CS 6230-001 Fall 2018 Due Date Apply

Assignments Parallel Computing HPC Calculate based only on graded

Courses assignments
Grades
Name Due Status Score Out of You can view your grades based
Calendar Files on What-If scores so that you
Sequential know how grades will be affected
Syllabus Programming Aug 29, 2018 by 11:59pm 10 10 #$
by upcoming or resubmitted
Inbox Modules assignments. You can test scores
for an assignment that already
My Media Score Details Close
includes a score, or an assignment
Help
Office 365 Mean: 8.9 High: 10 Low: 5 that has yet to be graded.

Adobe Creative
Cloud
Comments Close
ConexED
Coded to requirements. Easy to read. Program runs. Try to include NISHITH
ProctorU more tests next time onwards to make sure that you have thought of TIRPANKAR, Sep 3,
edge cases. 2018 at 3:58pm

01. hello
{omp, mpi} Sep 5, 2018 by 11:59pm 8 10 #$

Score Details Close

Mean: 8.2 High: 10 Low: 3

Comments Close
You can run more than 8 threads on your machine - its just that the number of
threads that are concurrently running is a max of 8. Also, remember that you
NISHITH
can use the trick (int)(rank*arrayLen/size) to determine the bounds of the
TIRPANKAR,
array instead of using chunkLength - that way the arrayLen does not have to
Nov 6, 2018
be divisible by size! The plot was required for 1x to 4x the number of cores on
at 9:09pm
your machine - you need to plot using more threads to see that the timing
actually goes up slightly. Well documented and concise - good work!

Hi Nishith,
I used the trick you mentioned, the reason I particular mentioned that it needs
YITONG
to be divisible is because I want to make sure the total length of array
DAI, Nov 10,
maintains the same, so that it's a fair comparison. My computer has 4 cores, so
2018 at
I did have 16 threads in my graph. Also I asked professor Hari about the
4:24pm
tendency of the graph, he said it's normal that timing didn't go up unless I use
a really large number for the number of threads.

02.
ownership Sep 12, 2018 by 11:59pm LATE 9.5 10 #$

Score Details Close

Mean: 8.3 High: 9.5 Low: 5.5

Comments Close
Great work on the report! You have plotted weak scaling for task 3 varying
NISHITH
the value of n along the x axis if the matrix M \in m\cross n. This is great! It
TIRPANKAR,
would be interesting if you had plotted a graph varying m instead of n along
Nov 25,
the x axis - the problem size can still be the same. This points out to the fact
2018 at
that the algorithm exhibits different scaling along the 2 dimensions which is
3:54pm
important to note! Great job!

03. divide &

conquer Sep 24, 2018 by 11:59pm LATE 8 10 #$

Score Details Close

Mean: 7.8 High: 9.5 Low: 5.5

Comments Close
Good work! Your discussion for task 2 is lacking detail - you have failed to NISHITH
consider that the first loop can actually be a nowait since the static schedule TIRPANKAR,
on n elements will make sure that d[i] will have EW access followed by ER Nov 25,
access. You have not included pseudocode for task 3. Also, the code for 3D 2018 at
vectors is not present in your submission. 7:15pm

04.
Collectives Sep 26, 2018 by 11:59pm 8.5 10 #$

Score Details Close

Mean: 7.8 High: 10 Low: 4

Comments Close
NISHITH TIRPANKAR,
Good work with the code for the assignment. In task 2 I was hoping
Nov 29, 2018 at
for a more detailed explanation as well as analysis of the algorithm.
2:17am

05. Cannon's
Algorithm for
Matrix Oct 3, 2018 by 11:59pm 8 10 #$
Multiplication

Score Details Close

Mean: 8.5 High: 10 Low: 6.5

Comments Close
NISHITH
Good work presenting the results of scaling - although a simpler single
TIRPANKAR,
comparison of pure MPI vs hybrid MPI-OMP was asked you implemented
Nov 29,
strong and weak scaling. You have not answered the 2 questions that were
2018 at
posed in the assignment for which I have taken points.
11:12pm

Project
Proposal Oct 16, 2018 by 11:59pm % 0

06. Sorting
Oct 17, 2018 by 11:59pm 10 10 #$

Score Details Close

Mean: 9.1 High: 10 Low: 8

Comments Close
Good work with the scaling graph. NISHITH TIRPANKAR, Dec 1, 2018 at 3:31pm

MidTerm
Spring 17 Oct 23, 2018 by 11:59pm MISSING - 20

07. Poisson
Oct 24, 2018 by 11:59pm 10 10 $

Score Details Close

Mean: 8.8 High: 10 Low: 0

Midterm
Exam Nov 7, 2018 by 11:59pm 94 100 #$

Score Details Close

Mean: 79.1 High: 95 Low: 40

Comments Close
Great work! Simple, concise and easy to read!
NISHITH TIRPANKAR, Dec 24,
In question 1 you did not address the question y \in x - the
2018 at 11:31am
algorithm is not written.

Final Project
Report Dec 7, 2018 by 11:59pm LATE % 40

166.00 /
Assignments 92.22% 180.00

166.00
Total 92.22% /
180.00