A Dynamic Two-Phase Commit Protocol for Adaptive Composite Services

Yu, Weihai; Pu, Calton

doi:10.4018/978-1-59904-947-2.ch182

Cited by 5 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such a protocol allows participants with different presumptions to be dynamically combined in one transaction. Compared to the work presented in this paper, [12] does not address evolution concerns. In our work, we use 2PC, 2PC-PA and 2PC-PC as use cases.…”

Section: Related Workmentioning

confidence: 96%

“…Our future work includes to study the component-based configuration of other 2PC-based protocols (e.g., [12]) but also 1PC and 3PC protocols. The idea is to extend CATE to support more commit protocols.…”

Section: Discussionmentioning

confidence: 99%

“…Predictable issues. Some commit protocols draw benefits from predicable issues of transactions [12,13,14]. Using piggybacking or callback mechanisms, they determine if the transaction is marked for read-only or abort before starting the commit protocol.…”

Section: Discussionmentioning

confidence: 99%

“…The abort protocol applies only one issue. This predictable issue is applied by several 2PC optimizations [12,13,14] to exploit the efficiency of transaction aborted unilaterally.…”

Section: Pcmentioning

confidence: 99%

See 3 more Smart Citations

Towards Context-Aware Transaction Services

Rouvoy¹,

Serrano-Alvarado²,

Merle³

2006

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

Abstract. For years, transactional protocols have been defined for particular application needs. Traditionally, when implementing a transaction service, a protocol is chosen and remains the same during the system execution. Nevertheless, the dynamic nature of nowadays application contexts (e.g., mobile, ad-hoc, peer-to-peer) and context variations (semantics-related aspects) motivates the need for transaction service adaptation. Next generation of transaction services should be adaptive or even better self-adaptive. This paper proposes CATE: (1) a componentbased architecture of standard 2PC-based protocols and (2) a ContextAware Transaction sErvice. Self-adaptation of CATE is obtained by context awareness and component-based reconfiguration. This allows CATE to select the most appropriate protocol with respect to the execution context. We show that using CATE performs better than using only one commit protocol in a variable system and that the reconfiguration cost is negligible.

show abstract

Section: Related Workmentioning

confidence: 96%

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

“…The abort protocol applies only one issue. This predictable issue is applied by several 2PC optimizations [12,13,14] to exploit the efficiency of transaction aborted unilaterally.…”

Section: Pcmentioning

confidence: 99%

See 2 more Smart Citations

Towards Context-Aware Transaction Services

Rouvoy¹,

Serrano-Alvarado²,

Merle³

2006

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

show abstract

“…Most of them require manually-defined "upgrading information" for applications, such as conversion/mapping rules [6], delta files [3], communication protocols [5] or upgrading annotations [4], [6]- [8]. With this information, these solutions can modify the applications to fit the new Application Programming Interfaces (APIs) of the upgraded components and therefore eliminate compatibility problems in a system.…”

Section: Introductionmentioning

confidence: 99%

ALTA: Automatic Load-Time Adaptation Technique for Refactoring-Based Evolution of Software Component

Chang

2012

2012 IEEE 36th Annual Computer Software and Applications Conference

View full text Add to dashboard Cite

Evolution of software components may lead to compatibility problems. State-of-the-art fully-automatic compatibility solutions either require source code, or they fail to support refactorings that may lead to conflict method signatures, such as changing the order of same-typed parameters or changing return types. Moreover, all of them will statically modify source or binary files, which may violate the license agreements of components.In this paper, we propose ALTA, a fully-automatic adaptation technique for refactoring-based evolution of software component. ALTA supports refactorings that may lead to conflict method signatures. In addition, ALTA can perform loadtime adaptation, and therefore it can work under all kinds of license agreements. We also present ALTA*, an implementation of ALTA by Java and AspectJ. The evaluation results show that ALTA* effectively solves compatibility problems in realworld components with a performance overhead of load-time adaptation feature (if enabled) at around 11%.

show abstract

Adaptive trade‐off between consistency and performance in data replication

et al. 2016

View full text Add to dashboard Cite

Summary Replication is widely adopted in modern Internet applications and distributed systems to improve the reliability and performance. Though maintaining the strong consistency among replicas can guarantee the correctness of application behaviors, however, it will affect the application performance at the same time because there is a well‐known trade‐off between consistency and performance. Many real‐world applications favoring performance often choose to enforce weak consistency. Although there has been some work on flexible configuration of consistency, most focuses on design or deployment time. As the system settings constantly change during runtime, the tuning of the consistency‐performance trade‐off needs to be handled dynamically. Failing to do that will cause either underestimation or overestimation of the consistency and performance that can be achieved. Existing work does not well support the dynamic tuning of the aforementioned trade‐off in runtime, which is mainly because of the lack of an appropriate quantitative model of consistency and performance. In this work, based on our previous effort on the quantitative model of consistency and latency, we design a replication protocol, CC‐Paxos, to achieve an adaptive trade‐off between consistency and performance according to application preferences and runtime information. By design, CC‐Paxos is not bound to any specific underlying data stores. We have implemented CC‐Paxos and applied it to MySQL databases. And real experiments both within a data center and across data centers show that CC‐Paxos not only can dynamically adjust the delivered consistency in return for ensured performance but also outperforms MySQL Cluster in the case of strong consistency guarantee. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

A Dynamic Two-Phase Commit Protocol for Adaptive Composite Services

Cited by 5 publications

References 0 publications

Towards Context-Aware Transaction Services

Towards Context-Aware Transaction Services

ALTA: Automatic Load-Time Adaptation Technique for Refactoring-Based Evolution of Software Component

Adaptive trade‐off between consistency and performance in data replication

Contact Info

Product

Resources

About