Fast non-blocking atomic commit: an inherent trade-off

被引：8

作者：

Dutta, P ^{[1
]}

Guerraoui, R ^{[1
]}

Pochon, B ^{[1
]}

机构：

[1] EPFL, Distributed Programming Lab, CH-1015 Lausanne, Switzerland

来源：

INFORMATION PROCESSING LETTERS | 2004年 / 91卷 / 04期

关键词：

distributed algorithms; complexity; atomic commit;

D O I：

10.1016/j.ipl.2004.04.006

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of it processes may fail by crashing. We exhibit. for t greater than or equal to 3 an inherent trade-off between the fast abort property of NBAC, i.e., aborting a transaction as soon as possible if some process votes "no", and the fast commit property, i.e., committing a transaction as soon as possible when all processes vote "yes" and no process crashes. We also give two algorithms: the first satisfies fast commit and a weak variant of fast abort, whereas the second satisfies fast abort and a weak variant of fast commit. (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：195 / 200

页数：6