I have an algorithm (its details are not important) that evaluates a vector step by step. Each new value in the vector is a result of calculations over several old ones, such that new values can be calculated independently or parallelly. The size of the vector is supposed to be large (thousands or millions). So on each step I represent the vector as chunks and I spawn a thread for each chunk. After the calculations in the threads I save the result back into the vector.

I have an algorithm (its details are not important) that evaluates a vector step by step. Each new value in the vector is a result of calculations over several old ones, such that new values can be calculated independently or parallelly. The size of the vector is supposed to be large (thousands or millions). So on each step I represent the vector as chunks and I spawn a thread for each chunk. After the calculations in the threads I save the result back into the vector.

I have an algorithm (its details are not important) that evaluates a vector step by step. Each new value in the vector is a result of calculations over several old ones, such that new values can be calculated independently or parallelly. The size of the vector is supposed to be large (thousands or millions). So on each step I represent the vector as chunks and I spawn a thread for each chunk. After the calculations in the threads I save the result back into the vector.

The general idea of the server is to spawn certain amount of threads with task of handling streams.

this might be a fairly beginner question as I am new to Rust in general and to Tokio aswell.
Looking at (the slightly modified version of) the code from Tokio tutorial:

I’m learning std::sync::Barrier in Rust.