| Document Date: 2009-09-25 09:19:19
Open Document File Size: 158,55 KBShare Result on Facebook
Company IBM / / IndustryTerm reference counting algorithm / highlyconcurrent algorithms / concurrent algorithms / linearizable fine-grained concurrent data-structure algorithms / concurrent set algorithms / optimistic algorithms / particular algorithms / important concurrent algorithms / simpler algorithms / concurrent data-structure algorithms / data-structure algorithms / linearizable algorithms / highlyconcurrent optimistic algorithms / individual candidate algorithms / fine-grained algorithms / manual memory management / multi-core hardware / candidate algorithms / search traversal / automatic memory management / concurrent set algorithm / verification tool / / Person Martin Vechev / Eran Yahav / Greta Yorsh / / Position &&mp / =Head / collector / Model / reference counting collector / sentinel nodes Head / garbage collector / mp / mark and sweep collector / head / programmer / / ProgrammingLanguage Promela / Java / K / / Technology candidate algorithms / particular algorithms / individual candidate algorithms / concurrent algorithms / fine-grained algorithms / Java / set algorithm / concurrent data-structure algorithms / Memory Management This algorithm / data-structure algorithms / explored algorithms / concurrent set algorithm / concurrent set algorithms / important concurrent algorithms / reference counting algorithm / linearizable fine-grained concurrent data-structure algorithms / sequential consistency / highlyconcurrent optimistic algorithms / optimistic algorithms / highlyconcurrent algorithms / /
SocialTag |
Experience with Model Checking Linearizability Martin Vechev, Eran Yahav, and Greta Yorsh IBM T.J. Watson Research Center Non-blocking concurrent algorithms offer significant performance advantages, but are very difficul