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

Gossip based fault tolerant protocol in distributed transactional memory using quorum based replication system

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2020年第2期23卷 1103-1124页

作者： Chatterjee, Moumita Mitra, Anirban Roy, Sudipta Setua, Sanjit Kumar Calcutta Univ Technol Campus Dept Comp Sci & Engn JD-2Sect 3 Kolkata 700098 India Acad Technol Dept Comp Sci & Engn Adisaptagram 712121 W Bengal India Washington Univ RCIL 510 South Kings Highway Blvd St Louis MO 63110 USA

Single copy distributed Software transactional memory protocol maintains only one replica of each object in the system and is therefore prone to failures in large scale dynamically changing network. In this paper we propose a replication model using quorum system for transactional memory protocol where communication among the nodes takes place using gossip. The previous protocols demand a static structure over the network. Maintenance of a static structure for a dynamic network requires a significant overhead. Our method executes on an unstructured network which does not require adaption in case of node joining and node leaving. The algorithm maintains the coherence of the objects and aims to achieve low communication cost while reducing execution time of the transactions. The algorithm achieves a message complexity ofOand time complexity ofO which is an improvement over previous replication protocols for distributed transactional memory. Simulation results shows that the method exhibits better fault tolerance and requires less number of messages than existing approaches.

关键词： distributed transactional memory Fault tolerance Replication Probabilistic quorum system Gossip protocol

来源：评论

学校读者我要写书评

暂无评论

CUDA-DTM: distributed transactional memory for GPU Clusters 7th

CUDA-DTM: Distributed Transactional Memory for GPU Clusters

引用

7th International Conference on Networked Systems (NETYS)

作者： Irving, Samuel Chen, Sui Peng, Lu Busch, Costas Herlihy, Maurice Michael, Christopher J. Louisiana State Univ Baton Rouge LA 70803 USA Brown Univ Providence RI 02912 USA

ISBN: (纸本)9783030312770;9783030312763

We present CUDA-DTM, the first ever distributed transactional memory framework written in CUDA for large scale GPU clusters. transactional memory has become an attractive auto-coherence scheme for GPU applications with irregular memory access patterns due to its ability to avoid serializing threads while still maintaining programmability. We extend GPU Software transactional memory to allow threads across many GPUs to access a coherent distributed shared memory space and propose a scheme for GPU-to-GPU communication using CUDA-Aware MPI. The performance of CUDA-DTM is evaluated using a suite of seven irregular memory access benchmarks with varying degrees of compute intensity, contention, and node-to-node communication frequency. Using a cluster of 256 devices, our experiments show that GPU clusters using CUDA-DTM can be up to 115x faster than CPU clusters.

关键词： distributed transactional memory GPU cluster CUDA

来源：评论

学校读者我要写书评

暂无评论

Supporting Multiple Data Replication Models in distributed transactional memory 15

Supporting Multiple Data Replication Models in Distributed T...

引用

16th International Conference on distributed Computing and Networking

作者： Silva, Joao A. Vale, Tiago M. Dias, Ricardo J. Paulino, Herve Lourenco, Joao M. Univ Nova Lisboa Fac Ciencias & Tecnol Dept Informat NOVA LINCSCITI P-2829516 Caparica Portugal

ISBN: (纸本)9781450329286

distributed transactional memory (DTM) presents itself as a highly expressive and programmer friendly model for con currency control in distributed programming. Current DTM systems make use of both data distribution and replication as a way of providing scalability and fault tolerance, but both techniques have advantages and drawbacks. As such, each one is suitable for different target applications, and deployment environments. In this paper we address the support of different data replication models in DTM. To that end we propose REDsTM, a modular and non-intrusive framework for DTM, that supports multiple data replication models in a general purpose programming language (Java). We show its application in the implementation of distributed software transactional memories with different replication models, and evaluate the framework via a set of well-known benchmarks, analysing the impact of the different replication models on memory usage and transaction throughput.

关键词： Data Replication distributed transactional memory Con-currency Control distributed Systems

来源：评论

学校读者我要写书评

暂无评论

distributed transactional memory for general networks

引用

distributed COMPUTING 2014年第5期27卷 329-362页

作者： Sharma, Gokarna Busch, Costas Louisiana State Univ Sch Elect Engn & Comp Sci Baton Rouge LA 70803 USA

