801 search results - page 1 / 161 » Minimal Locked Trees |
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
CASCON
2004
13 years 6 months ago
2004
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
IEEEPACT
2007
IEEE
13 years 11 months ago
2007
IEEE
The allocation of lock objects to critical sections in concurrent programs affects both performance and correctness. Recent work explores automatic lock allocation, aiming primari...
POPL
2007
ACM
14 years 5 months ago
2007
ACM
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...