Improving OLTP concurrency through Early Lock Release Manos Athanassoulis† manos.athanassoulis@epfl.ch Ryan Johnson†‡ ryan.johnson@epfl.ch Anastasia Ailamaki† anastasia.ailamaki@epfl.ch Radu Stoica† radu.stoica@epfl.ch †Ecole Polytechnique Fédérale de Lausanne Data-Intensive and Applications Laboratory CH-1015, Lausanne ‡Carnegie Mellon University Pittsburgh, PA EPFL-REPORT-152158 ABSTRACT Since t
Regardless of the statistics, if you write code like this clearly you're balancing your program on a knife's edge. Sooner or later your program is apt to hit one of these four deadlock cases—perhaps due to new hardware your customer has purchased that you never used to test your software, or a context switch between two specific instructions resulting from a high-priority thread becoming runnable—
Lock-free programming is a challenge, not just because of the complexity of the task itself, but because of how difficult it can be to penetrate the subject in the first place. I was fortunate in that my first introduction to lock-free (also known as lockless) programming was Bruce Dawson’s excellent and comprehensive white paper, Lockless Programming Considerations. And like many, I’ve had the oc
In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency control ensures that correct results for concurrent operations are generated, while getting those results as quickly as possible. Computer systems, both software and hardware, consist of modules, or components. Each component is designed t
Keyword(s): Abstract: © A survey of B-tree locking techniques Goetz Graefe HP Laboratories HPL-2010-9 storage systems, databases, B-tree, indexes, concurrency control, locking B-trees have been ubiquitous in database management systems for several decades, and they are used in other storage systems as well. Their basic structure and basic operations are well and widely understood including search
To model concurrent activities. Assigning one thread to each activity can be a great simplification compared to multiplexing the states of multiple activities in a single thread. This is why most server software and embedded software is multithreaded. To use multiple CPU cores simultaneously for speeding up computations. This is why many High Performance Computing (HPC) applications are multithrea
A lock-free hash table is a double-edged sword. There are applications where it can provide a performance improvement that would be impossible to achieve otherwise. The downside is that it’s complicated. The first working lock-free hash table I heard about was written in Java by Dr. Cliff Click. He released the source code back in 2007 and gave a presentation about it at Google that same year. Whe
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く