| Document Date: 2011-10-04 10:23:38
Open Document File Size: 238,25 KBShare Result on Facebook
Company IBM / The star / / IndustryTerm highlyconcurrent algorithms / concurrent algorithms / linearizable fine-grained concurrent data-structure algorithms / concurrent set algorithms / optimistic algorithms / important concurrent algorithms / simpler algorithms / concurrent data-structure algorithms / data-structure algorithms / linearizable algorithms / individual candidate algorithms / fine-grained algorithms / multi-core hardware / candidate algorithms / search traversal / concurrent set algorithm / verification tool / / OperatingSystem L3 / / Person Martin Vechev / Eran Yahav / Greta Yorsh / / Position &&mp / =Head / Model / sentinel nodes Head / garbage collector / mp / head / programmer / / ProgrammingLanguage Promela / Java / / Technology candidate 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 / linearizable fine-grained concurrent data-structure algorithms / sequential consistency / 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