Results 1 - 10 of 371

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

Specification and analysis of system architecture using Rapide

by David C. Luckham, John J. Kenney, Larry M. Augustin, James Vera, Doug Bryan, Walter Mann - IEEE Transactions on Software Engineering , 1995
"... Rapide is an event-based concurrent, object-oriented language specifically designed for prototyping system architectures. Two principle design goals are (1) to provide constructs for defining executable prototypes of architectures, and (2) to adopt an execution model in which the concurrency, sync ..."
Abstract - Cited by 386 (4 self) - Add to MetaCart
. Various features of Rapide are illustrated by excerpts from a prototype of the X/Open distributed transaction processing reference architecture.

Compiler and Runtime Support for Efficient Software Transactional Memory

by Ali-reza Adl-tabatabai, Brian T. Lewis, Vijay Menon, Brian R. Murphy, Bratin Saha, Tatiana Shpeisman , 2006
"... Programmers have traditionally used locks to synchronize concurrent access to shared data. Lock-based synchronization, however, has well-known pitfalls: using locks for fine-grain synchronization and composing code that already uses locks are both difficult and prone to deadlock. Transactional memor ..."
Abstract - Cited by 159 (10 self) - Add to MetaCart
the door for new compiler optimizations that target the overheads of transactional memory. This paper presents compiler and runtime optimizations for transactional memory language constructs. We present a highperformance software transactional memory system (STM) integrated into a managed runtime

Synchronization in a Distributed Object System

by Natalija Krivokapic
"... . We describe the integration of a synchronization protocol in a distributed object system, in particular focusing on autonomous objects. To ensure intra-object serializability a locking-based scheme exploiting the semantics of operations is used. In our system the decision if a lock can be granted ..."
Abstract - Add to MetaCart
. We describe the integration of a synchronization protocol in a distributed object system, in particular focusing on autonomous objects. To ensure intra-object serializability a locking-based scheme exploiting the semantics of operations is used. In our system the decision if a lock can be granted

The impact of architectural trends on operating system performance

by Mendel Rosenblum, Edouard Bugnion, Stephen Alan Herrod, Emmett Witchel, Anoop Gupta - In Proceedings of the 15th ACM Symposium on Operating Systems Principles (SOSP) (Copper Mountain , 1995
"... Computer systems are rapidly changing. Over the next few years, we will see wide-scale deployment of dynamically-scheduled processors that can issue multiple instructions every clock cycle, execute instructions out of order, and overlap computation and cache misses. We also expect clock-rates to inc ..."
Abstract - Cited by 151 (8 self) - Add to MetaCart
operating system developers focus on kernel restructuring to reduce unnecessary communication. The paper presents a detailed decomposition of execution time (e.g., instruction execution time, memory stall time separately for instructions and data, synchronization time) for important kernel services

Distributed Transactions for Reliable Systems

by Alfred Z. Spector, Dean Daniels, Daniel Duchamp, Y Pausch - Carnegie-Mellon University , 1985
"... Facilities that support distributed transactions on user-defined types can be implemented efficiently and can simplify the construction of reliable distributed programs. To demonstrate these points, this paper describes a prototype transaction facility, called TABS, that supports objects, transparen ..."
Abstract - Cited by 24 (0 self) - Add to MetaCart
Facilities that support distributed transactions on user-defined types can be implemented efficiently and can simplify the construction of reliable distributed programs. To demonstrate these points, this paper describes a prototype transaction facility, called TABS, that supports objects

A transactional DSM Operating System in Java

by M. Schoettner, S. Traub, P. Schulthess - In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applicattions, Las , 1998
"... Distributed Shared Memory (DSM) is a well known interconnection paradigm in the scientific community. The development of distributed applications basing on message passing is more complex than on a DSM. The notorious performance drawbacks of DSM Systems are often caused by overly expensive distribut ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
distributed locking mechanisms. In response to this our Plurix Operating System (OS) implements a transaction based DSM. Memory consistency is maintained by atomic transactions and optimistic synchronization mechanisms which have been used in database technology in the past. Such a transaction based DSM would

A transactional DSM Operating System in Java

by Schoettner Traub And, M. Schoettner, S. Traub, P. Schulthess - In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applicattions, Las , 1998
"... Distributed Shared Memory (DSM) is a well known interconnection paradigm in the scientific community. The development of distributed applications basing on message passing is more complex than on a DSM. The notorious performance drawbacks of DSM Systems are often caused by overly expensive distribut ..."
Abstract - Add to MetaCart
distributed locking mechanisms. In re- sponse to this our Plurix Operating System (OS) implements a transaction based DSM. Memory consistency is maintained by atomic transactions and optimistic synchronization mechanisms which have been used in database technology in the past. Such a transaction based DSM

On Real-Time Transactions

by John A. Stankovic, Wei Zhao - ACM SIGMOD Record , 1988
"... Next generation real-time systems will require greater.flexibility and pre-dictability than is commonly found in today's systems. These future systems include the space station, integrated vision/robotics/AI systems, collections of humans/robots coordinating to achieve common objectives (usuall ..."
Abstract - Cited by 80 (7 self) - Add to MetaCart
properties of trans-actions aid in the development of distributed systems. However, little work has been done in exploiting transactions in a real-time context. We have been at-tempting to categorize real-time data into classes depending on their time, synchronization, atomicity, and permanence properties

A Distributed Architecture for Transactions Synchronization in Distributed Database Systems

by Arun Kumar Yadav, Ajay Agarwal , 2010
"... Various concurrency control algorithms have been proposed for use in distributed database systems. But, the number of algorithms available for the distributed concurrency control, come into one of three basic classes: locking algorithms, Timestamp algorithms and optimistic (or certification) algori ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
) algorithms. In this paper we are presenting a Distributed Transaction Processing Model and an approach for concurrency control in distributed database systems. The analysis of our approach is a decomposition of the concurrency control problem into two major sub-problems: read-write and write
Results 1 - 10 of 371