Petri-Net-Based coordination algorithms for grid transactions

Authors:
Feilong Tang;Minglu Li;Joshua Zhexue Huang;Cho-Li Wang;Zongwei Luo
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;E-Business Technology Institute, The University of Hong Kong, China;Department of Computer Science, The University of Hong Kong, China;E-Business Technology Institute, The University of Hong Kong, China
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 9
Cited 2

Petri Nets

ACM Computing Surveys (CSUR)
The Petri net as a modeling tool

ACM-SE 14 Proceedings of the 14th annual Southeast regional conference
Petri net modeling of gate and interconnect delays for power estimation

Proceedings of the 39th annual Design Automation Conference
Overview of multidatabase transaction management

The VLDB Journal — The International Journal on Very Large Data Bases
Grid Services for Distributed System Integration

Computer
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems

SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
Real-time transaction processing for autonomic Grid applications

Engineering Applications of Artificial Intelligence

Modeling and analysis for grid service cooperative scheduling based on Petri nets

CDVE'07 Proceedings of the 4th international conference on Cooperative design, visualization, and engineering
Radio frequency identification (RFID) based reliable applications for enterprise grid

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transaction proceesing 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.