18 search results - page 4 / 4 » Closing the complexity gap between FCFS mutual exclusion and... |
ICC
2007
IEEE
14 years 15 days ago
2007
IEEE
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
STOC
1993
ACM
13 years 10 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
SMALLTALK
2007
Springer
14 years 8 days ago
2007
Springer
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...