Filters








2,143 Hits in 4.8 sec

Concurrent operations on B∗-trees with overtaking

Yehoshua Sagiv
1986 Journal of computer and system sciences (Print)  
Several papers [2, 3, 7, 8, 10, 121 have described how to perform concurrent operations on B-trees.  ...  First, we show that there is no need to prevent one updater from overtaking another on the way up (at ' [3] gives both top-down and bottom-up solutions. 3 In practice many implementations of B-trees  ... 
doi:10.1016/0022-0000(86)90021-8 fatcat:kje7htemirct7a5ddnscupuqbq

A New Method for Concurrency in B-Trees

Yat-Sang Kwong, D. Wood
1982 IEEE Transactions on Software Engineering  
In this paper we study the problem of supporting concurrent operations in B-trees and their variants.  ...  A new solution with a greater degree of concurrency is proposed. As solutions are surveyed or presented we identify useful techniques which have wider applicability.  ...  The idea of bulk merging in the discussion on intranodal concurrency was suggested by the referee.  ... 
doi:10.1109/tse.1982.235251 fatcat:qxavw7b3mbhs5j5abz4nr4olda

Performance of B-tree concurrency control algorithms

V. Srinivasan, Michael J. Carey
1991 Proceedings of the 1991 ACM SIGMOD international conference on Management of data - SIGMOD '91  
In this article, we study the performance of various B+-tree concurrency control algorithms using a detailed simulation model of B +-tree operations in a centralized DBMS.  ...  In addition, based on the performance of the set of B +-tree concurrency control algorithms, which includes one new algorithm, we make projections regarding the performance of other algorithms in the literature  ...  Seshadri for their constructive comments on a preliminary version of this article; and the anonymous referees for suggesting changes that have improved the presentation significantly.  ... 
doi:10.1145/115790.115860 dblp:conf/sigmod/SrinivasanC91 fatcat:un4uazqjx5dzfffkqg5jitczie

Performance of B+ tree concurrency control algorithms

V. Srinivasan, Michael J. Carey
1993 The VLDB journal  
In this article, we study the performance of various B+-tree concurrency control algorithms using a detailed simulation model of B +-tree operations in a centralized DBMS.  ...  In addition, based on the performance of the set of B +-tree concurrency control algorithms, which includes one new algorithm, we make projections regarding the performance of other algorithms in the literature  ...  Seshadri for their constructive comments on a preliminary version of this article; and the anonymous referees for suggesting changes that have improved the presentation significantly.  ... 
doi:10.1007/bf01263046 fatcat:icjktvowdzhrnm54qruiwv5ovy

Performance of B-tree concurrency control algorithms

V. Srinivasan, Michael J. Carey
1991 SIGMOD record  
In this article, we study the performance of various B+-tree concurrency control algorithms using a detailed simulation model of B +-tree operations in a centralized DBMS.  ...  In addition, based on the performance of the set of B +-tree concurrency control algorithms, which includes one new algorithm, we make projections regarding the performance of other algorithms in the literature  ...  Seshadri for their constructive comments on a preliminary version of this article; and the anonymous referees for suggesting changes that have improved the presentation significantly.  ... 
doi:10.1145/119995.115860 fatcat:fyfddw2m5vesrlsin5wpsjzfbi

Page 2087 of Mathematical Reviews Vol. , Issue 88d [page]

1988 Mathematical Reviews  
(IL-HEBR-C) Concurrent operations on B*-trees with overtaking.  ...  Summary: “Algorithms for concurrent operations (i.e., searches, insertions, and deletions) on B*-trees are presented. These algo- rithms improve those given by P. L. Lehman and S. B. Yao [ACM Trans.  ... 

Distributed queues in shared memory

Andreas Haas, Michael Lippautz, Thomas A. Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, Ali Sezgin
2013 Proceedings of the ACM International Conference on Computing Frontiers - CF '13  
DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior.  ...  We present distributed queues (DQ), a new family of relaxed concurrent queue implementations.  ...  ACKNOWLEDGEMENTS This work has been supported by the European Research Council advanced grant on Quantitative Reactive Modeling (QUAREM) and the National Research Network RiSE on Rigorous Systems Engineering  ... 
doi:10.1145/2482767.2482789 dblp:conf/cf/HaasLHPSKS13 fatcat:w524ibkngffwfb5yurwlfwqtjm

Parallel Event Detection in Active Database Systems: The Heart of the Matter [chapter]

Ulrike Jaeger, Johann K. Obermaier
1998 Lecture Notes in Computer Science  
an emphasis on composite event detection by operator graphs.  ...  The semantics of query execution is set oriented, whereas composite event detection bases on open streams of events.  ...  Acknowledgments The authors would like to thank Johann-Christoph Freytag for many useful comments on the presentation of the paper.  ... 
doi:10.1007/3-540-49151-1_9 fatcat:6n37zesjzneddgmm5bj7ptfov4

Real-time index concurrency control

J.R. Haritsa, S. Seshadri
2000 IEEE Transactions on Knowledge and Data Engineering  
In contrast, the earlier studies modeled "tree" transactions wherein each transaction performs only a single B-tree operation (search or update).  ...  Project Overview Commercial database systems typically use B+-tree indexing [3] as the preferred access method to efficiently locate data items on disk.  ...  If the leaf is unsafe, the update operation is restarted from the index root, using SIX locks for the descent. Another class of index concurrency control algorithms is based on B-link trees.  ... 
doi:10.1109/69.846294 fatcat:zrxq3j4ovbh5tpuwwzfllu3nsq

Real-time index concurrency control

Jayant R. Haritsa, S. Seshadri
1996 SIGMOD record  
In contrast, the earlier studies modeled "tree" transactions wherein each transaction performs only a single B-tree operation (search or update).  ...  Project Overview Commercial database systems typically use B+-tree indexing [3] as the preferred access method to efficiently locate data items on disk.  ...  If the leaf is unsafe, the update operation is restarted from the index root, using SIX locks for the descent. Another class of index concurrency control algorithms is based on B-link trees.  ... 
doi:10.1145/381854.381870 fatcat:qv63fglb75f7rkkmbxfwj74xym

Fast and Scalable, Lock-Free k-FIFO Queues [chapter]

Christoph M. Kirsch, Michael Lippautz, Hannes Payer
2013 Lecture Notes in Computer Science  
We introduce fast and scalable algorithms that implement boundedand unbounded-size lock-free k-FIFO queues on parallel, shared memory hardware.  ...  The presented algorithms enable up to k enqueue and k dequeue operations to be performed in parallel.  ...  This work has been supported by the National Research Network RiSE on Rigorous Systems Engineering (Austrian Science Fund S11404-N23).  ... 
doi:10.1007/978-3-642-39958-9_18 fatcat:ws5nz2s7uzhsthkno4key2fqxa

Model checking of finite-state machine-based scenario-aware dataflow using timed automata

Mladen Skelin, Erik Ramsgaard Wognsen, Mads Chr. Olesen, Rene Rydhof Hansen, Kim Guldstrand Larsen
2015 10th IEEE International Symposium on Industrial Embedded Systems (SIES)  
We demonstrate our approach on a realistic case study from the multimedia domain.  ...  An important distinction is between static and dynamic formalisms, the latter allowing for the workload to change on-the-fly.  ...  B. Overtaking Problem and Determinacy The operational semantics of Section III-A allows simultaneous executions of a particular kernel, i.e. auto-concurrency.  ... 
doi:10.1109/sies.2015.7185065 dblp:conf/sies/SkelinWOHL15 fatcat:cqladiqrdjcv7bx2cocef4y5sm

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

Daniel Ohene-Kwofie, E. J. Otoo, Gideon Nimako
2014 EAI Endorsed Transactions on Scalable Information Systems  
However, most of the concurrency control mechanism associated with the index structures of these memory resident databases do not scale well, under high transaction rates.  ...  Multi-threaded concurrent manipulation of the O2-Tree outperforms popular NoSQL based key-value stores considered in this paper.  ...  Acknowledgements This work was supported with funding from the Centre For High Performance Computing (CHPC), and the Department of Science and Technology (DST), South Africa.  ... 
doi:10.4108/sis.1.3.e6 fatcat:m4uw3w4ds5dh7cakdnkojxnlkm

A Study of Shared-Memory Mutual Exclusion Protocols Using CADP [chapter]

Radu Mateescu, Wendelin Serwe
2010 Lecture Notes in Computer Science  
In this paper, we report on experiments with the performance evaluation of mutual exclusion protocols using Interactive Markov Chains.  ...  Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurrent non-atomic accesses  ...  Concurrent processes communicate and synchronize only by means of atomic read/write operations on shared variables.  ... 
doi:10.1007/978-3-642-15898-8_12 fatcat:2h52dws6efdnxjedsfwoerc2da

Algorithms for search trees on message passing architectures

A. Colbrook, E.A. Brewer, C.N. Dellarocas, W.E. Weihl
1996 IEEE Transactions on Parallel and Distributed Systems  
Acknowledgments We thank Anant Agarwal, Wilson Hsith, Anthony Joseph and Sharon Perl for their comments and suggestions on this work.  ...  Associated with the contention issue is the problem of process overtaking.  ...  concurrently executing on the data structure.  ... 
doi:10.1109/71.485500 fatcat:xxishzhkmrdurpm7djxcqnzigq
« Previous Showing results 1 — 15 out of 2,143 results