Home page logo

fulldisclosure logo Full Disclosure mailing list archives

Re: [Code-Crunchers] a simple race condition and how you'd solve it
From: silky <michaelslists () gmail com>
Date: Fri, 3 Jul 2009 11:01:34 +1000

On Fri, Jul 3, 2009 at 10:25 AM, Gadi Evron<ge () linuxbox org> wrote:
A friend recently demonstrated on his blog a simple race condition he
encountered. He also challenged folks to solve the problem.


There's an interesting discussion in the comments which is worth a quick

Also, maybe someone here will come up with a cuter idea?

Posted my proposed solution in the comments, but will probably take a
while to be moderated.

Basically, you just need to check if you should still be computing,
and, at the end of computation, if your data is still "wanted".

Gadi Evron,
ge () linuxbox org 

Blog: http://gevron.livejournal.com/

noon silky

Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/

  By Date           By Thread  

Current thread:
[ Nmap | Sec Tools | Mailing Lists | Site News | About/Contact | Advertising | Privacy ]