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

A Hybrid Distributed Optimistic Concurrency Control Method for High—Performance Real—Time Transaction Processing

Journal of Computer Science & Technology 2003年第1期18卷 77-83页

作者：覃飙刘云生 CollegeofComputerScienceandTechnology HuazhongUniversityofScienceandTechnologyWuhan430074P.R.China CollegeofComputerScienceandTechnology HuazhongUniversityofScienceandTechnolog

The conventional lock scheme tends to suffer from a cascade of blockings, while the optimistic concurrency control (OCC) scheme may suffer from wasting resources. To overcome these problems, some researchers have proposed a combination of OCC and lock in transaction processing. Using this method, Thomasian proposed the hybrid method for conventional distributed transaction processing, and Lam proposed the DOCC-DA protocol for distributed realtime database system based on forward validation. This paper proposes a new protocol, called Hybrid Distributed Optimistic Concurrency Control Embedded in two-Phase commit, which is based on back validation. The new protocol makes use of access invariance and runtime information which can guarantee a rerun transaction to meet its deadline and abort the fruitless run transactions as early as possible. A series of simulation experiments have been done to investigate the performance of the new protocol. The results show that its performance is consistently better than that of other protocols.

关键词： distributed real-time database optimistic concurrency control serializability commit protocol

来源：评论

学校读者我要写书评

暂无评论

A commit Strategy for Distributed Real-Time Transaction

引用

Journal of Computer Science & Technology 2003年第5期18卷 626-631页

作者：覃飙刘云生杨进才 College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 P.R. China

Ramamritham gives three common types of constraints for the execution his-tory of concurrent transactions. This paper extends the constraints and gives the fourth type ofconstraint. Then the weak commit dependency and abort dependency between transactions, be-cause of data access conflicts, are analyzed. Based on the analysis, an optimistic commit protocol2LC (two-Level commit) is proposed, which is specially designed for the distributed real-time do-main. It allows transactions to optimistically access the locked data in a controlled manner, which reduces the data inaccessibility and priority inversion inherent and undesirable in distributed real-time database systems. Furthermore, if the prepared transaction is aborted, the transactions in itsweak commit dependency set will execute as normal according to 2LC. Extensive simulation ex-periments have been performed to compare the performance of 2LC with that of the base protocol,the permits reading of modified prepared-data for timeliness (PROMPT) and the deadline-drivenconflict resolution (DDCR). The simulation results show that 2LC is effective in reducing the num-ber of missed transaction deadlines. Furthermore, it is easy to be incorporated with the existing concurrency control protocols.

关键词： distributed real-time database system commit protocol transactiondependency

来源：评论

学校读者我要写书评

暂无评论

Optimized compensation transaction for mobile telecommunication systems

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1996年第6期E79A卷 804-811页

作者： Yoon, Y RealTime OS Section Electronics Telecommunication R. Daeduk Science Town Daejeon 305600 YuSong P.O. Box 106 South Korea

In this paper, we design an optimized compensation transaction (OCT) that implies an important property of location information. The validity of the proposed compensation transaction is illustrated by describing the HLR database systems on the mobile telecommunications system. We found out that both the length and the occurrence percentage of compensation transactions affect reversely the success ratio of other transactions. However, OCT rarely affects the other transactions, because the compensating procedures are performed rapidly. This paper argues that the optimized compensation transaction is very adequate in the mobile telecommunication system where update transactions are issued more frequently than read-only transactions.

关键词： transaction processing commit protocol HLR

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTED FILE SERVER FOR EMBEDDED APPLICATIONS

引用

SOFTWARE ENGINEERING JOURNAL 1988年第5期3卷 142-148页

作者： MUKHERJEE, A KRAMER, J MAGEE, J ADV TECHNOL INST CALCUTTA 700064INDIA UNIV LONDON IMPERIAL COLL SCI & TECHNOL DEPT COMPLONDON SW7 2BZENGLAND

