Timeline for multithreading - waiting on a condition without using locks (c++11)
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2021 at 0:26 | comment | added | Jerry Jeremiah | What about a reader writer lock stackoverflow.com/questions/244316/reader-writer-locks-in-c stackoverflow.com/questions/31622059/… | |
| Jun 6, 2019 at 20:08 | comment | added | Alon Hershkovitz | @Blrfl a single lock makes a serial section and they all need to pass it one by one as far as i understand. i don't mind using a lock, i'm basically asking if there's a lock that doesn't induce serialization, that multiple threads can pass in parallel. | |
| Jun 3, 2019 at 2:31 | comment | added | Blrfl | How does using a lock lose the benefit of parallelism? If all of your threads are waiting for something to happen before proceeding (great use for a barrier, BTW), there's no parallelism to be lost because they're all idle anyway. | |
| Jun 2, 2019 at 21:32 | comment | added | rwong | Are you looking for a "barrier" instead? | |
| Jun 1, 2019 at 22:37 | history | edited | Deduplicator | edited tags | |
| Jun 1, 2019 at 15:44 | comment | added | Robert Harvey | Look up "Lock-Free Data Structures." See also the LMAX Disruptor. | |
| Jun 1, 2019 at 11:25 | review | Close votes | |||
| Jun 25, 2019 at 3:00 | |||||
| Jun 1, 2019 at 10:50 | review | First posts | |||
| Jun 2, 2019 at 8:48 | |||||
| Jun 1, 2019 at 10:49 | history | asked | Alon Hershkovitz | CC BY-SA 4.0 |