I hope to learn how to use async code more effectively. Coroutines are very interesting. Structured concurrency is very useful in defining understanding concurr

I hope to learn how to use async code more effectively. Coroutines are very interesting. Structured concurrency is very useful in defining understanding concurrency. I wrote a multithreaded userspace scheduler in Java C and Rust which multiplexes lightweight threads over kernel threads. It is a 1:M:N scheduler with 1 scheduler threads M kernel threads and N lightweight threads. This is similar to golang which is P:M:N https://GitHub.com/samsquire/preemptible-thread https://GitHub.com/samsquire/preemptible-thread I am deeply interested in parallel and asychronous code. I write about it on my journal (link in my profile) I am curious if anybody has any ideas on how you would build an interpreter that is multithreaded - with each interpreter running in its own thread and sending objects between threads is done without copying or marshalling. I I think Java does it but I am yet to ask how it does it. Maybe I'll ask Stackoverflow. I wrote a parallel imaginary assembly interpreter that is backed by an actor framework which can send and receive messages in mailboxes. Here's some code: threads 25 <start> mailbox numbers mailbox methods set running 1 set current_thread 0 set received_value 0 set current 1 set increment 1 :while1 while running :end receive numbers received_value :send receivecode methods :send :send :send add received_value current addv current_thread 1 modulo current_thread 25 send numbers current_thread increment :while1 sendcode methods current_thread :print endwhile :while1 jump :end :print println current return :end This is 25 threads that each send integers to eachother as fast as they can. The sendcode instruction can cause the other thread to run some code. It can get up to 1.7 million requests per second without the sendcode and receivecode. With method sending it gets ~600,000 requests per second