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

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

Re: A fast concurrent FIFO Queue and a fast concurrent priority FIFO Queue version 1.2

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

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.

Contents

  Re: A fast concurrent FIFO Queue and a fast concurrent priority FIFO Queue version 1.2 jared.davison@gmail.com - 2019-01-17 05:38 -0800
    Re: A fast concurrent FIFO Queue and a fast concurrent priority FIFO Queue version 1.2 Horizon68 <horizon@horizon.com> - 2019-01-17 07:11 -0800

#4871 — Re: A fast concurrent FIFO Queue and a fast concurrent priority FIFO Queue version 1.2

Hi Amine, 

Thanks for posting this. 

Your work looks interesting. Unfortunately the download link is dead. Would you please post a new download link.

Thanks!

Jared

On Saturday, December 5, 2015 at 3:55:34 AM UTC+10, Ramine wrote:
> Hello,
> 
> 
> A fast concurrent FIFO Queue and a fast concurrent priority FIFO Queue 
> version 1.2
> 
> You can download it from:
> 
> https://sites.google.com/site/aminer68/concurrent-fifo-queue-1
> 
> 
> Author: Based on Dmitry Vyukov concurrent FIFO queue
> 
> Email: aminer@videotron.ca
> 
> Description:
> 
> Description: A fast concurrent FIFO queue and a fast concurrent priority 
> FIFO queue that satisfy many requirements: they have more parallelism 
> than the two locks algorithm, they are waitfree and starvation-free and 
> FIFO fair on the push() side and they are FIFO fair on the pop(), and 
> they minimizes efficiently the cache-coherence traffic and they are 
> energy efficient on the pop() side when you set the wait parameter to 
> true in the construtor: when there is no items in the queue they will 
> not spin-wait , but they will block wait on my SemaMonitor, and when the 
> wait parameter of the constructor is set to false they uses only an 
> atomic increment on the push() side and a CAS and a lock on the pop() 
> side, so they are fast, those concurrent FIFO queues are more scalable.
> 
> You have 5 options for setting the kind of locks, just look inside 
> defines.inc , if you want to set it for the Mutex that is energy 
> efficient because it blocks the threads, uncomment the option Mutex,if 
> you want to set it for my scalable array based lock called AMLock just 
> uncomment the option AMLock inside defines.inc, if you want to set it 
> for my scalable lock called MLock just uncomment the option MLock inside 
> defines.inc, if you want to set it for Ticket Spinlock just uncomment 
> the option TicketSpinlock ,If you want to set it for Spinlock just 
> uncomment the option Spinlock.
> 
> 
> 
> 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.

[toc] | [next] | [standalone]

#4872

Hello,


Jared wrote:
 >Hi Amine,

 >Thanks for posting this.

 >Your work looks interesting. Unfortunately the download link is dead. 
 >Would you please post a new download link.

 >Thanks!

 >Jared


You will find it here:

https://sites.google.com/site/scalable68/


But i think the following is better:

Lockfree bounded LIFO stack and FIFO queue

https://sites.google.com/site/scalable68/lockfree-bounded-lifo-stack-and-fifo-queue


Thank you,
Amine Moulay Ramdane.

[toc] | [prev] | [standalone]

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

csiph-web