Sciweavers

48 search results - page 2 / 10
» Key Range Locking Strategies for Improved Concurrency
Sort
View
IROS
2009
IEEE
120views Robotics» more  IROS 2009»
14 years 2 months ago
Concurrent tree traversals for improved mission performance under limited communication range
— In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded o...
Alejandro R. Mosteo, Luis Montano
IEEEPACT
2007
IEEE
14 years 1 months ago
Component-Based Lock Allocation
The allocation of lock objects to critical sections in concurrent programs affects both performance and correctness. Recent work explores automatic lock allocation, aiming primari...
Richard L. Halpert, Christopher J. F. Pickett, Cla...
SPAA
2009
ACM
14 years 8 months ago
Scalable reader-writer locks
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
Yossi Lev, Victor Luchangco, Marek Olszewski
IS
2000
13 years 7 months ago
Concurrency control in mobile distributed real-time database systems
Abstract With the rapid advances in mobile computing technology, there is an increasing demand for processing realtime transactions in a mobile environment. This paper studies con...
Kam-yiu Lam, Tei-Wei Kuo, Wai-Hung Tsang, Gary C. ...
EUROSYS
2007
ACM
14 years 4 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek