Discuss the tradeoff between fairness and throughput of operations in the readers-writers problem. Propose a method for solving the readers-writers problem without causing starvation.

Throughput inside the readers-writers problem is expanded by using favoring a couple of readers in place of permitting a unmarried writer to exclusively access the shared values. Then again, favoring readers co. result in starvation for writers. The hunger the readers writers trouble may be averted through preserving timestamps related to waiting tactics. Whilst a creator is completed with its project, it might wake up the method that has been anticipating the longest duration. While a reader arrives and notices that another reader is having access to the database, then it would enter the important segment most effective if there are not any ready writers. These restrictions would guarantee equity.