This paper describes the design and implementation of a distributed file system (dfs) for embedded applications. The services provided in dfs include transaction management, file management and file access. Client processes use message passing to access these services. The file system provides client processes with different types of files. These includereplicatedfiles, with identical copies stored at multiple nodes, andconsistentfiles, stored at a single node. Both are accessed only within transactions. Multiple readers or a single writer are allowed access to the files, and updates are performed atomically using a co-ordinated commit protocol over multiple sites. A novel concurrency control algorithm which provides deterministic response and avoids deadlock has been designed to resolve contention. Other types of file are also provided for low-overhead storage of less critical data. This paper motivates the need for different types of file, and describes the design and implementation of dfs using the CONIC programming environment for the construction of distributed systems.

关键词： file servers programming environments distributed processing concurrency control Computer networks and techniques CONIC programming environment protocols replicated files deterministic response transaction management distributed file server distributed systems consistent files file access embedded applications File organisation file organisation message passing Operating systems Programming support commit protocol file management

来源：评论

学校读者我要写书评

暂无评论

Reducing the blocking in two-phase commit with backup sites

引用

INFORMATION PROCESSING LETTERS 2003年第1期86卷 39-47页

作者： Reddy, PK Kitsuregawa, M Univ Tokyo Inst Ind Sci Meguro Ku Tokyo 1538505 Japan

The blocking phenomena in two-phase commit (2PC) reduces the availability of the system as the blocked transactions keep all the resources until the recovery of the coordinator. The three-phase commit (3PC) protocol involves an extra round of message transmission to resolve the blocking problem. In this paper, we propose a backup commit (BC) protocol to reduce the blocking problem by attaching multiple backup sites to the coordinator site. In BC, after receiving responses from the participants, the coordinator quickly communicates the final decision to the backup sites, before it sends the final decision to the participants. When blocking occurs, the participant sites can terminate the transaction by consulting a backup site of the coordinator. The BC protocol resolves the blocking in most of the coordinator site failures without involving an expensive communication cycle as in 3PC. The simulation experiments indicate that the throughput performance of BC is close to 2PC. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： distributed database commit protocol two-phase commit three-phase commit non-blocking protocols distributed computing

来源：评论

学校读者我要写书评

暂无评论

Towards Dynamic Service Level Agreement Negotiation: An Approach Based on WS-Agreement

Towards Dynamic Service Level Agreement Negotiation: An Appr...

引用

4th International Conference on Web Information Systems and Technologies

作者： Pichot, Antoine Waeldrich, Oliver Ziegler, Wolfgang Wieder, Philipp Alcatel Lucent F-91620 Nozay France Fraunhofer Inst SCAISankt Dept Bioinformat Augustin Germany Univ Dortmund IT & Media CtrTU Dortmund Germany

ISBN: (纸本)9783642013430

In Grid, e-Science and e-Business environments, Service Level Agreements are often used to establish frameworks for the delivery of services between service providers and the organisations hosting the researchers. While this high level SLAB define the overall quality of the services, it is desirable for the end-user to have dedicated service quality also for individual services like the orchestration of resources necessary for composed services. Grid level scheduling services typically are responsible for the orchestration and co-ordination of resources in the Grid. Co-allocation e.g. requires the Grid level scheduler to coordinate resource management systems located in different domains. As the site autonomy has to be respected negotiation is the only way to achieve the intended co-ordination. SLAB emerged as a new way to negotiate and manage usage of resources in the Grid and are already adopted by a number of management systems. Therefore, it is natural to look for ways to adopt SLAB for Grid level scheduling. In order to do this, efficient and flexible protocols are needed, which support dynamic negotiation and creation of SLAB. In this paper we propose and discuss extensions to the WS-Agreement protocol addressing these issues.

关键词： commit protocol Negotiation Quality of service Service level agreement Web services agreement

来源：评论

学校读者我要写书评

暂无评论

The causal-phase ordering protocol to manage soft real-time distributed transactions 14

The causal-phase ordering protocol to manage soft real-time ...

引用

14th International Conference on Computer Applications in Industry and Engineering

作者： Amanton, L Sadeg, B Saad-Bouzefrane, S Univ Havre LIH Le Havre France

ISBN: (纸本)1880843404

