Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #5187
| Newsgroups | comp.programming.threads |
|---|---|
| Date | 2019-09-18 11:36 -0700 |
| Message-ID | <03215f06-cec7-40ba-a59b-a88f0f0f2069@googlegroups.com> (permalink) |
| Subject | About dynamic race detectors in concurrent computing.. |
| From | aminer68@gmail.com |
Hello, About dynamic race detectors in concurrent computing.. There is two kind of dynamic race detectors with: 1- Happens-before relation - The first to be invented, due to Lamport, depends on actual thread interleavings - Serious runtime overhead - No false positives 2- Lockset analysis - Does not depend on thread interleavings - Simpler and more efficient - No false negatives Modern tools combine the Lockset and happens before analysis to achieve the benefits of both, examples: Intel Thread Checker, Sun ThreadAnalyser. Also read here about using Hardware Transactional Memory for Data Race Detection: http://web.eecs.umich.edu/~shangupt/publications/sgupta-ipdps09.pdf Thank you, Amine Moulay Ramdane.
Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread
About dynamic race detectors in concurrent computing.. aminer68@gmail.com - 2019-09-18 11:36 -0700
csiph-web