Hi, thank you for your response. I've made some updates to my implementation by including your suggested time calculations along with both wtime() and clock() functions. This should help provide a clearer picture of the performance. I would greatly a...
In addition to my previous response, I realize that it may be impossible to perfectly time a multi-threaded function.
Although clock gettime(CLOCK THREAD CPUTIME ID, t) excludes scheduling delays, we will always call the function in the master thre...
When I run my program on Setonix, it occasionally gets killed, although sometimes it completes successfully. The logs indicate that the termination is due to an out-of-memory error.
Could you provide information on the memory limitations for our progr...
Using --cpus-per-task 128 is the correct way to specify the thread count. Since we don not have control over how Setonix operates, we must work with its scheduling behavior as best we can.
I still cannot see the C code, so I am not sure how you meas...
I just assumed that all matrices are square and defined a constant N for both rows and columns. I hope our UC does not impose a strict limit on this. After all, these are just minor details; the main focus of the project should be on the parallel alg...
I suspect that Setonix may be executing our code in a sandboxed environment, which might restrict it to using a single core and limiting memory resources, regardless of how we configure the batch file. Since we are likely classified as less privilege...
For the ordinary matrix multiplication algorithm in Task 1 of Project 1, do we assume that the matrices are always square? So define ROWS ... and define COLS ... are the same number? As I understand it, if these numbers aren't the same, matrix ...
I don't expect this to be answered within the week. The funny thing is, the deadline for our lab report is next Friday, which falls in the same week as numerous mid-semester tests. Alas, best wishes to everyone.
SYSTEM WARNING YOUR STUDENT NUMBER HAS BEEN RECORDED FOR NOT BEING RESPECTFUL TO TEACHING STAFF. YOUR INTERNET BROWSER HISTORY IS NOW BEING REVIEWED FOR FURTHER EVIDENCE OF INAPPROPRIATE BEHAVIOR.
Just kidding. I agree with you mate.
Actually are we supposed to test each schedule and thread count in separate runtimes? And use all the relevant information for each scheduling type, and thread count in our evaluation? If so, in the code we submit do we want it to run the ideal numbe...
Also for task 3
Given "You have to find the number of threads that gives the best performance for each of the three cases" regarding the 0.01, 0.02, 0.05 probabilities, is the code we submit supposed to have the functionality for a defined probabilit...
Hi,
I've got a few questions regarding the first two tasks.
1. How do we prove that both pieces of code work as is asked? Currently I've got it printing out the matrices with smaller sample sizes - like 50 rows and columns, and its providing the correc...
Hi,
Hope everyone is well, I've just noticed that there seems to be a lack of responses int he forum from the teaching staff, despite Amitava stating that the help forum is that main place for help. Several questions remain unanswered, and it's becomi...
I only check the result if N 10,000 .
100,000 3 is an enormous number, even for Setonix. The computation for the compressed matrix is feasible only because we reduce it by a factor of p 2 , where p is 0.01, 0.02, or 0.05. I doubt any...
Hi all
Regarding Task 1 "Write an ordinary matrix multiplication algorithm so that we can check your results. The number of rows, number of columns should be declared at the top of your code using define directives."
Does anyone know do we need to ca...