检索结果-内蒙古大学图书馆

The PROMPT real-time commit protocol

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2000年第2期11卷 160-181页

作者： Haritsa, JR Ramamritham, K Gupta, R Indian Inst Sci Supercomp Educ & Res Ctr Database Syst Lab Bangalore 560012 Karnataka India Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA Indian Inst Technol Bombay 400076 Maharashtra India Goldencom Technol Fremont CA 94539 USA

We investigate the performance implications of providing transaction atomicity for firm-deadline real-time applications operating on distributed data. Using a detailed simulation model, the real-time performance of a representative set of classical transaction commit protocols is evaluated. The experimental results show that data distribution has a significant influence on real-time performance and that the choice of commit protocol clearly affects the magnitude of this influence. We also propose and evaluate a new commit protocol, PROMPT (Permits Reading Of Modified Prepared-data for Timeliness), that is specifically designed for the realtime domain. PROMPT allows transactions to "optimistically" borrow, in a controlled manner, the updated data of transactions currently in their commit phase. This controlled borrowing reduces the data inaccessibility and the priority inversion that is inherent in distributed real-time commit processing. A simulation-based evaluation shows PROMPT to be highly successful, as compared to the classical commit protocols, in minimizing the number of missed transaction deadlines. in fact, its performance is close to the best on-line performance that could be achieved using the optimistic lending approach. Further, it is easy to implement and incorporate in current database system software. Finally, PROMPT is compared against an alternative priority inheritance-based approach to addressing priority inversion during commit processing. The results indicate that priority inheritance does not provide tangible performance benefits.

关键词： distributed real-time database commit protocol two phase commit three phase commit priority inheritance performance evaluation

来源：评论

学校读者我要写书评

暂无评论

ASEP: A secure and flexible commit protocol for MLS distributed database systems

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2000年第6期12卷 880-899页

作者： Ray, I Mancini, LV Jajodia, S Bertino, E Univ Michigan Dept Informat & Comp Sci Dearborn MI 48128 USA Univ Rome La Sapienza Dipartimento Sci Informaz Rome Italy George Mason Univ Ctr Secure Informat Syst Fairfax VA 22030 USA George Mason Univ Dept Informat & Software Syst Engn Fairfax VA 22030 USA Univ Milan Dipartimento Sci Informaz I-20135 Milan Italy

The classical Early Prepare commit protocol (EP), used in many commercial systems, is not suitable for use in multilevel secure distributed databases systems that employ a locking protocol for concurrency control. This is because EP requires that read locks are not released by a participant during its window of uncertainty;however, it is not possible for a locking protocol to provide this guarantee in a multilevel secure system (since the read lock of a higher-level transaction on a lower-level data object must be released whenever a lower-level transaction wants to write the same data). The only available work in the literature, namely the Secure Early Prepare protocol (SEP), overcomes this difficulty by aborting those distributed transactions that release their low-level read locks prematurely. We see this approach as being too restrictive. One of the major benefits of distributed processing is its robustness to failures, and SEP fails to take advantage of this. In this work, we propose the Advanced Secure Early Prepare commit protocol (ASEP) to solve the above problem together with a number of language primitives that can be used as system calls in distributed transactions. These primitives permit features like partial rollback and forward recovery to be incorporated within the transaction model, and allow a distributed transaction to proceed even when a participant has released its low-level read locks prematurely. This not only offers flexibility, but can also be used, if desired, by a sophisticated programmer to trade off consistency for atomicity of the distributed transaction.

关键词： database management systems distributed databases security multilevel security transaction processing commit protocol

来源：评论

学校读者我要写书评

暂无评论

Nonblocking two-phase commit protocol to avoid unnecessary transaction abort for distributed systems

引用

JOURNAL OF SYSTEMS ARCHITECTURE 1997年第1-5期43卷 245-254页

作者： Byun, T Moon, S Korea Advanced Inst of Science and Technology Seoul S Korea

