Path: csiph.com!usenet.pasdenom.info!aioe.org!.POSTED!not-for-mail
From: Kaz Kylheku <kaz@kylheku.com>
Newsgroups: comp.programming.threads,comp.programming
Subject: Re: Please read again...
Followup-To: comp.programming
Date: Wed, 7 May 2014 01:47:29 +0000 (UTC)
Organization: Aioe.org NNTP Server
Lines: 13
Message-ID: <20140506184224.184@kylheku.com>
References: <lk9cte$7qf$1@news.albasani.net>
NNTP-Posting-Host: X+c6YNb3AaWMPA3YfA4opg.user.speranza.aioe.org
X-Complaints-To: abuse@aioe.org
User-Agent: slrn/pre1.0.0-18 (Linux)
X-Notice: Filtered by postfilter v. 0.8.2
Xref: csiph.com comp.programming.threads:2307 comp.programming:4377

On 2014-05-06, aminer <aminer@toto.net> wrote:
>
> Hello,
>
> Please read again about my new algorithm of a very fast concurrent FIFO 
> queue, i have just correted some typos, here it is:

What real-world application benefits from this?

How many percent faster is the overall performance of that application,
compared to using a slow reference FIFO implemenation?

Can you make some useful program run 10 to 15 percent faster with this?