© Andy Wellings, 2004 Readers/Writers Problem I  Many reader threads and many writer threads are attempting to access an object encapsulating a large data structure  Readers can read concurrently, as they do not alter the data  Writers require mutual exclusion over the data both from other writers and from readers  There are different variations on this scheme; the one considered here is where priority is always given to waiting writers  Hence, as soon as a writer is available, all new readers will be blocked until all writers have finished  Of course, in extreme situations this may lead to starvation of readers
{}