Results 1 - 10 of 2,189

Transactional Memory: Architectural Support for Lock-Free Data Structures

by Maurice Herlihy, J. Eliot B. Moss
"... A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems asso ..."
Abstract - Cited by 1031 (27 self) - Add to MetaCart
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems

Transactional Locking II

by Dave Dice, Ori Shalev, Nir Shavit - In Proc. of the 20th Intl. Symp. on Distributed Computing , 2006
"... Abstract. The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit-ti ..."
Abstract - Cited by 359 (17 self) - Add to MetaCart
better than) that of all former STM algorithms, both lock-based and non-blocking. Perhaps more importantly, on various benchmarks, TL2 delivers performance that is competitive with the best hand-crafted fine-grained concurrent structures. Specifically, it is ten-fold faster than a single lock. We believe

Software transactional memory for dynamic-sized data structures

by Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III - IN PROCEEDINGS OF THE 22ND ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING , 2003
"... We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocking property we consider is obstruction-freedom. Obstruction-freedom is weaker than lock-freedom; as a result, it admits s ..."
Abstract - Cited by 432 (25 self) - Add to MetaCart
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocking property we consider is obstruction-freedom. Obstruction-freedom is weaker than lock-freedom; as a result, it admits

Concurrency Control in Groupware Systems

by C. A. Ellis, S. J. Gibbs - ACM SIGMOD Record , 1989
"... Abstract. Groupware systems are computer-based systems that support two or more users engaged in a common task, and that provide an interface to a shared environment. These systems frequently require fine-granularity sharing of data and fast response times. This paper distinguishes real-time groupwa ..."
Abstract - Cited by 373 (0 self) - Add to MetaCart
-rectly on the data without obtaining locks. The algorithm must know some semantics of the operations. However the algorithm’s overall structure is independent of the semantic information, allowing the algorithm to be adapted to many situations. An example application of the algorithm to group text editing is given

Conserved Omp85 lid-lock structure and substrate recognition in FhaC

by Timm Maier, Bernard Clantin, Fabian Gruss, Anne-sophie Delattre
"... Omp85 proteins mediate translocation of polypeptide substrates across and into cellular membranes. They share a common architecture comprising substrate-interacting POTRA domains, a C-terminal 16-stranded b-barrel pore and two signature motifs located on the inner barrel wall and at the tip of the e ..."
Abstract - Add to MetaCart
C, in which the two signature motifs interact tightly and form the conserved ‘lid lock’. Reanalysis of previous structural data shows that L6 adopts the same, conserved resting state position in all available Omp85 structures. The FhaC variant structure further reveals a competitive mechanism

A Methodology for Implementing Highly Concurrent Data Objects

by Maurice Herlihy , 1993
"... A concurrent object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on critical sections: ensuring that only one process at a time can operate on the object. Nevertheless, critical sections are poorly suited for asynchro ..."
Abstract - Cited by 350 (10 self) - Add to MetaCart
A concurrent object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on critical sections: ensuring that only one process at a time can operate on the object. Nevertheless, critical sections are poorly suited

Research Article 2.4 GHz CMOS Power Amplifier with Mode-Locking Structure to Enhance Gain

by Changhyun Lee , Changkun Park
"... We propose a mode-locking method optimized for the cascode structure of an RF CMOS power amplifier. To maximize the advantage of the typical mode-locking method in the cascode structure, the input of the cross-coupled transistor is modified from that of a typical mode-locking structure. To prove th ..."
Abstract - Add to MetaCart
We propose a mode-locking method optimized for the cascode structure of an RF CMOS power amplifier. To maximize the advantage of the typical mode-locking method in the cascode structure, the input of the cross-coupled transistor is modified from that of a typical mode-locking structure. To prove

A Unified Characterization of Nonunique Response in Elastic/Perfectly-Plastic and Elastic/Locking Structures Using Constraint Qualifications

by J. R. Jagannatha Rao, Robert Bradlaw - Intl. J. of Solids and Structures , 1995
"... Mathematical programming methods have traditionally been used extensively in the analysis and design of elastic/plastic structures. However, some of the recent results from parametric nonlinear programming have not been fully exploited in mechanical applications, particularly those relating to the c ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
out that the response can be characterized as being unique or nonunique depending on the satisfaction of the linear independence or the Mangasarian-Fromovitz constraint qualification. A completely analogous result is then also derived for elastic/locking structures, thus indicating the usefulness

Frangipani: A Scalable Distributed File System

by Chandramohan A. Thekkath, Timothy Mann, Edward K. Lee
"... The ideal distributed file system would provide all its users with coherent, shared access to the same set of files,yet would be arbitrarily scalable to provide more storage space and higher performance to a growing user community. It would be highly available in spite of component failures. It woul ..."
Abstract - Cited by 320 (1 self) - Add to MetaCart
. It would require minimal human administration, and administration would not become more complex as more components were added. Frangipani is a new file system that approximates this ideal, yet was relatively easy to build because of its two-layer structure. The lower layer is Petal (described in an earlier

Locks

by unknown authors
"... From the introduction to concurrency, we saw one of the fundamen-tal problems in concurrent programming: we would like to execute a series of instructions atomically, but due to the presence of interrupts on a single processor (or multiple threads executing on multiple pro-cessors concurrently), we ..."
Abstract - Add to MetaCart
. 27.1 Locks: The Basic Idea As an example, assume our critical section looks like this, the canonical update of a shared variable: balance = balance + 1; Of course, other critical sections are possible, such as adding an element to a linked list or other more complex updates to shared structures
Results 1 - 10 of 2,189