An approach to efficient distributed transactions

This paper discusses the main features of a distributed transactional system with a high degree of efficiency. The possibility of increasing concurrency both among the various processes of one transaction, through a somewhat novel version of the well-known two-phase commit protocol and among different transactions, through a mechanism of object dynamic allocation which allows lock release before of transaction completion, is explored. An approach to a nesting mechanism, exploiting the capabilitities offered by the outlined object manipulation algorithm, is also proposed.