Hello,
My portable and efficient implementation of a future in Delphi and
FreePascal was updated to version 1.05
I have just enhanced it, and now it is working correctly and efficiently.
You can download it from my website:
https://sites.google.com/site/scalable68/a-portable-and-efficient-implementation-of-a-future-in-delphi-and-freepascal
And i have also implemented a ParallelFor() that scales very well,
please read the following:
My efficient Threadpool engine with priorities that scales very well was
updated to version 3.6
The Execute() method now supports passing a method or passing a procedure.
I have also implemented a ParallelFor() that scales well, here is the
method:
procedure ParallelFor(nMin, nMax:integer;aProc:
TParallelProc;Ptr:pointer=nil;pmode:TParallelMode=pmBlocking;Priority:TPriorities=NORMAL_PRIORITY);
You can pass a parameter in Ptr as a allocated memory, and you can set
pmode to pmBlocking so that ParallelFor() is blocking or to
pmNonBlocking so that ParallelFor() is non-blocking. Look inside the
test.pas example to see how to use it.
More precision about my efficient Threadpool that scales very well, my
Threadpool is much more scalable than the one of Microsoft, in the
workers side i am using scalable counting networks to distribute on the
many queues or stacks, so it is scalable on the workers side, on the
consumers side i am also using lock striping to be able to scale very
well, so it is scalable on those parts, on the other part that is work
stealing, i am using scalable counting networks, so globally it scales
very well, and since work stealing is "rare" so i think that my
efficient Threadpool that scales very well is really powerful, and it is
much more optimized and the scalable counting networks eliminate false
sharing, and it works with Windows and Linux.
You can download it from my website:
https://sites.google.com/site/scalable68/an-efficient-threadpool-engine-with-priorities-that-scales-very-well
Thank you,
Amine Moulay Ramdane.