Processing a distributed transaction takes more time than processing a local transaction, since processing of a distributed transaction requires multiple phases with respect to its commitment to keep a distributed transaction consistent. For distributed systems, since the commit cost could be high due to volume of network messages and network delays, it is required to optimise commit protocol to improve transaction throughput. In order to improve the throughput of transaction processing, we concentrate on the nonblocking property without loss of consistency, including the number of message exchanges, recovery time. Blocking is a critical problem in transaction processing with respect to throughput, since blocked transactions interfere the progress of other transactions. Abortion of the commitable transaction makes the system degrade, and it becomes serious if there are many transactions at the failed sites due to the unnecessary restart overhead. Therefore, in the view of efficiency, it is essentially required to develop a commit protocol that has not only few message exchanges but also low ratio of transaction aborts.

关键词： commit protocol nonblocking message exchange

来源：评论

学校读者我要写书评

暂无评论

High performance distributed real-time commit protocol

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2003年第2期68卷 145-152页

作者： Qin, B Liu, YS Huazhong Univ Sci & Technol Coll Comp Sci & Technol Wuhan 430074 Hubei Peoples R China

In a distributed real-time database system, the only way to ensure transaction atomicity is to investigate and develop a real-time atomic commit protocol. This paper presents the model of distributed real-time transaction and analyses all kinds of dependencies because of data conflicts access. Based on this model, we propose an optimistic real-time commit protocol, double space commit (2SC), which is specifically designed for the high-performance distributed real-time transaction. 2SC allows a non-healthy transaction to lend its held data to the transactions in its commit dependency set. When the prepared transaction aborts, only the transactions in its abort dependency set are aborted while the transactions in its commit dependency set will execute as normal. The two properties of 2SC can reduce the data inaccessibility and the priority inversion that is inherent in distributed real-time commit processing. Extensive simulation experiments have been performed to compare the performance of the 2SC with that of other protocols such as the base protocol, the permits reading of modified prepared-data for timeliness [IEEE Transactions on Parallel and Distributed Systems 11 (2) (2000) 160-181] and the deadline-driven conflict resolution [The Computer Journal 42 (8) (1999) 674-692]. The simulation results show that 2SC has the best performance. Furthermore, it is easy to incorporate in current concurrency control protocols. (C) 2002 Elsevier Inc. All rights reserved.

关键词： distributed real-time transaction commit protocol transaction dependency

来源：评论

学校读者我要写书评

暂无评论

A tentative commit protocol for composite web services

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2006年第7期72卷 1226-1237页

作者： Younas, Muhammad Chao, Kuo-Ming Oxford Brookes Univ Dept Comp Oxford OX3 0BP England Coventry Univ Dept Comp & Network Syst Coventry W Midlands England

Composite web services provide promising prospects for conducting cross-organizational business transactions. Such transactions: are generally complex, require longer processing time, and manipulate financially critical data. It is therefore crucial to ensure stronger reliability, higher throughput and enhanced performance of transactions. In order to meet these requirements, this paper proposes a new commit protocol for managing transactions in composite web services. Specifically, it aims to improve the performance by reducing network delays and the processing time of transactions. The proposed protocol is based on the concept of tentative commit that allows transactions to tentatively commit on the shared data of web services. The tentative commit protocol avoids resource blocking thus improving performance. The proposed protocol is tested through various simulation experiments. The outcomes of these experiments show that the proposed protocol outperforms existing protocols in terms of transaction performance. (C) 2006 Elsevier Inc. All rights reserved.

关键词： web services transactions commit protocol composite web services performance tentative commit

来源：评论

学校读者我要写书评

暂无评论

IDRC: A Distributed Real-Time commit protocol 6

IDRC: A Distributed Real-Time Commit Protocol

引用

6th International Conference on Smart Computing and Communications (ICSCC)

作者： Pandey, Sarvesh Shanker, Udai Madan Mohan Malaviya Univ Technol Comp Sci & Engn Dept Gorakhpur 273010 Uttar Pradesh India

With rapidly increasing interest in distributed real-time database systems (DRTDBS), data conflicts amongst distributed transactions have become a crucial factor which negatively influences the system performance. To address above issue, anImproved Data Lending based Distributed Real-Time commit (IDRC) protocol has been developed. IDRC reduce the negative impact of data conflicts on the DRTDBSperformance by increasing the data accessibility as compared to the earlier protocols. It allows the commit dependent borrower participant node (who has already lent the data item to the abort dependent borrower participant node) to lend the same data item in read mode to more than one borrower participant nodes. The simulation results show that the proposed commit protocol outperforms. (C) 2018 The Authors. Published by Elsevier B.V.

