Hello..
Scalable counting networks for Delphi and FreePascal..
Author: Amine Moulay Ramdane
Description:
Counting networks are truly scalable and are a special type of balancer
networks which count.
They were first introduced by Aspnes, Herlihy, and Shavit in the
following paper:
James Aspnes, Maurice Herlihy, and Nir Shavit. 1994. Counting networks.
J. ACM 41, 5 (September 1994), 1020-1048.
This project's goal is to evalute the scalability of counting networks
in modern SMPs.
This is a port to Delphi and FreePascal of this project that implement
scalable counting networks:
https://github.com/stephentu/counting-networks
I have added to the above project a function called: get_tl_idx(), to
expose a thread local called tl_idx to be more useful.
You can download it from:
https://sites.google.com/site/aminer68/scalable-counting-networks-for-delphi-and-freepascal
Thank you,
Amine Moulay Ramdane.