File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Petri-net-based coordination algorithms for grid transactions

TitlePetri-net-based coordination algorithms for grid transactions
Authors
Issue Date2004
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3358, p. 499-508 How to Cite?
AbstractTransaction processing in Grid is to ensure reliable execution of inherently distributed Grid applications. This paper1 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. © Springer-Verlag Berlin Heidelberg 2004.
Persistent Identifierhttp://hdl.handle.net/10722/93347
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorTang, Fen_HK
dc.contributor.authorLi, Men_HK
dc.contributor.authorHuang, JZen_HK
dc.contributor.authorWang, CLen_HK
dc.contributor.authorLuo, Zen_HK
dc.date.accessioned2010-09-25T14:58:20Z-
dc.date.available2010-09-25T14:58:20Z-
dc.date.issued2004en_HK
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3358, p. 499-508en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93347-
dc.description.abstractTransaction processing in Grid is to ensure reliable execution of inherently distributed Grid applications. This paper1 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. © Springer-Verlag Berlin Heidelberg 2004.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_HK
dc.titlePetri-net-based coordination algorithms for grid transactionsen_HK
dc.typeArticleen_HK
dc.identifier.emailWang, CL:clwang@cs.hku.hken_HK
dc.identifier.authorityWang, CL=rp00183en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-35048817919en_HK
dc.identifier.hkuros149524en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-35048817919&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3358en_HK
dc.identifier.spage499en_HK
dc.identifier.epage508en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridTang, F=7201979841en_HK
dc.identifier.scopusauthoridLi, M=7405266116en_HK
dc.identifier.scopusauthoridHuang, JZ=8971389600en_HK
dc.identifier.scopusauthoridWang, CL=7501646188en_HK
dc.identifier.scopusauthoridLuo, Z=22433447600en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats