Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 7,330 papers for “Distributed transaction”

Distributed Archives Transaction System

Christopher P. Holland, Paul F. Jacobs, Jacobs, Paul Frederick · Humanities Commons CORE (Modern Language Association / Columbia University) · 2010

This project will develop tools for accessing digitized collections in the humanities via a system that provides universal communication with multiple database types and that simultaneously protects the integrity of original data sets. Because the proposed system cuts across database types and sources, in order to establish ease in gathering information, it will offer an efficient way to conduct research. A user will come to a single site to collect data, rather than having to construct individual searches at each of many sites. Key to this project is the integrity of data sources. Unlike other projects, this system will not possess (copies of) databases or sources; nor will it change databases or data sources in order for information to be gathered. This feature permits alteration by data owners to occur routinely and for changes to appear at once. Importance of the project is the shift from site-specific searches to a single seamless search across multiple sites.

Cited by 0Open access

Adaptable distributed transaction systems

John Riedl · Purdue e-Pubs (Purdue University System) · 1990

There is a need for adaptable systems that can change as requirements change, both in the long and the short term. Adaptability can reduce software costs and improve reliability and performance. Adaptability includes design techniques that support enhancement, retargeting to new projects, restructuring during different phases of a mission, and changing algorithms as external conditions change. These techniques are particularly important for projects with stringent performance or reliability requirements. We model algorithmic adaptability, which supports techniques for switching between classes of schedulers in distributed transaction systems. RAID is an experimental system implemented to support experimentation in adaptability. We study adaptability features in RAID, including algorithmic adaptability, fault-tolerance, and implementation techniques for an adaptable server-based design. Experiments are described that quantify the costs and benefits of adaptability.

Cited by 6

Secure Distributed Transaction Precessing

R. A. Riemenschneider · 2000

Abstract : This technical report describes the work of the Dependable System Architecture Group on the Secure Distributed Transaction Processing (SDTP) project. Chapter 1 provides an overview of secure software architectures. Chapter 2 describes the goals and methodology of the SDTP project. Chapter 3 of this report provides a proof of the model-theoretic approach used in the project to prove that refinement steps are faithful and preserve both security and faithful properties. Chapter 4 introduces an alternative method of proving refinement. Chapter 5 describes the method for showing patterns are faithful and hence security-preserving. Chapter 6 shows refinement patterns that do not always preserve a property of interest, such as security, can be used without losing the correctness guarantee that a restriction to validated refinement patterns automatically provides. Chapter 7 discusses a case study in architecture verification. Finally, Chapter 8 provides more detail on the reference implementation and describes two applications of the reference implementation (law enforcement and intrusion detection).

Cited by 0

Transaction Management for Distributed Multidatabases

Nandit Soparkar, Nandit Soparkar, Henry F. Korth et al. · 1992

Correctly managing transaction executions in a system of autonomous databases is a difficult problem. The various solutions studied in the past seldom address the important failures that may occur in a distributed system of this nature. This paper proposes a new paradigm for transaction management for failure-prone environments with minimal changes made to the existing systems. The development process for the scheme is simple, a large variety of concurrency control schemes may be handled, and the approach is able to tolerate failures of both sites and the communication system. Also, ways are proposed to profitably use new communications technology, and to use the existing storage and retrieval facilities so as to reduce the costs of the integration. 3 This material is based in part upon work supported by the Texas Advanced Research Program under Grant No. 4355 and by the NSF under grant IRI-8805215. This work was completed while the second author was at the University of Texas...

Cited by 0

Low-Overhead Distributed Transaction Coordination

James Cowling, Barbara Liskov · DSpace@MIT (Massachusetts Institute of Technology) · 2012

This paper presents Granola, a transaction coordination infrastructure for building reliable distributed storage applications. Granola provides a strong consistency model, while significantly reducing transaction coordination overhead. We introduce specific support for a new type of independent distributed transaction, which we can serialize with no locking overhead and no aborts due to write conflicts. Granola uses a novel timestamp-based coordination mechanism to order distributed transactions, offering lower latency and higher throughput than previous systems that offer strong consistency. Our experiments show that Granola has low overhead, is scalable and has high throughput. We implemented the TPC-C benchmark on Granola, and achieved 3 × the throughput of a platform using a locking approach. 1

Cited by 0Open access

Efficient Geo-Distributed Transaction Processing

Hildred, Joshua Thomas · UWSpace (University of Waterloo) · 2023

Distributed deterministic database systems support OLTP workloads over geo-replicated data. Providing these transactions with ACID guarantees requires a delay of multiple wide-area network (WAN) round trips of messaging to totally order transactions globally. This thesis presents Sloth, a geo-replicated database system that can serializably commit transactions after a delay of only a single WAN round trip of messaging. Sloth reduces the cost of determining the total global order for all transactions by leveraging deterministic merging of partial sequences of transactions per geographic region. Using popular workload benchmarks over geo-replicated Azure, this thesis shows that Sloth outperforms state-of-the-art comparison systems to deliver low-latency transaction execution.

Cited by 0Open access

Distributed Data Storing Based on Distributed Transaction Ledger

