标题: A LIUB(LOG(2)(N))-2 RESILIENT DECENTRALIZED COMMIT PROTOCOL
作者: YUAN, SM
交大名义发表
资讯工程学系
National Chiao Tung University
Department of Computer Science
关键字: DISTRIBUTED DATABASE SYSTEM;COMMIT PROTOCOL;DECENTRALIZED ALGORITHM;RESILIENCE;HYPERCUBE;MESSAGE COMPLEXITY
公开日期: 1-十二月-1994
摘要: In distributed database systems, commit protocols are used to ensure the transaction atomicity. In the presence of failures, nonblocking commit protocols can guarantee the transaction atomicity without blocking the transaction execution. A (resilient) decentralized nonblocking commit protocol (RDCP) is proper-ed for distributed database systems. This protocol is based on the hypercube network topology and is 'liub(log(2)(N)) - 2' resilient to node failures (N = number of system-nodes). The number of messages sent among the N nodes is 0(N.log(2)(2)(N)) which is only a factor of log(2)(N) over the message complexity lower bound 0(N.log(2)(N)) of decentralized commit protocols. Furthermore, RDCP is an optimistic nonblocking protocol. It aborts the transaction only when some nodes want to abort or some nodes fail before they make local decisions.
URI: http://dx.doi.org/10.1109/24.370221
http://hdl.handle.net/11536/2210
ISSN: 0018-9529
DOI: 10.1109/24.370221
期刊: IEEE TRANSACTIONS ON RELIABILITY
Volume: 43
Issue: 4
起始页: 594
结束页: 599
显示于类别:Articles


文件中的档案:

  1. A1994QC59900015.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.