An extended scheduling mechanism for nested transactions

Author

Humm, Bernhard G.

Author_Institution

Dept. of Comput. Sci., Wollongong Univ., NSW, Australia

fYear

1993

fDate

9-10 Dec 1993

Firstpage

125

Lastpage

134

Abstract

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

Keywords

concurrency control; distributed databases; scheduling; transaction processing; extended scheduling mechanism; implementation; implementation-independent; nested transactions; non-leaf transactions; object data; performance; threads within transactions; Australia; Computer science; Concurrent computing; Frequency selective surfaces; Object oriented modeling; Processor scheduling; Rail to rail inputs; Telecommunications; Utility programs; Yarn;

fLanguage

English

Publisher

ieee

Conference_Titel

Object Orientation in Operating Systems, 1993., Proceedings of the Third International Workshop on

Conference_Location

Asheville, NC

Print_ISBN

0-8186-5270-5

Type

conf

DOI

10.1109/IWOOOS.1993.324920

Filename

324920