As far as I know, instructions from a single thread can get divided and sent to different cores, it may happen regardless of the instruction set but I don't know.
How can I compare using more than one thread vs one thread with an event queue like in Rust?
Do instructions arrive from one place in both cases or are there several instruction queues?
#Concurrency and parallelism on RISC
1 messages · Page 1 of 1 (latest)
<@&987246964494204979> please have a look, thanks.
While you are waiting for getting help, here are some tips to improve your experience:
If nobody is calling back, that usually means that your question was not well asked and hence nobody feels confident enough answering. Try to use your time to elaborate, provide details, context, more code, examples and maybe some screenshots. With enough info, someone knows the answer for sure.
Don't forget to close your thread using the command </help-thread close:1027500463647621170> when your question has been answered, thanks.
What do you mean
i think if you send an add, a multiply, a divide, etc, they can usually be sent to be executed on different parts of the cpu at the same time
If you send that to what?
to the cpu, the instructions that a thread sends
like in assembly for example
i think this is it
the question is what would be the difference between a thread that fully utilizes the cpu using concurrency and several threads that do it being on a different task each
The second would be faster, but I don't understand what you are trying to say
a thread has a list of instructions, right? if there is another thread can the cpu process both or is there just one queue?
They can process the same instructions which would result of a race condition