GraphTM: An Efficient Framework for Supporting Transactional Memory in a Distributed Environment

GraphTM: An Efficient Framework for Supporting Transactional Memory in a Distributed Environment
复制标题

GraphTM:分布式环境中支持事务内存的高效框架

DOI:
10.1145/3369740.3369774
复制
发表时间:
2020
期刊:
The 21st International Conference on Distributed Computing and Networking (ICDCN
影响因子:
--
通讯作者:
Sharma, Gokarna
Sharma, Gokarna
中科院分区:
--
文献类型:
--
作者:
Poudel, Pavan;Sharma, Gokarna

文献摘要

参考文献

被引文献

相似文献

在本文中,我们提出了GraphTM,一个有效的和可扩展的框架,在分布式环境中处理事务。分布式环境被建模为图,其中图的每个节点是发出事务的处理节点。事务用来执行的对象也在图节点上(初始位置可以是任意的)。事务在节点上执行,这些节点在收集了它们所需的所有对象之后,遵循计算的数据流模型发出事务。这种收集是通过在事务开始时立即发出对象请求并等待直到事务所需的所有对象到达请求节点来完成的。挑战在于如何调度事务,使得两个关键的性能指标,即(i)提交所有事务的总执行时间,以及(ii)将对象移动到请求节点所涉及的总通信成本最小化。我们在Java中实现了GraphTM,并通过STAMP基准测试套件中的3个微基准测试和5个复杂基准测试,在5种不同的网络拓扑结构上评估了其性能,即团,线,网格,集群和星星,这些网络拓扑结构为实践中常用的一组代表性分布式系统构建了底层通信网络。结果表明,我们的方法的效率和可扩展性。
In this paper, we present GraphTM, an efficient and scalable framework for processing transactions in a distributed environment. The distributed environment is modeled as a graph where each node of the graph is a processing node that issues transactions. The objects that transactions use to execute are also on the graph nodes (the initial placement may be arbitrary). The transactions execute on the nodes which issue them after collecting all the objects that they need following the data-flow model of computation. This collection is done by issuing the requests for the objects as soon as transaction starts and wait until all required objects for the transaction come to the requesting node. The challenge is on how to schedule the transactions so that two crucial performance metrics, namely (i) total execution time to commit all the transactions, and (ii) total communication cost involved in moving the objects to the requesting nodes, are minimized. We implemented GraphTM in Java and assessed its performance through 3 micro-benchmarks and 5 complex benchmarks from STAMP benchmark suite on 5 different network topologies, namely, clique, line, grid, cluster, and star, that make an underlying communication network for a representative set of distributed systems commonly used in practice. The results show the efficiency and scalability of our approach.
Hyflow2:Scala 中的高性能分布式事务内存框架
DOI: --
发表时间: 2013
期刊: Principles and Practice of Programming in Java
影响因子: --
作者:
Alexandru Turcu;B. Ravindran;R. Palmieri
通讯作者: R. Palmieri
$$hbox {TM}^{2}$$TM2C:多核软件事务内存
DOI: --
发表时间: 2012
期刊: European Conference on Computer Systems
影响因子: --
作者:
Vincent Gramoli;R. Guerraoui;Vasileios Trigonakis
通讯作者: Vasileios Trigonakis
分布式事务内存的时间通信不可能性结果
DOI: 10.1007/s00446-017-0318-y
发表时间: 2017
影响因子: 1.3
作者:
C. Busch;Maurice Herlihy;M. Popovic;Gokarna Sharma
通讯作者: Gokarna Sharma
当可扩展性满足一致性:真正的多版本更新-可序列化部分数据复制
DOI: 10.1109/icdcs.2012.55
发表时间: 2012
期刊: 2012 IEEE 32nd International Conference on Distributed Computing Systems
影响因子: --
作者:
Sebastiano Peluso;P. Ruivo;P. Romano;F. Quaglia;L. Rodrigues
通讯作者: L. Rodrigues
DOI: 10.1145/3087556.3087565
发表时间: 2017-07
影响因子: 0.5
作者:
C. Busch;Maurice Herlihy;M. Popovic;Gokarna Sharma
通讯作者: C. Busch;Maurice Herlihy;M. Popovic;Gokarna Sharma