【24h】

Increasing Concurrency without Early Release

机译:在不提前发布的情况下提高并发性

获取原文
获取原文并翻译 | 示例

摘要

Distributed transactions have poor scalability. One of the reasons is that every site that a distributed transaction involves has to hold data resources until the termination of the entire transaction, i.e., every sub-transaction's lifetime of resource consumption is bounded to the slowest sub-transaction. There are several solutions to this problem. The basic idea of these solutions is to release data resources as early as possible before the termination of the entire distributed transaction. These solutions either suffer from cascading aborts or require knowledge of application details such as the use of compensation. In this paper, we present a totally different approach that delays altruistically the execution of fast sub-transactions. We will show that this approach increases concurrency of the entire distributed system without sacrificing transaction response time. Furthermore, this approach assumes no more than strict two-phase locking and requires very little knowledge of specific application process logic.
机译:分布式事务具有较差的可伸缩性。原因之一是,分布式事务涉及的每个站点都必须保留数据资源,直到整个事务终止为止,即,每个子事务的资源消耗生命周期都受限于最慢的子事务。有几种解决方案。这些解决方案的基本思想是在整个分布式事务终止之前尽早释放数据资源。这些解决方案要么遭受中止级联,要么需要了解应用程序详细信息,例如使用补偿。在本文中,我们提出了一种完全不同的方法,该方法无私地延迟了快速子交易的执行。我们将展示这种方法在不牺牲事务响应时间的情况下增加了整个分布式系统的并发性。此外,此方法仅假设严格的两阶段锁定,并且只需要很少的特定应用程序逻辑知识。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号