TY - GEN
T1 - Towards load balanced distributed transactional memory
AU - Sharma, Gokarna
AU - Busch, Costas
PY - 2012
Y1 - 2012
N2 - We consider the problem of implementing transactional memory in d-dimensional mesh networks. We present and analyze MultiBend, a novel load balanced directory-based protocol, which is designed for the data-flow distributed implementation of software transactional memory. It supports three basic operations, publish, lookup, and move, on a shared object. A pleasing aspect of MultiBend is that it is load balanced (minimizes maximum node and edge utilization) which is achieved by using paths of multiple bends in the mesh. This protocol guarantees an O(d 2 log n) approximation for the load and also for the distance stretch of move requests, where n is the number of nodes in the network. For fixed d, both the load and the move stretch are optimal within a constant and a loglog factor, respectively. It also guarantees O(d 2) approximation for lookup requests which is optimal within a constant factor for fixed d. To the best of our knowledge, this is the first distributed directory protocol that is load balanced.
AB - We consider the problem of implementing transactional memory in d-dimensional mesh networks. We present and analyze MultiBend, a novel load balanced directory-based protocol, which is designed for the data-flow distributed implementation of software transactional memory. It supports three basic operations, publish, lookup, and move, on a shared object. A pleasing aspect of MultiBend is that it is load balanced (minimizes maximum node and edge utilization) which is achieved by using paths of multiple bends in the mesh. This protocol guarantees an O(d 2 log n) approximation for the load and also for the distance stretch of move requests, where n is the number of nodes in the network. For fixed d, both the load and the move stretch are optimal within a constant and a loglog factor, respectively. It also guarantees O(d 2) approximation for lookup requests which is optimal within a constant factor for fixed d. To the best of our knowledge, this is the first distributed directory protocol that is load balanced.
UR - http://www.scopus.com/inward/record.url?scp=84867638906&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867638906&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-32820-6_41
DO - 10.1007/978-3-642-32820-6_41
M3 - Conference contribution
AN - SCOPUS:84867638906
SN - 9783642328190
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 403
EP - 414
BT - Parallel Processing - 18th International Conference, Euro-Par 2012, Proceedings
T2 - 18th International Conference on Parallel Processing, Euro-Par 2012
Y2 - 27 August 2012 through 31 August 2012
ER -