Untitled Document
   
You are from : ( )  
     
Untitled Document
Untitled Document
 

International Journal of Information Technology & Computer Science ( IJITCS )

Abstract :

Layers can be applied on various longrunning transactions in transactional systems to facilitate both the design and analysis of these systems. These workflows are known as Long Running Transactions, which have critical requirements that range from highly obtainable and reliable to secure and protected [1]. Information trustworthiness in long-running transactions (workflows) is safeguarded utilizing remunerations, that is, exercises expressly customized to dispense with the impacts of a procedure ended by
a client or that neglected to finish because of an alternate reason. Long-running transactions comprise of tasks, which may be executed successively and in parallel, may hold sub assignments, and may require to be finished before a due date. In this paper, the analyst depicts issues that may bring on by long running transaction results and how they relate i.e. problems, solutions and the relationship..

Keywords :

: pseudo-asynchronous, Availability, Atomicity, consistency, service-oriented, Batch Processing and Protocol.

References :

  1. ACOSTA, 2013. Global engineering: design, decision  making, and communication. 18 ed. Boca Raton: CRC Press.
  2. Anon.,2004.OASIS .[Online] Available at: https://www.oasisopen. org/committees/tc_home.php?wg_abbrev=businesstransaction [Accessed 11 NOVEMBER 2009].
  3. Apt, K., 2008. Formal justification of a proof system for communicating sequential processes. Sequential Processes, 12 4, pp. 23-99.
  4. Butler, M., 2004. Modelling and analysis of long running transactions.[Online] Available at: http://users.ecs.soton.ac.uk/mjb/malt.html [Accessed 5 4 2011].
  5. FRANCESCHETTI, 2006. Wireless networks from the physical layer to communication, computing, sensing, and control. 18 ed. Burlington, MA: Academic Press.
  6. Francez, 2009. Decomposition of distributed programs into communication closed layers. 19 ed. New York: Cambridge University Press.
  7. Francez, N., 2013. Semantics of nondeterminism, concurrency and communication. 19 ed. London: Cambridge University Press.
  8. Hoare, 2005. A trace semantics for long-running transactions.[Online]Available at: http://eprints.soton.ac.uk/id/eprint/260080[Accessed 27 MARCH 2014].
  9. Janssen, 2008. Specifying and proving communication closedness in protocols. In: 12, ed. Technical Report. Washingto  DC: Cambridge University Press, pp. 23-93.
  10. Microsystems, S., 2011. Developer. [Online] Available at: http://java.sun.com/developer/technicalArticles/WebServices/high perfomance [Accessed 4 6 2013].
  11. Milner, R., 2012. A Calculus for Communicating Processes. 3 ed. Berlin : 92Springer.
  12. Misra, J., 2011. Proofs of networks of processes. London, IEEE Trans.
  13. Papazoglou, 2003. Service-Oriented Computing. oncepts, Characteristic and Directions, 03(2003), pp. 4-13.
  14. Schneider, F., 2011. Synchronization in distributed programs. 4 ed. New York: ACM-TOPLAS.
  15. Soa, 2001. SOA WORLD. [Online] Available at: http://soa.sys-con.com/node/318438 [Accessed 4 March 2005].

Untitled Document
     
Untitled Document
   
  Copyright © 2013 IJITCS.  All rights reserved. IISRC® is a registered trademark of IJITCS Properties.