Merge pull request #403 from yugandharbandi/master

Added the mentioned cases for Reader-Writer problem

notes/计算机操作系统.md

@@ -456,6 +456,120 @@ void writer() {
         up(&data_mutex);
     }
 }
+```
+The first case may result Writer to starve. This case favous Writers i.e no writer, once added to the queue, shall be kept waiting longer than absolutely necessary(only when there are readers that entered the queue before the writer).
+
+
+
+
+```c
+int readcount, writecount;                   //(initial value = 0)
+semaphore rmutex, wmutex, readLock, resource; //(initial value = 1)
+
+//READER
+void reader() {
+<ENTRY Section>
+ down(&readLock);                 //  reader is trying to enter
+ down(&rmutex);                  //   lock to increase readcount
+  readcount++;                 
+  if (readcount == 1)          
+   down(&resource);              //if you are the first reader then lock  the resource
+ up(&rmutex);                  //release  for other readers
+ up(&readLock);                 //Done with trying to access the resource
+
+<CRITICAL Section>
+//reading is performed
+
+<EXIT Section>
+ down(&rmutex);                  //reserve exit section - avoids race condition with readers
+ readcount--;                 	  //indicate you're leaving
+  if (readcount == 0)          //checks if you are last reader leaving
+   up(&resource);              //if last, you must release the locked resource
+ up(&rmutex);                  //release exit section for other readers
+}
+
+
+//WRITER
+void writer() {
+  <ENTRY Section>
+  down(&wmutex);                  //reserve entry section for writers - avoids race conditions
+  writecount++;                //report yourself as a writer entering
+  if (writecount == 1)         //checks if you're first writer
+   down(&readLock);               //if you're first, then you must lock the readers out. Prevent them from trying to enter CS
+  up(&wmutex);                  //release entry section
+
+<CRITICAL Section>
+ down(&resource);                //reserve the resource for yourself - prevents other writers from simultaneously editing the shared resource
+  //writing is performed
+ up(&resource);                //release file
+
+<EXIT Section>
+  down(&wmutex);                  //reserve exit section
+  writecount--;                //indicate you're leaving
+  if (writecount == 0)         //checks if you're the last writer
+   up(&readLock);               //if you're last writer, you must unlock the readers. Allows them to try enter CS for reading
+  up(&wmutex);                  //release exit section
+}
+```
+
+We can observe that every reader is forced to acquire ReadLock. On the otherhand, writers doesn’t need to lock individually. Once the first writer locks the ReadLock, it will be released only when there is no writer left in the queue.
+
+
+From the both cases we observed that either reader or writer has to starve. Below solutionadds the constraint that no thread shall be allowed to starve; that is, the operation of obtaining a lock on the shared data will always terminate in a bounded amount of time.
+
+```c
+int readCount;                  // init to 0; number of readers currently accessing resource
+
+// all semaphores initialised to 1
+Semaphore resourceAccess;       // controls access (read/write) to the resource
+Semaphore readCountAccess;      // for syncing changes to shared variable readCount
+Semaphore serviceQueue;         // FAIRNESS: preserves ordering of requests (signaling must be FIFO)
+
+void writer()
+{ 
+    down(&serviceQueue);           // wait in line to be servicexs
+    // <ENTER>
+    down(&resourceAccess);         // request exclusive access to resource
+    // </ENTER>
+    up(&serviceQueue);           // let next in line be serviced
+    
+    // <WRITE>
+    writeResource();            // writing is performed
+    // </WRITE>
+    
+    // <EXIT>
+    up(&resourceAccess);         // release resource access for next reader/writer
+    // </EXIT>
+}
+
+
+void reader()
+{ 
+    down(&serviceQueue);           // wait in line to be serviced
+    down(&readCountAccess);        // request exclusive access to readCount
+    // <ENTER>
+    if (readCount == 0)         // if there are no readers already reading:
+        down(&resourceAccess);     // request resource access for readers (writers blocked)
+    readCount++;                // update count of active readers
+    // </ENTER>
+    up(&serviceQueue);           // let next in line be serviced
+    up(&readCountAccess);        // release access to readCount
+    
+    // <READ>
+    readResource();             // reading is performed
+    // </READ>
+    
+    down(&readCountAccess);        // request exclusive access to readCount
+    // <EXIT>
+    readCount--;                // update count of active readers
+    if (readCount == 0)         // if there are no readers left:
+        up(&resourceAccess);     // release resource access for all
+    // </EXIT>
+    up(&readCountAccess);        // release access to readCount
+}
+
+
+
 ```
 
 ### 2. 哲学家进餐问题