Subj : Re: Reader Writer Puzzle
To   : comp.programming.threads
From : Chris Thomasson
Date : Wed Jun 15 2005 02:38 am


<bonnie.caballero@ktd-kyocera.com> wrote in message 
news:1118786355.962161.325580@z14g2000cwz.googlegroups.com...
> Can we start with a simple solution using semaphores, mutexes or
> read-write locks?  Then maybe we can look at more advanced approaches.


Spread out your shared collection over multiple buckets that are protected 
with their own fath-pathed rw-lock:


Bucket1 -> ListHead -> NodeA -> NodeB -> Bucket2

Bucket2 -> ListHead -> NodeC -> NodeD -> Bucket3

Bucket3 -> ListHead -> NodeE -> NodeF -> Bucket4

Bucket4 -> ListHead -> NodeG -> NodeH -> Bucket5

Bucket5 -> ListHead -> NodeI -> NodeJ -> Bucket1



You can simulate concurrent reads and writes this way.

.