| Related articles |
|---|
| compiling locks/ monitors arnabde03@gmail.com (Arnab De) (2009-11-11) |
| Re: compiling locks/ monitors felipeangriman@gmail.com (Felipe Angriman) (2009-11-13) |
| Re: compiling locks/ monitors rogers.email@gmail.com (Ian Rogers) (2009-11-13) |
| Re: compiling locks/ monitors andrew@tomazos.com (Andrew Tomazos) (2009-11-21) |
| From: | Arnab De <arnabde03@gmail.com> |
| Newsgroups: | comp.compilers |
| Date: | Wed, 11 Nov 2009 06:08:47 -0800 (PST) |
| Organization: | Compilers Central |
| Keywords: | parallel, code, question |
| Posted-Date: | 13 Nov 2009 00:49:13 EST |
Many modern high level languages like Java/ C# have locks/ monitors as
language level features. Hardwares typically have lower level
synchronization primitives like CAS. One can implement a spinlock
using CAS, but it is bad for performance as it busy-waits for the lock
to be released. Can anyone tell me how these locks/monitors are
typically and efficiently compiled? Can you cite any paper on this?
Thanks in advance,
Arnab
Return to the
comp.compilers page.
Search the
comp.compilers archives again.