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 4 of 8⬅ older  |  newer ⮕
Currently no other people reading this forum.


 UWA week 38 (2nd semester, week 8) ↓
SVG not supported 7:28pm Tue 17th Sep, Jiandong W.

Hi, Currently I am doing the memory free experiment based on the large-sized matrices, I just found if I increase the size to 10000, the memory free speed is really slow even if I did it in a parallel mode. I wonder if someone else can help me resolve...


SVG not supported 5:39pm Tue 17th Sep, ANONYMOUS

Since we are supposed to test with probabilities 0.01, 0.02, and 0.05, and for each one we generate a matrix X and a matrix Y. We compress each of the 3 X matrices and 3 Y matrices, producing 6 B matrices and 6 C matrices. So which one do we write to...


SVG not supported 1:31pm Tue 17th Sep, ANONYMOUS

Well actually it would usually make sense. Pretend we have 1 thread and 1 core. Every time one of the items in a row or column of the matrix needs to be accessed, that data needs to be pulled from the RAM or a cache into the CPU, this can take hundre...


SVG not supported 8:35pm Mon 16th Sep, ANONYMOUS

The speed of writing the result matrix B and C to file is extremely slow. The reason is the result matrix of B and C has column number nearly 100000 so it is very big. Can I write binary format to the file instead? I've tested it is much faster than w...


SVG not supported 8:10pm Mon 16th Sep, ANONYMOUS

Thanks, probably this is the reason why it get killed. However the tricky part is that if I run it without script, just . project. It can run sucessfully sometimes.


SVG not supported 6:46pm Mon 16th Sep, ANONYMOUS

i chose all the answers since any value is possible. i dont know if i get any mark for that


SVG not supported 6:11pm Mon 16th Sep, ANONYMOUS

Sorry, the first line of the previous reply is incomplete Your computer may also have pagefile.sys or swapfile enabled, so it is possible that you will not encounter an OOM (Out of Memory) error as it will swap memory between physical memory and disk...


SVG not supported 6:04pm Mon 16th Sep, ANONYMOUS

Your computer may also have pagefile.sys swapfile enabled. https www.man7.org linux man-pages man3 malloc.3.html


SVG not supported 5:46pm Mon 16th Sep, ANONYMOUS

I understand that but I dont think virual memeory management would affect the use of memory, this is what operation system and c library should gurantee. If malloc return sucess I should be able to use it freely. In fact I have run my program on my la...


SVG not supported 5:33pm Mon 16th Sep, ANONYMOUS

And a reminder if anything is not working as expected, you can use scancel job-id to kill your job so you will not have many jobs stuck in the queue.


SVG not supported 5:26pm Mon 16th Sep, ANONYMOUS

You can use squeue -u USER to get all of your currently running job, and then use sstat -j job-id to show the details of your job, including an entry representing memory usage. It's important to note that simply allocating memory via malloc() ...


SVG not supported 3:54pm Mon 16th Sep, ANONYMOUS

when I tried to alloc some memory on setonix, with script bin bash SBATCH --nodes 1 SBTACH --ntasks 28 SBATCH --partition work SBATCH --account courses0101 SBATCH --mem 200G export OMP SCHEDULE "static,3125" gcc -m64 -fopenmp -o project . project.c s...


SVG not supported 1:18pm Mon 16th Sep, Jinqiang L.

I don't think it make too much sense to use a thread number larger then core number since they block each other and could never be faster...


SVG not supported 1:12pm Mon 16th Sep, Jinqiang L.

I can be any value but a uninitialized int will very likely to be 0


SVG not supported 12:51pm Mon 16th Sep, ANONYMOUS

I believe a proper implementation should be able to perform the multiplication for p 0.05 and N 100,000 in under ten minutes. In fact, ten minutes is a generous estimate, and your program will likely complete the task in less time.


SVG not supported 12:48pm Mon 16th Sep, ANONYMOUS

Yeah I agree with the one above. I fixed core to 28 and got a perfect U shape by setting different thread numbers.


SVG not supported 10:30am Mon 16th Sep, ANONYMOUS

Isn't that changing the number of "cores". It seems --cpus-per-task can be up to 128, but I assume we should set it 28 since the task says it should use 28 cores. Then we can change the number of threads used with omp set num threads while keeping co...


 UWA week 37 (2nd semester, week 7) ↓
SVG not supported 9:06pm Sun 15th Sep, ANONYMOUS

Hi I am struggling to get my sparse matrix multiplication algorithm to any speed close to realistic when raising it above 1000x1000, without any parallel programming. My algorithm works by going through each value in the multiplying matrix, and then f...


SVG not supported 1:17pm Sun 15th Sep, ANONYMOUS

Cannot find any related entry on cssubmit https secure.csse.uwa.edu.au run cssubmit


SVG not supported 12:14pm Sun 15th Sep, ANONYMOUS

I agree. It might work in later versions, but earlier versions of OpenMP could exhibit undefined behavior. In this case, I think we might just need to choose the option that makes the most sense.

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