We consider the problem of implementing transactional memory in large-scale distributed networked systems. We present Spiral, a novel distributed directory-based protocol for transactional memory, and theoretically analyze and experimentally evaluate it for the performance boundaries of this approach from the worst-case perspective. Spiral is designed for the data-flow distributed implementation of software transactional memory which supports three basic operations: publish, allowing a shared object to be inserted in the directory so that other nodes can find it;lookup, providing a read-only copy of the object to the requesting node;move, allowing the requesting node to write the object locally after the node gets it. The protocol runs on a hierarchical directory construction based on sparse covers, where clusters at each level are ordered to avoid race conditions while serving concurrent requests. Given a shared object the protocol maintains a directory path pointing to the object. The basic idea is to use "spiral" paths that grow outward to search for the directory path of the object in a bottom-up fashion. For general networks, this protocol guarantees an approximation in sequential and one-shot concurrent executions of a finite set of move requests, where is the number of nodes and is the diameter of the network. It also guarantees poly-log approximation for any single lookup request. Our bounds are deterministic and hold in the worst-case. Moreover, this protocol requires only polylogarithmic bits of memory per node. Experimental evaluations in real networks also confirm our theoretical findings. To the best of our knowledge, this is the first deterministic consistency protocol for distributed transactional memory that achieves poly-log approximation in general networks.

关键词： distributed transactional memory Cache-coherence Hierarchical clustering Sparse covers Competitive ratio General networks

来源：评论

学校读者我要写书评

暂无评论

distributed transactional memory for General Networks

Distributed Transactional Memory for General Networks

引用

26th IEEE International Parallel and distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Sharma, Gokarna Busch, Costas Srinivasagopalan, Srivathsan Louisiana State Univ Dept Comp Sci Baton Rouge LA 70803 USA

ISBN: (纸本)9780769546759

We consider the problem of implementing transactional memory in large-scale distributed networked systems. We present and analyze Spiral, a novel distributed directory-based protocol for transactional memory. Spiral is designed for the data-flow distributed implementation of software transactional memory which supports three basic operations: publish, allowing a shared object to be inserted in the directory so that other nodes can find it;lookup, providing a read-only copy of the object to the requesting node;move, allowing the requesting node to write the object locally after the node gets it. The protocol runs on a hierarchical directory construction based on sparse covers, where clusters at each level are ordered to avoid race conditions while serving concurrent requests. Given a shared object the protocol maintains a directory path pointing to the object. The basic idea is to use "spiral" paths that grow outward to search for the directory path of the object in a bottom-up fashion. For general networks, this protocol guarantees an O(log(2) n . log D) approximation for move requests, where n is the number of nodes and D is the diameter of the network. It also guarantees poly-log approximation for lookup requests. To the best of our knowledge, this is the first consistency protocol for distributed transactional memory that achieves poly-log approximation in general networks.

关键词： distributed transactional memory Cache-coherence Hierarchical clustering Stretch General network

来源：评论

学校读者我要写书评

暂无评论

Reliable ESB and distributed transactional memory for SOA

Reliable ESB and Distributed Transactional Memory for SOA

引用

5th International Symposium on Computational Intelligence and Design (ISCID)

作者： Sun Yong Ren Yi-zhi Zhejiang Inst Commun Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9780769548111

Service oriented architecture (SOA) is a paradigm for the realization and maintenance of business processes that span large distributed systems. Organizations often face difficulties when building the IT system based on SOA. The most common problem is poor reliability including service qualities and performance issues. In this article, we propose solutions to the problems described and merge them into a comprehensive architectural model for the reliable services provision in SOA. In order to overcome problems related to poor reliability, our architectural model requires the use of adjusted ESB (Enterprise Service Bus). Furthermore, we propose that all data transfer between web services and backend goes in form of TO (transactional Objects), which are accessed by transactions in distributed transactional memory and allow us a uniform data access and manipulation, regardless of the data source. As the best approach to improve performances of the data access, our model introduces caching in the system binding with TOs. The proposed model is also loosely coupled, which means that the organizations can use only parts of the whole solution that correspond to their specific needs.

关键词： SOA ESB distributed transactional memory SOA reliability idempotency ACID performance Cache

来源：评论

学校读者我要写书评

暂无评论

HyflowCPP: A distributed Software transactional memory Framework for C++

HyflowCPP: A Distributed Software Transactional Memory Frame...

引用

作者： Mishra, Sudhanshu Virginia Tech | University

The distributed transactional memory (DTM) abstraction aims to simplify the development of distributed concurrent programs. It frees programmers from the complicated and error-prone task of explicit concurrency control based on locks (e.g., deadlocks, livelocks, non-scalability, non-composability), which are aggravated in a distributed environment due to the complexity of multi-node concurrency. At its core, DTM’s atomic section-based synchronization abstraction enables the execution of a sequence of multi-node object operations with the classical serializability property, which significantly increases the programmability of distributed systems.

In this thesis, we present the first ever DTM framework for distributed concurrency control in C++, called HyflowCPP. HyflowCPP provides distributed atomic sections, and pluggable support for concurrency control algorithms, directory lookup protocols, contention management policies, and network communication protocols. The framework uses the Transaction Forwarding Algorithm (or TFA) for concurrency control. While there exists implementations of TFA and other DTM concurrency control algorithms in Scala and Java, and concomitant DTM frameworks (e.g., HyflowJava, HyflowScala, D2STM, GenRSTM), HyflowCPP provides a uniquely distinguishing TFA/DTM implementation for C++. Also, HyflowCPP supports strong atomicity, transactional nesting models including closed and open nesting (supported using modifications to TFA), and checkpointing.