Oleksandr Berezovskyi, Mykola Terletskyi · Bulletin of V N Karazin Kharkiv National University series «Mathematical modeling Information technology Automated control systems» · 2024

The primary trend in the development of modern information technologies is the migration of computations to the cloud, making distributed computing the dominant strategy for information processing. In particular, this poses the challenge of reliable distributed data storage. A well-known approach to solving the problem of distributed data storage is blockchain or, more generally, distributed ledger technology. A key challenge of this technology is creating an effective mechanism for the global numbering of registry records. The complexity of solving this problem results from the fundamental limitations of distributed computing — the inability to accurately synchronize distributed computing processes and the limitations resulting from the CAP theorem for distributed data stores. The authors attempt to circumvent the mentioned limitations based on the hypothesis that such limitations can be overcome by considering both the network topology and narrowing the class of distributed systems to distributed registers. The work is based on methods of modeling distributed computing, particularly the model of space-time diagrams proposed by L. Lamport. This model allows us to introduce such a tool as logical clocks, including Lamport's logical clock algorithm. Unfortunately, Lamport's logical clock algorithm allows assigning a common timestamp to different events if they are concurrent. The paper proposes an algorithm that is a composition of Lamport's clock algorithm and the wave algorithm, which is not only a logical clock but also assigns different timestamps to different events. Thus, this algorithm provides a mechanism for the global numbering of entries of distributed ledger replicas. A problematic issue remains gaps in the series of ledger entry numbers. Thus, the paper proposes an effective mechanism for the global numbering of records of a distributed register and identifies a shortcoming of this mechanism. Further study is to identify specific conditions in terms of network topology that would ensure the absence of the mentioned shortcoming.

Cited by 0Open access

DCE (Distributed Computing Environment) based DTP (Distributed Transaction Processing)

Incheol Jeong, Young-Chul Lew · 2002

In this paper, we present the implementation of Hanuri/T based on TxRPC that is an open standard of the X/Open distributed transaction processing models. Hanuri/T satisfies the properties of transactions of a RPC(Remote Procedure Calls) required by TM(Transaction Manager). Hanuri/T processes distributed transaction based on the OSF (Open System Foundation)/DCE (Distributed Computing Environments) RPC protocols. We maintain a good level of portability between Hanuri/T by the adoption of OSF/DCE RPC and 2 phase commit protocols. Implementations of mechanisms for interoperability between heterogeneous TMs that are supported by any other middleware protocol still as future work.

Cited by 4

Transpeer: Adaptive Distributed Transaction Monitoring for

Idrissa Sarr, Hubert Naacke, Stéphane Gançarski · 2010

In emerging Web2.0 applications such as virtual worlds or social networking websites, the number of users is very im-portant (tens of thousands), hence the amount of data to manage is huge and dependability is a crucial issue. The large scale prevents from using centralized approaches or locking/two-phase-commit approach. Moreover, Web2.0 ap-plications are mostly interactive, which means that the re-sponse time must always be less than few seconds. To face these problems, we present a novel solution, TransPeer, that allows applications to scale-up without the need to buy ex-pensive resources at a data center. To this end, databases are replicated over a P2P system in order to achieve high availability and fast transaction processing thanks to paral-lelism. A distributed shared dictionary, implemented on top of a DHT, contains metadata used for routing transactions efficiently. Both metadata and data are accessed in an opti-mistic way: there is no locking on metadata and transactions are executed on nodes in a tentative way. We demonstrate the feasibility of our approaches through experimentation.

Cited by 0

OSI distributed transaction processing commitment optimizations

Richard Banks, Peter Furniss, Klaus Heien et al. · ACM SIGCOMM Computer Communication Review · 1998

This paper briefly summarizes the work towards the final version of 'Distributed Transaction Processing' (OSI TP). Several well-known optimizations of the presumed abort protocol are introduced: dynamic flow of READY-messages, a one-phase protocol, a read-only extension. Moreover, some useful extensions such as containment of heuristic decisions and reporting of the completion status of a transaction are presented. The requirements and the functionality are discussed especially from the user's point of view. Finally, the evolving requirements for distributed transaction processing are discussed given the increasing number of applications on the Internet (Electronic Commerce).

Cited by 1

Distributed Real-Time Transaction Commit Processing

Biao Qin · 2002

It is difficult for a distributed real-time transaction to satisfy its deadline because of the complexities of its commitment processing. A new commit protocol called A2SC (active double space commit) is proposed, which cater for the distributed real-time transaction commitment processing. All kinds of dependencies caused from data conflicts access are analyzed. When data conflicts between the prepared transaction and the execution transactions occur, A2SC allows the execution transactions to access the locked data optimistically in a controlled manner. When the prepared transaction aborts, only transactions in its abort dependency set are aborted. Furthermore, a notion of fruitless run is proposed. When a transaction finds fruitless run, it will actively abort. Extensive simulation experiments have been performed to compare the performance of the A2SC with other protocols such as the base protocol, the PROMPT and the DDCR. The simulation results show that A2SC is highly successful in minimizing the number of missed transactions deadlines. So A2SC caters for high-performance distributed real-time transaction.

Cited by 2