Transactional memory: architectural support for lock-free data structures
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Lower bounds on the competitive ration for mobile user tracking and distributed job scheduling
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
The Arrow Distributed Directory Protocol
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Software transactional memory for dynamic-sized data structures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Toward a theory of transactional contention managers
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Optimal Oblivious Path Selection on the Mesh
IEEE Transactions on Computers
DiSTM: A Software Transactional Memory Framework for Clusters
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
HiPEAC '09 Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers
Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
A provably starvation-free distributed directory protocol
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Distributed Transactional Memory for General Networks
IPDPS '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium
| Hi-index | 0.00 |
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 ${\cal 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 ${\cal 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.