In this paper, a causal-phase ordering protocol is used as concurrency control mechanism to commit soft real-time distributed transactions. The protocol, called Causal-CC, consists of subdividing active transactions into distinct sets. Transactions into each set are virtually serialized and distributed over the servers composing the distributed system. Causal phases are then created according to the possible conflicts between transactions. These transactions are scheduled so as transactions of two successive phases are ensured to commit in a causal partial order. Causal-CC permits to reduce the execution time and to reduce the number of conflicts, allowing then more transactions to meet their deadlines.

关键词： distributed database causal phase ordering soft real-time transaction commit protocol virtual synchrony

来源：评论

学校读者我要写书评

暂无评论

Dynamic SLA negotiation based on WS-Agreement

Dynamic SLA negotiation based on WS-Agreement

引用

4th International Conference on Web Information Systems and Technologies

作者： Pichot, Antoine Waeldrich, Oliver Ziegler, Wolfgang Wieder, Philipp Alcatel Lucent Route Villejust F-91620 Nozay France Cent Inst Appl Math ZAM Res Ctr Julich D-52425 Julich Germany Fraunhofer Inst SCAI Dept Bioinformat D-53754 St Augustin Germany

ISBN: (纸本)9789898111265

In Grid, e-Science and e-Business environments Service Level Agreements (SLAs) are often used to establish frameworks for the delivery of services between service providers and the home organisations of the customers. While this high level SLAs, e.g. framework contracts, govern the relationship between the par-ties, it is desirable for the end-user to have dedicated quality of service (QoS) also for individual services like the orchestration of resources necessary for composed services. Grid level scheduling services typically are responsible for the orchestration and coordination of resources in the Grid, which requires the Grid level scheduler to coordinate resource management systems probably located in different domains. As the site autonomy has to be respected negotiating with the individual sites is the only way to achieve the intended coordination. Electronic SLAs emerged as a new way to negotiate and manage usage of resources in the Grid and are already adopted by a number of management systems. Therefore, it is natural to look for ways to adopt SLAs for Grid level scheduling. To realise this approach we need efficient and flexible protocols supporting dynamic negotiation and creation of SLAs. In this paper we propose and discuss ongoing work on extensions to the WS-Agreement protocol addressing these issues.

关键词： dynamic Service Level Agreement negotiation web services agreement commit protocol

来源：评论

学校读者我要写书评

暂无评论

Priority Inversion in DRTDBS: Challenges and Resolutions 18

Priority Inversion in DRTDBS: Challenges and Resolutions

引用

5th ACM India Joint International Conference on Data Science and Management of Data (CoDS) / International Conference on Management of Data (COMAD)

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

ISBN: (纸本)9781450363419

The primary(1) performance objective in distributed real-time database systems (DRTDBS) is to minimize the number of transactions missing their deadlines. Demanding nature of this objective makes traditional approaches and even existing approaches inadequate. The past researches have been mostly devoted to outspreading traditional transaction processing methods to resolve the issues. However, for the design of DRTDBS, new policies/protocols must be designed to resourcefully handle the concurrent execution of transactions. Our aim is to develop new concurrency control protocols, commit protocols and to compare their performance with existing protocols. Another plan is to extend our work to nested transaction model, replication environment and possibly mobile environment.

关键词： Concurrency Control commit protocol Data Conflict Priority Inversion Priority Inheritance Distributed Real-time Database System

来源：评论

学校读者我要写书评

暂无评论

Research on MRTT Simulate

Research on MRTT Simulate

引用

3rd International Symposium on Intelligent Information Technology Application

作者： Di, Guoqiang Liu, Yaoyao Liao, Guoqiong Wang, Gang Jiangxi Univ Finance & Econ Sch Informat Technol Nanchang Peoples R China

ISBN: (纸本)9780769538594

It is difficult to build the simulate environment for researching on mobile computer environment, especially for MRTT simulate in mobile distributed environment., Usually Object Oriented Programming (OOP) or Multi-Thread technology maybe the first choice, but this paper will introduce a simulate method based on structured programming with VC6.0 which is turn out more efficiency. In this paper we introduce the base structure of the system, and compare three commit protocols and three migration strategy.

关键词： MRTT simlate moblie database commit protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：