Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming.threads > #3892 > unrolled thread

Scalable counting networks for Delphi and FreePascal..

Back to article view | Back to comp.programming.threads

Contents

  Scalable counting networks for Delphi and FreePascal.. Intelli2 <intelli2@mama.com> - 2017-10-13 19:59 -0400

#3892 — Scalable counting networks for Delphi and FreePascal..

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.

[toc] | [standalone]

Back to top | Article view | comp.programming.threads

csiph-web