Sciweavers

12453 search results - page 31 / 2491
» Concurrent Data Structures
Sort
View
USENIX
2003
15 years 1 months ago
Using Read-Copy-Update Techniques for System V IPC in the Linux 2.5 Kernel
Read-copy update (RCU) allows lock-free read-only access to data structures that are concurrently modified on SMP systems. Despite the concurrent modifications, read-only access...
Andrea Arcangeli, Mingming Cao, Paul E. McKenney, ...
PPOPP
2012
ACM
13 years 7 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ECOOPWEXCEPTION
2000
Springer
15 years 4 months ago
Action-Oriented Exception Handling in Cooperative and Competitive Concurrent Object-Oriented Systems
The chief aim of this survey is to discuss exception handling models which have been developed for concurrent object systems. In conducting this discussion we rely on the following...
Alexander B. Romanovsky, Jörg Kienzle
DSD
2005
IEEE
116views Hardware» more  DSD 2005»
15 years 5 months ago
Optimization of a Bus-based Test Data Transportation Mechanism in System-on-Chip
The increasing amount of test data needed to test SOC (System-on-Chip) entails efficient design of the TAM (test access mechanism), which is used to transport test data inside the...
Anders Larsson, Erik Larsson, Petru Eles, Zebo Pen...
PVLDB
2010
190views more  PVLDB 2010»
14 years 6 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu