Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Mirage: a coherent distributed shared memory design
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Project Oberon: the design of an operating system and compiler
Project Oberon: the design of an operating system and compiler
The Mungi single-address-space operating system
Software—Practice & Experience - Special issue on multiprocessor operating systems
Understanding transactions in the operating in the operating system context
EW 4 Proceedings of the 4th workshop on ACM SIGOPS European workshop
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Providing Persistent Objects in Distributed Systems
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
The Aleph Toolkit: Support for Scalable Distributed Shared Objects
CANPC '99 Proceedings of the Third International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
PerDiS: Design, Implementation, and Use of a PERsistent DIstributed Store
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Optimistic Synchronization and Transactional Consistency
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
TreadMarks: distributed shared memory on standard workstations and operating systems
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Implicit and explicit transactions in a distributed transactional memory system
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
| Hi-index | 0.00 |
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional operating systems are complex and difficult to program. As an alternative the distributed memory idea simplifies and unifies memory access, but performance drawbacks caused by expensive distributed locking mechanisms obviated this approach for cluster computing. To avoid these slowdowns more and more weak consistency models try to avoid these slowdowns by burdening the programmer with explicit synchronization. Our research group has developed a fast transaction system for a distributed heap that guarantees semantically correct access to shared memory.