One Article Review
| Source |  CodingSec |
|---|---|
| Identifiant | 116873 |
| Date de publication | 2016-09-23 16:00:42 (vue: 2016-09-23 16:00:42) |
| Titre | How Synchronization is performed in Operating systems |
| Texte | The system consisting of cooperatingsequential processes or threads, all running asynchronously andpossiblysharing data. We illustrated this model with the producer-consumer problem,described how a bounded buffer could be used to enable processes to sharememory. Solution allows at most BUFFER.SIZE – 1 items in the buffer at the sametime. Suppose we want tomodify the algorithm to remedy this deficiency. Onepossibility is to add an integer variable counter, initialized to 0. counter isincremented every time we add a new item to the buffer and is decrementedevery time we remove one item from the buffer. The code for the producerprocess can be modified as follows: while (true) |
| Envoyé | Oui |
| Condensat | add algorithm all allows andpossiblysharing appeared asynchronously boundedâ buffer buffer can code coding consisting consumer cooperatingsequential could counter data decrementedevery deficiency described enable every first follows: from how illustrated initializedâ to integer isincremented item items model modified most new one onepossibility operating performed post problem processes producer producerprocess remedy running sametime security sharememory size solution suppose synchronization system systems threads time tomodify true used variable want weâ remove |
| Tags | |
| Stories | |
| Notes | |
| Move | 
|
L'article ne semble pas avoir été repris aprés sa publication.
L'article ne semble pas avoir été repris sur un précédent.