We evaluated HyflowCPP through an experimental study that measured transactional throughput for a set of micro- and macro-benchmarks, and comparing with competitor DTM frameworks. Our results revealed that HyflowCPP achieves up to 600% performance improvement over competitor Java DTM frameworks including D2STM, GenRSTM, HyflowScala and HyflowJava, which can be attributed to the competitors’ JVM overhead and rudimentary networking support. Additionally, our experimental studies rev

关键词： distributed transactional memory transactional Framework C++ distributed Concurrency Thesis

来源：评论

学校读者我要写书评

暂无评论

Hybrid transactional Replication: State-Machine and Deferred-Update Replication Combined

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2018年第7期29卷 1499-1514页

作者： Kobus, Tadeusz Kokocinski, Maciej Wojciechowski, Pawel T. Poznan Univ Tech Inst Comp Sci PL-60965 Poznan Poland

We propose Hybrid transactional Replication (HTR), a novel replication scheme for highly dependable services. It combines two schemes: a transaction is executed either optimistically by only one service replica in the deferred update mode (DU), or deterministically by all replicas in the state machine mode (SM);the choice is made by an oracle. The DU mode allows for parallelism and thus takes advantage of multicore hardware. In contrast to DU, the SM mode guarantees abort-free execution, so it is suitable for irrevocable operations and transactions generating high contention. For expressiveness, transactions can be discarded or retried on demand. We prove that the higher flexibility of the scheme does not come at the cost of weaker guarantees for clients: HTR satisfies strong consistency guarantees akin to those provided by other popular transactional replication schemes such as Deferred Update Replication. We developed HTR-enabled Paxos STM, an object-based distributed transactional memory system, and evaluated it thoroughly under various workloads. We show the benefits of using a novel oracle that relies on machine learning techniques for automatic adaptation to changing conditions. The ML-based oracle, based on algorithms for the multi-armed bandit problem, provides up to 50 percent improvement in throughput when compared to the system running with DU-only or SM-only oracles.

关键词： State machine replication transactional replication deferred update distributed transactional memory

来源：评论

学校读者我要写书评

暂无评论

State-Machine and Deferred-Update Replication: Analysis and Comparison

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2017年第3期28卷 891-904页

作者： Wojciechowski, Pawel T. Kobus, Tadeusz Kokocinski, Maciej Poznan Univ Tech Inst Comp Sci PL-60965 Poznan Poland

In the paper, we analyze and experimentally compare two popular replication schemes relying on atomic broadcast: state machine replication (SMR) and deferred update replication (DUR). We estimate the lower bounds on the time of executing requests by the SMR and DUR systems running on multi-core servers. We also consider variants of systems that can process read-only requests with a lower overhead. In the analysis of DUR, we consider conflict patterns. We then formally show the scalability of SMR and DUR, which reflects the capacity of systems to effectively utilize an increasing number of processor cores. Next, we compare SMR and DUR experimentally under different levels of contention, using several benchmarks. We show throughput, abort rate (in DUR), and network congestion. The key results of our work are that neither system is superior in all cases, and that the theoretical and experimental results are heavily influenced by the dominance of either the CPU execution time or atomic broadcast time. We therefore propose to combine both replication schemes and gain the best of both worlds.

关键词： State machine replication deferred update replication distributed transactional memory

来源：评论

学校读者我要写书评

暂无评论

HiperTM: High performance, fault-tolerant transactional memory

引用

THEORETICAL COMPUTER SCIENCE 2017年 688卷 86-102页

作者： Hirve, Sachin Palmieri, Roberto Ravindran, Binoy Virginia Tech Blacksburg VA 24061 USA

We present HiperTM, a high performance active replication protocol for fault-tolerant distributed transactional memory. The active replication processing paradigm allows transactions to execute locally, costing them only a single network communication step during transaction execution. Shared objects are replicated across all sites, avoiding remote object accesses. Replica consistency is ensured by a) OS-Paxos, an optimistic atomic broadcast layer that total-orders transactional requests, and b) SCC, a local speculative multi-version concurrency control protocol that enforces a commit order equivalent to transactions' delivery order. SCC executes write transactions serially without incurring any synchronization overhead, and runs read-only transactions in parallel (to write transactions) with non-blocking execution and abort-freedom. Our implementation reveals that HiperTM guarantees 0% of out-of-order optimistic deliveries and performance up to 3.5x better than atomic broadcast-based competitor (PaxosSTM) using the standard configuration of TPC-C benchmark. (C) 2016 Elsevier B.V. All rights reserved.

关键词： distributed transactional memory Fault-tolerance Speculative processing State-machine replication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：