I’m building tree-like index. It’s pages are interlocked for read during downward walk and for write with upward, so it’s safe to insert records in multiple threads.
So, data is devided into small buckets of 64k records, which are enqueued in tasks queue. My thread pool creates (3.14/2)*(processor count) worker threads.
If there are many concurrent loads it’s to devide workers among them, so that lots of workers will not stuck around root page of one index. Each task should get equal number of workers.

This is a mix of thread pool and semaphore, or balancing semaphore.

I didn’t find standart implementation for such structure, because I did’nt know how is it called. Currently I’m using my implementation, but it’d be very good to switch to common component.

Cheers, Andrey.

As James mentioned earlier, your very first source code lacks a main method, and the threading related part, by the way.

Thanks again for this introductory article !

But [ThreadStatic] makes sence only on static fields, so ThreadAccessCounter example should have:

[ThreadStatic]
private static int count;

otherwise all threads will be seeing the same instance “of count”..

Cheers,
Eduard