It's UWAweek 47

help5507

This forum is provided to promote discussion amongst students enrolled in CITS5507 High Performance Computing.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Showing 20 of 148 articles
Showing page 6 of 8⬅ older  |  newer ⮕
Currently no other people reading this forum.


 UWA week 36 (2nd semester, mid-semester break) ↓
SVG not supported 10:55pm Thu 5th Sep, ANONYMOUS

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...


SVG not supported 8:18pm Thu 5th Sep, ANONYMOUS

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...


SVG not supported 8:00pm Thu 5th Sep, ANONYMOUS

You can always set the memory limit in the parameters, like --mem 60g .


SVG not supported 7:36pm Thu 5th Sep, Yao T.

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...


SVG not supported 6:32pm Thu 5th Sep, ANONYMOUS

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...


SVG not supported 6:22pm Thu 5th Sep, ANONYMOUS

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...


SVG not supported 3:31pm Thu 5th Sep, ANONYMOUS

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...


SVG not supported 3:22pm Thu 5th Sep, Gihad C.

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 ...


SVG not supported 3:10pm Wed 4th Sep, ANONYMOUS

I can't lie, my heart somewhat dropped seeing the start of this. I can appreciate that


SVG not supported 2:24pm Wed 4th Sep, ANONYMOUS

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.


SVG not supported 2:13pm Wed 4th Sep, ANONYMOUS

To clarify, I mean no matter how many threads I set, e.g. from 1 to 128, the running time is always longer than the running time of 1 thread.


SVG not supported 2:11pm Wed 4th Sep, ANONYMOUS

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.


SVG not supported 11:13am Wed 4th Sep, ANONYMOUS

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...


SVG not supported 11:08am Wed 4th Sep, ANONYMOUS

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...


SVG not supported 10:49am Wed 4th Sep, ANONYMOUS

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...


SVG not supported 10:16am Wed 4th Sep, ANONYMOUS

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...


SVG not supported 11:38pm Tue 3rd Sep, ANONYMOUS

Moreover, RAM is not a concern here, only the time matters.


SVG not supported 11:36pm Tue 3rd Sep, ANONYMOUS

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...


SVG not supported 11:24pm Tue 3rd Sep, ANONYMOUS

Do you mind sharing the code? I don't think people will give helpful answers without knowing the details.


SVG not supported 3:53pm Tue 3rd Sep, ANONYMOUS

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...

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy