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

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

A concurrent waitfree FIFO queue version 1.0

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

Contents

  A concurrent waitfree FIFO queue version 1.0 aminer <aminer@toto.net> - 2014-04-21 19:31 -0700
    Re: A concurrent waitfree FIFO queue version 1.0 "Chris M. Thomasson" <no@spam.invalid> - 2014-04-21 16:48 -0700
      Re: A concurrent waitfree FIFO queue version 1.0 aminer <aminer@toto.net> - 2014-04-21 19:52 -0700
        Re: A concurrent waitfree FIFO queue version 1.0 "Chris M. Thomasson" <no@spam.invalid> - 2014-04-21 16:54 -0700
          Re: A concurrent waitfree FIFO queue version 1.0 aminer <aminer@toto.net> - 2014-04-21 19:59 -0700
      Re: A concurrent waitfree FIFO queue version 1.0 "Chris M. Thomasson" <no@spam.invalid> - 2014-04-21 16:52 -0700

#2205 — A concurrent waitfree FIFO queue version 1.0

Hello,


A concurrent waitfree FIFO queue version 1.0


Authors: Christopher Michael Thomasson and Amine Moulay Ramdane(author 
of Object pascal code and SemaMonitor)


Description:

A concurrent FIFO queue that satisfies many requirements: it is waitfree 
on the push() side and waitfree on the pop() side,  and it minimizes 
efficiently the cache-coherence traffic and it is energy efficient on 
the pop() side: when there is no items in the queue it will not 
spin-wait , but it will block and wait on my SemaMonitor. This 
concurrent FIFO queue  gives a throughput of 3.2 millions of 
transactions  per second on my 2.4 GHz Quadcore, that's cool and that's 
a decent  throughtput .

You can download my concurrent waitfree FIFO queue from:

http://pages.videotron.com/aminer/


Please take a look a the test.pas Object Pascal demo inside the zipfile, 
compile and run it...

Language: FPC Pascal v2.2.0+ / Delphi 7+: http://www.freepascal.org/

Operating Systems: Windows, Mac OSX , Linux , Unix...


Required FPC switches: -O3 -Sd -dFPC -dFreePascal

-Sd for delphi mode....

{$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]

#2206

> "aminer"  wrote in message news:lj49nu$ena$1@news.albasani.net... Hello,
> A concurrent waitfree FIFO queue version 1.0
> Authors: Christopher Michael Thomasson and Amine Moulay Ramdane(author of 
> Object pascal code and SemaMonitor)

[...]

Ummm, exactly what code did I author with you?

Here is some of my work wrt queues and eventcounts:

http://dl.acm.org/citation.cfm?id=359076

https://software.intel.com/en-us/forums/topic/295834

https://groups.google.com/d/topic/comp.programming.threads/qoxirQbbs4A/discussion
(SenderX is me)


https://groups.google.com/d/msg/lock-free/acjQ3-89abE/idSNj77HsIIJ

http://pastebin.com/mtCh5Zxu


You need to be more precise when using my name and/or my work?


Please?

:^/ 

[toc] | [prev] | [next] | [standalone]

#2207

Hello,

It's your waitfree FIFO queue that uses the bakery algorithm
that you have giving me a long time ago...

I have wrote it in Object pascal and added my SemaMonitor to the code so 
that it block wait when there is no items in the queue.



Thank you,
Amine Moulay Ramdane.




On 4/21/2014 4:48 PM, Chris M. Thomasson wrote:
>> "aminer"  wrote in message news:lj49nu$ena$1@news.albasani.net... Hello,
>> A concurrent waitfree FIFO queue version 1.0
>> Authors: Christopher Michael Thomasson and Amine Moulay Ramdane(author
>> of Object pascal code and SemaMonitor)
>
> [...]
>
> Ummm, exactly what code did I author with you?
>
> Here is some of my work wrt queues and eventcounts:
>
> http://dl.acm.org/citation.cfm?id=359076
>
> https://software.intel.com/en-us/forums/topic/295834
>
> https://groups.google.com/d/topic/comp.programming.threads/qoxirQbbs4A/discussion
>
> (SenderX is me)
>
>
> https://groups.google.com/d/msg/lock-free/acjQ3-89abE/idSNj77HsIIJ
>
> http://pastebin.com/mtCh5Zxu
>
>
> You need to be more precise when using my name and/or my work?
>
>
> Please?
>
> :^/

[toc] | [prev] | [next] | [standalone]

#2209

> "aminer"  wrote in message news:lj4b05$gg6$1@news.albasani.net... 
> It's your waitfree FIFO queue that uses the bakery algorithm
> that you have giving me a long time ago...
> I have wrote it in Object pascal and added my SemaMonitor to the code so 
> that it block wait when there is no items in the queue.

Okay. Anyway, thank you for giving it a try animer.

:^)

[toc] | [prev] | [next] | [standalone]

#2210

On 4/21/2014 4:54 PM, Chris M. Thomasson wrote:
>> "aminer"  wrote in message news:lj4b05$gg6$1@news.albasani.net... It's
>> your waitfree FIFO queue that uses the bakery algorithm
>> that you have giving me a long time ago...
>> I have wrote it in Object pascal and added my SemaMonitor to the code
>> so that it block wait when there is no items in the queue.
>
> Okay. Anyway, thank you for giving it a try animer.
>
> :^)


Every struct inside the array is the size of a cache-line and the array 
is 64 bytes aligned and there is cache padding between the head variable 
and the tail variable so i think that there is no
false-sharing and i have done it in Object pascal.


Thank you,
Amine Moulay Ramdane,

[toc] | [prev] | [next] | [standalone]

#2208

"Chris M. Thomasson"  wrote in message 
news:lj4apa$o7v$1@speranza.aioe.org...
[...]

> Ummm, exactly what code did I author with you?

> Here is some of my work wrt queues and eventcounts:

> http://dl.acm.org/citation.cfm?id=359076

To be more precise, I did not work on that paper!

I just thought it was a great idea for a general
purpose conditional waiting mechanism for
lock/wait/obstruction-free algorithms...

[toc] | [prev] | [standalone]

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

csiph-web