Nicolas Haines, Darrell Kindred, J. Gregory Morrisett, Scott M. Nettles, and Jeannette M. Wing. Composing First-Class Transactions. ACM Trans. on Prog. Lang. and Systems, Short Communications, 16(6):1719--1736, 1994  Home/Search   Document Details and Download   Summary   Related Articles   Check

....has been determined (information smuggling) Transactional objects might not be aware of the intra transaction concurrency and hence won t guarantee consistent execution of concurrent operations. The same sort of transactions are also described in the CORBA transaction service specification [15] [16] describes a model called Multithreaded Transactions. A multithreaded transaction has precise semantics: Once a task (the main task) has started a transaction, it can fork new tasks that work on behalf of it to take advantage of concurrency. Before the main task can commit or abort the ....

....concurrent programming languages such as Ada, it is important to support concurrency inside a transaction in a natural way. In particular, the use of the concurrency constructs provided by the language should not be restricted inside a transaction, if possible. The multithreaded transaction model [16, 17] comes closest to what we need. One drawback however is that the only way of having concurrency inside a transaction is to start a transaction in one task, and then spawn new tasks inside the transaction. These spawned tasks must run to completion before the transaction can be committed. Creation ....

N. Haines, D. Kindred, J. G. Morrisett, S. M. Nettles, and J. M. Wing: "Composing First-Class Transactions". ACM Transactions on Programming Languages and Systems 16(6), pp. 1719 -- 1736, Nov 1994.

....caller when they are signalled by a thread inside the transaction. Any thread may decide to signal an exception with or without transaction abort. The Argus model proved to be very influential: several systems have been developed which rely on similar computational models, including Vinari ML [4] and Transactional Drago [5] Let us now analyse existing exception handling models in transactional systems. Classical transactional systems usually do not incorporate exception handling and use return error codes instead. There are many problems with this approach. Firstly, using return codes ....

N. Haines, D. Kindred, J.G. Morrisett, A.M. Nettles, J.M. Wing. Composing First-Class Transactions. ACM TOPLAS, 16, 6, 1994.

....it enter a transaction before attempting to interact with a database. The design permits transactions to nest, though our current implementation does not. We are also exploring extended semantics for combining transactions and threads in PM3, along the lines of the Venari transaction model for ML [36]. 3 Modula 3 also supports untraced references to storage allocated in a separate uncollected heap; untraced storage must be deallocated explicitly. INTERFACE Transaction; EXCEPTION TransactionInProgress; TransactionNotInProgress; TYPE T #: Public; Public = OBJECT METHODS begin( RAISES ....

HAINES,N.,KINDRED,D.,MORRISETT,J.G.,NETTLES,S.M., AND WING, J. M. Composing first-class transactions. ACM Trans. Program. Lang. Syst. 16, 6 (Nov. 1994), 1719--1736.

....an experiment to test whether a wide range of transaction models can be made available by providing a small set of primitives that can be composed to achieve the desired transactional behaviour. A wide range of existing transaction models can be built by composing independent features such as 1 [24]: ffl persistence 2 ffl undoability ffl visibility (of object s states) ffl execution stream (thread) Each feature can be supported by building blocks which can be customised simply and composed in various ways to define new kinds of transactions. This paper focuses on the customisable ....

N. Haines, D. Kindred, J. Morisset, S. M. Nettles, and J. M. Wing. "composing first-class transaction". to appear inACM Transactions on Programming Languages and Systems, 1996.

....support much the same persistence models provided here, as do many other persistent languages. We make no claim of novelty for our interface, our contribution comes in the implementation of a well tested interface in Java. Prior to this work, one of the authors participated in the Venari project [5], of which one goal was to provide transactions for Standard ML (SML) Elapsed CPU System Time Time Time Library Compiler (secs) secs) secs) java AWT Original 73.79 60.21 5.04 Modified 81.07 67.49 4.95 applet Original 5.21 3.34 1.02 Modified 5.40 3.58 1.09 java net Original 10.77 7.95 ....

....The next goal will be to support multiple transactions, the key hooks are already present for these, most of the remaining work lies in providing reader writer locks and in managing multiple write logs. Nested transactions are simple to implement using write logs, as shown by the Venari work [5]. These are all of the semantic features we expect to support. We also expect to perform more extensive performance measurements soon. This should help us better characterize the system and help us improve its performance. In particular, we expect better understand which of the possibilities ....

N. Haines, D. Kindred, J. G. Morrisett, S. M. Nettles, and J. M. Wing. Composing FirstClass Transactions. ACM Trans. on Prog. Lang. and Systems, Short Communications, 16(6):1719--1736, 1994.

....view that transactions should provide the ACID features [10] atomicity, consistency, isolation, and durability. In our initial design, we have kept the transaction model simple and standard and have concentrated on support for atomicity and support durability. In previous work (VenariML [11]) we explored a richer transaction model, including a variety of transaction nesting and concurrency models. Because the basic model and implementation strategy in Jest is similar to VenariML, should we wish, we expect to be able to extend our current system to support the more sophisticated ....

....a transaction begins, a unique identifier is generated. This identifier is used to associate the lock lists and logging information for a particular transaction. Furthermore, it can be associated with threads or thread groups in 6 order to implement skeins as described in previous work on Venari [11]. Finally, we can use the identifiers to link together a nested transaction together with its enclosing transaction. When a transaction ends, one of the following actions is performed: rollback to abort a transaction and undo any changes made during it or commit to make the effects of the ....

[Article contains additional citation context not shown here]

N. Haines, D. Kindred, J. G. Morrisett, S. M. Nettles, and J. M. Wing. Composing First-Class Transactions. ACM Trans. on Prog. Lang. and Systems, Short Communications, 16(6):1719--1736, 1994.

....528.61 454.31 40.42 Table 2: Compilation of Java libraries do many other persistent languages. We make no claim of novelty for our interface, our contribution comes in the implementation of a well tested interface in Java. Prior to this work, one of the authors participated in the Venari project [5], of which one goal was to provide transactions for Standard ML (SML) A discussion of the low level aspects that system (called Sidney) can be found in Nettles [9] Not surprisingly, our current work draws strongly on this prior work. There are some key differences that arise from the different ....

....The next goal will be to support multiple transactions, the key hooks are already present for these, most of the remaining work lies in providing reader writer locks and in managing multiple writelogs. Nested transactions are simple to implement using write logs, as shown by the Venari work [5]. These are all of the semantic features we expect to support. We also expect to perform more extensive performance measurements. This should help us better characterize the system and help us improve its performance. In particular, we expect better understand which of the possibilities mentioned ....

N. Haines, D. Kindred, J. G. Morrisett, S. M. Nettles, and J. M. Wing. Composing First-Class Transactions. ACM Trans. on Prog. Lang. and Systems, Short Communications, 16(6):1719--1736, 1994.

No context found.

Nicolas Haines, Darrell Kindred, J. Gregory Morrisett, Scott M. Nettles, and Jeannette M. Wing. Composing First-Class Transactions. ACM Trans. on Prog. Lang. and Systems, Short Communications, 16(6):1719--1736, 1994

No context found.

N. Haines, D. Kindred, J. G. Morrisett, S. M. Nettles, and J. M. Wing. Composing first-class transactions. ACM Trans. Program. Lang. Syst., 16(6):1719--1736, 1994.

No context found.

N. Haines, D. Kindred, J. G. Morrisett, and S. M. Nettles, "Composing first-class transactions," ACM Transactions on Programming Languages and Systems, vol. 16, no. 6, pp. 1719--1736, November 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC