Timeline for answer to Issues due to independent concurrent writes to shared memory by Kevin Keane
Current License: CC BY-SA 3.0
Post Revisions
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2018 at 17:33 | comment | added | Kevin Keane | When programming, you have a number of rules of thumb to follow. One of them "only keep locks as short as possible". Keeping a lock longer than necessary is usually considered a bug. There are other possible bugs here, BTW: deadlocks and race conditions. A race condition means that you forgot to use a lock (such as in my example). A deadlock means that two locks interact with each other so that both (or more) processes can never reach the unlock, and are permanently blocked. | |
| Jan 23, 2018 at 5:28 | comment | added | Karthick | Thanks for your answer, What happens when process 2 tries to acquire the lock for long time. process 3 has to wait on the lock? does it decrease the performance of the system? | |
| Jan 23, 2018 at 1:26 | history | answered | Kevin Keane | CC BY-SA 3.0 |