Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
A fast concurrent FIFO queue and a fast concurrent priority FIFO queue using the two locks algorithm version 1.2
0 views
Skip to first unread message
Ramine
Dec 4, 2015, 1:50:13 PM12/4/15
to
Hello,
A fast concurrent FIFO queue and a fast concurrent priority FIFO queue
using the two locks algorithm version 1.2.
I have benchmarked those concurrent FIFO queues and they have given
2.2 millions of transactions(push and pop) per second.
You can download them from:
https://sites.google.com/site/aminer68/concurrent-fifo-queue-2
Authors: Amine Moulay Ramdane
Email: ami...@videotron.ca
Description:
A fast concurrent FIFO queue and a fast concurrent priority FIFO queue
that satisfy many requirements: They are FIFO fair, they minimize
efficiently the cache-coherence traffic and they are energy efficient on
the pop() side when you set the wait parameter to true in the
constructor: when there is no items in the queue they will not spin-wait
, but they will block wait on my SemaMonitor.
Language: FPC Pascal v2.2.0+ / Delphi 7+: http://www.freepascal.org/
Operating Systems: Windows, Mac OSX , Linux...
Required FPC switches: -O3 -Sd -dFPC -dFreePascal
-Sd for delphi mode....
Required Delphi switches: -$H+ -DDelphi
For Delphi XE-XE7 use the -DXE switch
{$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems
{$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems
Thank you,
Amine Moulay Ramdane.
A fast concurrent FIFO queue and a fast concurrent priority FIFO queue
using the two locks algorithm version 1.2.
I have benchmarked those concurrent FIFO queues and they have given
2.2 millions of transactions(push and pop) per second.
You can download them from:
https://sites.google.com/site/aminer68/concurrent-fifo-queue-2
Authors: Amine Moulay Ramdane
Email: ami...@videotron.ca
Description:
A fast concurrent FIFO queue and a fast concurrent priority FIFO queue
that satisfy many requirements: They are FIFO fair, they minimize
efficiently the cache-coherence traffic and they are energy efficient on
the pop() side when you set the wait parameter to true in the
constructor: when there is no items in the queue they will not spin-wait
, but they will block wait on my SemaMonitor.
Language: FPC Pascal v2.2.0+ / Delphi 7+: http://www.freepascal.org/
Operating Systems: Windows, Mac OSX , Linux...
Required FPC switches: -O3 -Sd -dFPC -dFreePascal
-Sd for delphi mode....
Required Delphi switches: -$H+ -DDelphi
For Delphi XE-XE7 use the -DXE switch
{$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems
{$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems
Thank you,
Amine Moulay Ramdane.
Ramine
Dec 4, 2015, 1:55:27 PM12/4/15
to
I wrote:
> I have benchmarked those concurrent FIFO queues and they have given
> 2.2 millions of transactions(push and pop) per second.
second using my blocking and FIFO fair SemaMonitor, that's also fast.
Thank you,
Amine Mopulay Ramdane.
Ramine
Dec 4, 2015, 2:00:12 PM12/4/15
to
On 12/4/2015 1:56 PM, Ramine wrote:
>
> I wrote:
> > I have benchmarked those concurrent FIFO queues and they have given
> > 2.2 millions of transactions(push and pop) per second.
>
>
> They haves given 2.2 millions of of transactions(push and pop) per
> second using my blocking and FIFO fair SemaMonitor, that's also fast.
That's on a x86 Quadcore at 2.6 GHz.
>
> I wrote:
> > I have benchmarked those concurrent FIFO queues and they have given
> > 2.2 millions of transactions(push and pop) per second.
>
>
> They haves given 2.2 millions of of transactions(push and pop) per
> second using my blocking and FIFO fair SemaMonitor, that's also fast.
0 new messages