An extended scheduling mechanism for nested transactions

In this paper, an extension to Moss' scheduling mechanism for nested transactions is presented. The extended mechanism allows (1) non-leaf transactions to access object data, (2) ancestor and descendent transactions to execute concurrently, (3) threads within transactions to be created without creating subtransactions and (4) both transactional and nontransactional operations to be handled. The mechanism is described in an implementation-independent form and its properties are outlined. Rationales but no formal proof of its correctness are provided. The implementation and performance of the extended scheduling mechanism is discussed briefly.<
>