just now I am trying to parallel Dijkstra alogrithm using openMP with MPI this helped thank you !. Could you further explain about how MPI reads the user defined op ? or maybe a tip to how to look at it ?
I'm glad to hear that!!! now regarding your question, I'm not sure what exactly you're after but rational answer would be maybe you should look into the source code :). Cause your question sounds it is implementation dependent and you might look into the source code of the MPI implementation that you're using. If you're using MPICH, you may look into src/mpi/coll maybe? you may look into a specific collective routine that you're interested to see how it differentiates the treatment for user-defined ops and builtin ones... btw I googled a few mins :) and I found a MSc thesis on the subject you're working maybe you can take a look into it too... [just type "dijkstra algorithm parallel" and it should pop up as the first options]. If you just want to explore the code you may use the GitHub page of MPICH @ github.com/pmodels/mpich/tree/main
I really like the way you explain things, but the text is too small for me to read. For future videos can you please consider doing full screen and increasing the font size, thanks!
Useful content, pretty advanced explanation. You don’t get stuff like this usually on RU-vid, everyone out there is doing bare bones stuff that everyone else has already done🤌🏿thanks for the shake up
If the for loop in runge-kutta function be for(int i=0; i<n-1;i++) cause x[i+1] may over the boundary? because I got a segmentation error with the code.
I get a "Debug Assertion Failed" error message when I try to run it and it gets to the Runge_Kutta_coupled function callout (right after I enter my value for n. Any ideas what that could mean?
I just made a quick googling about your error and I think this problem happens when you are using visual studio + debug compilation. Can you try to compile it in release mode ? You may also try to use gcc to see whether it works or not.
At 2402: between lines 164 and 165 of LinePlot.cxx, you need to insert a new line to update the file extension so that it is always lower case. At the current stage of the code, the work of std::transform() is useless (or not reflected). For those who are interested, the missing line should read something like: " fn.replace(found, ext.length(), ext);". Good and informative video on vtk, I have really learnt a lot, thanks.
so much ty, can u do guide how to install wayland with nvidia drivers, in opensuse news i seen that they fix some library and its working not(sor for bad english, subscribed)
