Messages in this thread | ![/](/images/icornerl.gif) | | From | Martin Konold <> | Subject | Re: Lockless file reading | Date | Thu, 28 Aug 2003 11:13:59 +0200 |
| |
Am Thursday 28 August 2003 05:17 am schrieb Timo Sirainen:
Hi Timo,
> How about checksum[n] = data[n-1] ^ data[n]? That looks like it would
I propose you first make some benchmarks and try to figure out how big the actual overhead of locking really is. I can easily assume that your "solution" is actually slower than a simple mechanism/semaphore.
Regards, -- martin
Dipl.-Phys. Martin Konold e r f r a k o n Erlewein, Frank, Konold & Partner - Beratende Ingenieure und Physiker Nobelstrasse 15, 70569 Stuttgart, Germany fon: 0711 67400963, fax: 0711 67400959 email: martin.konold@erfrakon.de
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| ![\](/images/icornerr.gif) |