The Experts below are selected from a list of 327 Experts worldwide ranked by ideXlab platform
Miroslav Popovic - One of the best experts on this subject based on the ideXlab platform.
-
ECBS - Formal Verification of Distributed Transaction Management in a SOA Based Control System
2011 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems, 2011Co-Authors: Ivana Popovic, Vladislav Vrtunski, Miroslav PopovicAbstract:In large scale, heavy workload systems, managing Distributed Transactions on multiple datasets becomes challenging and error prone task. Software systems based on service oriented architecture principles that manage critical infrastructures are typical environments where robust Transaction management is one of the essential goals to achieve. The aim of this paper is to provide a formal description of the solution for Transaction management and individual service component behavior in a SOA-based control system, and prove the correctness of the proposed design with the SMV formal verification tool. Atomic commitment protocol is used as a basis for solving Distributed Transaction management problem. SMV language and verification tool are utilized for formal description of the problem and verification of the necessary properties. The case study describes an application of the proposed approach in commercial software system for electrical power distribution management. Verification of given model properties has shown that suggested solution is suitable for the described class of SOA-based systems.
-
Formal verification of Distributed Transaction management in a SOA based control system
Proceedings - 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems ECBS 2011, 2011Co-Authors: Ivana Popovic, Vladislav Vrtunski, Miroslav PopovicAbstract:In large scale, heavy workload systems, managing Distributed Transactions on multiple datasets becomes challenging and error prone task. Software systems based on service oriented architecture principles that manage critical infrastructures are typical environments where robust Transaction management is one of the essential goals to achieve. The aim of this paper is to provide a formal description of the solution for Transaction management and individual service component behavior in a SOA-based control system, and prove the correctness of the proposed design with the SMV formal verification tool. Atomic commitment protocol is used as a basis for solving Distributed Transaction management problem. SMV language and verification tool are utilized for formal description of the problem and verification of the necessary properties. The case study describes an application of the proposed approach in commercial software system for electrical power distribution management. Verification of given model properties has shown that suggested solution is suitable for the described class of SOA-based systems.
Li Li - One of the best experts on this subject based on the ideXlab platform.
-
An Effective Deadlock Prevention Mechanism for Distributed Transaction Management
2011 Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2011Co-Authors: Feilong Tang, Yao Shen, Li LiAbstract:Recently there has been an increasingly use of SOA infrastructure. Most of business applications need the Transaction management to guarantee the system consistency, typically by resource locks. High availability and performance of resource managers are extremely critical for business services. Researches have shown that deadlock can be easily produced when multi-process try to access the shared resources if some basic synchronization mechanism is adopted. In addition, existing resource locking based two-phase commit protocol requires that each Transaction obtains all needed locks before the second commit phase. This locking mechanism may lead to potential deadlocks and can pose significant limitations on applications that need to share resources between Transactions. In this paper, we propose a novel solution, for Distributed Transaction services, utilizing the advanced replicas and timestamps mechanisms to prevent deadlocks. Our approach makes use of existing lock policies with replicas to solve guaranteed deadlocks and compares conservative locking and timestamps based restart policy for global Transaction deadlock prevention. Further, we also demonstrate that our approach significantly improves the performance for both serialization and deadlock prevention. Our experimental results show that no deadlock occurs after utilizing our prevention mechanisms. Finally, we also observe that timestamps based restart policy is more suitable for global resource allocation and outperforms over related solutions.
-
Transaction Management for Reliable Grid Applications
2009 International Conference on Advanced Information Networking and Applications, 2009Co-Authors: Feilong Tang, Minglu Li, Li LiAbstract:Transaction management in Grids is responsible for ensuring the reliable execution of inherently Distributed Grid applications. Grid Transaction management is different from existing Distributed Transaction models because Grid resources are highly autonomous, dynamic and heterogeneous. This paper proposes a Grid Transaction service (GridTS) and coordination algorithms that manage short-lived and long-lived Grid Transactions respectively, providing reliability support for Grid applications. Unlike existing long-lived Transaction models that require application programmers to develop compensating Transactions, the GridTS can automatically generate compensating Transactions during the execution of long-lived Grid Transactions. The feasibility of GridTS and the effectiveness of proposed coordination algorithms are demonstrated through simulation studies.
-
AINA - Transaction Management for Reliable Grid Applications
2009 International Conference on Advanced Information Networking and Applications, 2009Co-Authors: Feilong Tang, Minglu Li, Li LiAbstract:Transaction management in Grids is responsible for ensuring the reliable execution of inherently Distributed Grid applications. Grid Transaction management is different from existing Distributed Transaction models because Grid resources are highly autonomous, dynamic and heterogeneous. This paper proposes a Grid Transaction service (GridTS) and coordination algorithms that manage short-lived and long-lived Grid Transactions respectively, providing reliability support for Grid applications. Unlike existing long-lived Transaction models that require application programmers to develop compensating Transactions, the GridTS can automatically generate compensating Transactions during the execution of long-lived Grid Transactions. The feasibility of GridTS and the effectiveness of proposed coordination algorithms are demonstrated through simulation studies.
Jose Meseguer - One of the best experts on this subject based on the ideXlab platform.
-
Read atomic Transactions with prevention of lost updates: ROLA and its formal analysis
Formal Aspects of Computing, 2019Co-Authors: Peter Csaba Olveczky, Qi Wang, Indranil Gupta, Jose MeseguerAbstract:Designers of Distributed database systems face the choice between stronger consistency guarantees and better performance. A number of applications only require read atomicity (RA) (either all or none of a Transaction’s updates are visible to other Transactions) and prevention of lost updates (PLU). Existing Distributed Transaction systems that meet these requirements also provide additional stronger consistency guarantees (such as causal consistency ), but this comes at the price of lower performance. In this paper we propose a new Distributed Transaction protocol, ROLA, that targets application scenarios where only RA and PLU are needed. We formally specify ROLA in Maude. We then perform model checking to analyze both the correctness and the performance of ROLA. For correctness, we use standard model checking to analyze ROLA’s satisfaction of RA and PLU. To analyze performance we: (a) perform statistical model checking to analyze key performance properties; and (b) compare these performance results with those obtained by also modeling and analyzing in Maude the well-known protocols Walter and Jessy that also guarantee RA and PLU. Our statistical model checking results show that ROLA outperforms both Walter and Jessy.
-
automatic analysis of consistency properties of Distributed Transaction systems in maude
Tools and Algorithms for Construction and Analysis of Systems, 2019Co-Authors: Peter Csaba Olveczky, Qi Wang, Min Zhang, Jose MeseguerAbstract:Many Transaction systems distribute, partition, and replicate their data for scalability, availability, and fault tolerance. However, observing and maintaining strong consistency of Distributed and partially replicated data leads to high Transaction latencies. Since different applications require different consistency guarantees, there is a plethora of consistency properties—from weak ones such as read atomicity through various forms of snapshot isolation to stronger serializability properties—and Distributed Transaction systems (DTSs) guaranteeing such properties. This paper presents a general framework for formally specifying a DTS in Maude, and formalizes in Maude nine common consistency properties for DTSs so defined. Furthermore, we provide a fully automated method for analyzing whether the DTS satisfies the desired property for all initial states up to given bounds on system parameters. This is based on automatically recording relevant history during a Maude run and defining the consistency properties on such histories. To the best of our knowledge, this is the first time that model checking of all these properties in a unified, systematic manner is investigated. We have implemented a tool that automates our method, and use it to model check state-of-the-art DTSs such as P-Store, RAMP, Walter, Jessy, and ROLA.
-
rola a new Distributed Transaction protocol and its formal analysis
Fundamental Approaches to Software Engineering, 2018Co-Authors: Peter Csaba Olveczky, Keshav Santhanam, Qi Wang, Indranil Gupta, Jose MeseguerAbstract:Designers of Distributed database systems face the choice between stronger consistency guarantees and better performance. A number of applications only require read atomicity (RA) and prevention of lost updates (PLU). Existing Distributed database systems that meet these requirements also provide additional stronger consistency guarantees (such as causal consistency), and therefore incur lower performance. In this paper we define a new Distributed Transaction protocol, ROLA, that targets applications where only RA and PLU are needed. We formally model ROLA in Maude. We then perform model checking to analyze both the correctness and the performance of ROLA. For correctness, we use standard model checking to analyze ROLA’s satisfaction of RA and PLU. To analyze performance we: (a) use statistical model checking to analyze key performance properties; and (b) compare these performance results with those obtained by analyzing in Maude the well-known protocol Walter. Our results show that ROLA outperforms Walter.
Ivana Popovic - One of the best experts on this subject based on the ideXlab platform.
-
ECBS - Formal Verification of Distributed Transaction Management in a SOA Based Control System
2011 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems, 2011Co-Authors: Ivana Popovic, Vladislav Vrtunski, Miroslav PopovicAbstract:In large scale, heavy workload systems, managing Distributed Transactions on multiple datasets becomes challenging and error prone task. Software systems based on service oriented architecture principles that manage critical infrastructures are typical environments where robust Transaction management is one of the essential goals to achieve. The aim of this paper is to provide a formal description of the solution for Transaction management and individual service component behavior in a SOA-based control system, and prove the correctness of the proposed design with the SMV formal verification tool. Atomic commitment protocol is used as a basis for solving Distributed Transaction management problem. SMV language and verification tool are utilized for formal description of the problem and verification of the necessary properties. The case study describes an application of the proposed approach in commercial software system for electrical power distribution management. Verification of given model properties has shown that suggested solution is suitable for the described class of SOA-based systems.
-
Formal verification of Distributed Transaction management in a SOA based control system
Proceedings - 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems ECBS 2011, 2011Co-Authors: Ivana Popovic, Vladislav Vrtunski, Miroslav PopovicAbstract:In large scale, heavy workload systems, managing Distributed Transactions on multiple datasets becomes challenging and error prone task. Software systems based on service oriented architecture principles that manage critical infrastructures are typical environments where robust Transaction management is one of the essential goals to achieve. The aim of this paper is to provide a formal description of the solution for Transaction management and individual service component behavior in a SOA-based control system, and prove the correctness of the proposed design with the SMV formal verification tool. Atomic commitment protocol is used as a basis for solving Distributed Transaction management problem. SMV language and verification tool are utilized for formal description of the problem and verification of the necessary properties. The case study describes an application of the proposed approach in commercial software system for electrical power distribution management. Verification of given model properties has shown that suggested solution is suitable for the described class of SOA-based systems.
Feilong Tang - One of the best experts on this subject based on the ideXlab platform.
-
An Effective Deadlock Prevention Mechanism for Distributed Transaction Management
2011 Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2011Co-Authors: Feilong Tang, Yao Shen, Li LiAbstract:Recently there has been an increasingly use of SOA infrastructure. Most of business applications need the Transaction management to guarantee the system consistency, typically by resource locks. High availability and performance of resource managers are extremely critical for business services. Researches have shown that deadlock can be easily produced when multi-process try to access the shared resources if some basic synchronization mechanism is adopted. In addition, existing resource locking based two-phase commit protocol requires that each Transaction obtains all needed locks before the second commit phase. This locking mechanism may lead to potential deadlocks and can pose significant limitations on applications that need to share resources between Transactions. In this paper, we propose a novel solution, for Distributed Transaction services, utilizing the advanced replicas and timestamps mechanisms to prevent deadlocks. Our approach makes use of existing lock policies with replicas to solve guaranteed deadlocks and compares conservative locking and timestamps based restart policy for global Transaction deadlock prevention. Further, we also demonstrate that our approach significantly improves the performance for both serialization and deadlock prevention. Our experimental results show that no deadlock occurs after utilizing our prevention mechanisms. Finally, we also observe that timestamps based restart policy is more suitable for global resource allocation and outperforms over related solutions.
-
Transaction Management for Reliable Grid Applications
2009 International Conference on Advanced Information Networking and Applications, 2009Co-Authors: Feilong Tang, Minglu Li, Li LiAbstract:Transaction management in Grids is responsible for ensuring the reliable execution of inherently Distributed Grid applications. Grid Transaction management is different from existing Distributed Transaction models because Grid resources are highly autonomous, dynamic and heterogeneous. This paper proposes a Grid Transaction service (GridTS) and coordination algorithms that manage short-lived and long-lived Grid Transactions respectively, providing reliability support for Grid applications. Unlike existing long-lived Transaction models that require application programmers to develop compensating Transactions, the GridTS can automatically generate compensating Transactions during the execution of long-lived Grid Transactions. The feasibility of GridTS and the effectiveness of proposed coordination algorithms are demonstrated through simulation studies.
-
AINA - Transaction Management for Reliable Grid Applications
2009 International Conference on Advanced Information Networking and Applications, 2009Co-Authors: Feilong Tang, Minglu Li, Li LiAbstract:Transaction management in Grids is responsible for ensuring the reliable execution of inherently Distributed Grid applications. Grid Transaction management is different from existing Distributed Transaction models because Grid resources are highly autonomous, dynamic and heterogeneous. This paper proposes a Grid Transaction service (GridTS) and coordination algorithms that manage short-lived and long-lived Grid Transactions respectively, providing reliability support for Grid applications. Unlike existing long-lived Transaction models that require application programmers to develop compensating Transactions, the GridTS can automatically generate compensating Transactions during the execution of long-lived Grid Transactions. The feasibility of GridTS and the effectiveness of proposed coordination algorithms are demonstrated through simulation studies.