In: Jiannong Cao, Laurence T. Yang, Minyi Guo, et al. (Eds.): Lecture Notes in Computer Science, Vol. 3358: Parallel and Distributed Processing and Applications: Second International Symposium, ISPA 2004, Hong Kong, China, December 13-15, 2004, pages 499-508. Springer-Verlag, 2004.
Abstract: Transaction processing in Grid is to ensure reliable execution of inherently distributed Grid applications. This paper proposes coordination algorithms for handling short-lived and long-lived Grid transactions, models and analyzes these algorithms with the Petri net. The cohesion transaction can coordinate long-lived business Grid applications by automatically generating and executing compensation transactions to semantically undo committed sub-transactions. From analysis of the reachability tree, we show that the Petri net models of above algorithms are bounded and L1-live. This demonstrates that transactional Grid applications can be realized by the proposed algorithms effectively.