关键词： Concurrency Control commit protocol Lender-Borrower Approach Priority Inversion DRTDBS

来源：评论

学校读者我要写书评

暂无评论

A One Phase Priority Inheritance commit protocol 14th

A One Phase Priority Inheritance Commit Protocol

引用

14th International Conference on Distributed Computing and Internet Technology (ICDCIT)

作者： Pandey, Sarvesh Shanker, Udai Madan Mohan Malaviya Univ Technol Comp Sci & Engn Dept Gorakhpur Uttar Pradesh India

ISBN: (纸本)9783319723440;9783319723433

High priority two phase locking (HP2PL) concurrency control algorithm can be used for accessing of data items to resolve conflicts amongst the concurrently executing transactions. Inclusion of priority inversion and data inaccessibility are the most undesirable problems in transactions' execution which seriously affect the system performance. Previously developed protocols for resolving such issues put a lot of messages and time overhead which is not desirable. In distributed real-time database system (DRTDBS), basic aim is to minimize the number of transactions missing their deadline. This can be achieved by minimizing commit time. In this paper, A One Phase Priority Inheritance commit protocol (OPPIC) has been proposed specifically reducing one round of message transfer among coordinator and participating cohorts' sites in case of priority inversion problem at any of the cohort of low priority transaction. Focus of this protocol is to minimize the priority inversion duration that in turn minimizes commit time. A distributed database system is simulated for measuring the performance of this protocol with 2PC and PIC protocols. The results confirm the significant improvement in system performance with the OPPIC protocol.

关键词： Concurrency control commit protocol Priority inheritance Priority inversion Distributed real-time database systems

来源：评论

学校读者我要写书评

暂无评论

A LIUB(LOG(2)(N))-2 RESILIENT DECENTRALIZED commit protocol

引用

IEEE TRANSACTIONS ON RELIABILITY 1994年第4期43卷 594-599页

作者： YUAN, SM National Chiao Tung University Hsinchu Taiwan

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(***(2)(2)(N)) which is only a factor of log(2)(N) over the message complexity lower bound 0(***(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.

关键词： DISTRIBUTED DATABASE SYSTEM commit protocol DECENTRALIZED ALGORITHM RESILIENCE HYPERCUBE MESSAGE COMPLEXITY

来源：评论

学校读者我要写书评

暂无评论

IDRC: A Distributed Real-Time commit protocol

引用

Procedia Computer Science 2018年 125卷 290-296页

作者： Sarvesh Pandey Udai Shanker

With rapidly increasing interest in distributed real-time database systems (DRTDBS), data conflicts amongst distributed transactions have become a crucial factor which negatively influences the system performance. To address above issue, an I mproved Data Lending based D istributed R eal-Time C ommit (IDRC) protocol has been developed. IDRC reduce the negative impact of data conflicts on the DRTDBSperformance by increasing the data accessibility as compared to the earlier protocols. It allows the commit dependent borrower participant node (who has already lent the data item to the abort dependent borrower participant node) to lend the same data item in read mode to more than one borrower participant nodes. The simulation results show that the proposed commit protocol outperforms.

关键词： Concurrency Control commit protocol Lender-Borrower Approach Priority Inversion DRTDBS

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of commit protocols in Mobile Environment: M2PC, UCM and TOOT 2

Comparative Study of Commit Protocols in Mobile Environment:...

引用

2nd IEEE International Conference on Contemporary Computing and Informatics (IC3I)

作者： Jaiswal, Ankit Kumar Shanker, Udai MMMUT Dept Comp Sci & Engn Gorakhpur Uttar Pradesh India

ISBN: (纸本)9781509052561

In the mobile environment the major issues for commit the transactions are disconnection due to mobile handoff or shut down of devices. Disconnection is frequent problem in mobile environment. This results transaction failure. A traditional two-phase commit protocol is best for the distributed environment. In case of mobile environment where devices are connected wirelessly we should deal with the issues of mobility. The paper presents comparison study of three major commit protocols in the mobile environment. The paper surveys different approaches proposed for mobile transaction and summarize how the conventional commitment are revisited to fit the needs of mobile environment.

关键词： commit protocol mobile environment distributed environment two-phase commit protocol handoff

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：