Distributed transactional memory for general networks

A load balanced directory for distributed shared memory objects

“…MultiBend is different from previous DDPs, Arrow [11], Relay [28], Combine [5], Ballistic [14], Spiral [26], and algorithms of [9,2,8]. Although previous DDPs use some kind of hierarchical structures, their constructions are useful only to minimize stretch and they cannot be exploited to control congestion.…”

“…Constant-doubling × Hierarchical directory with independent sets Spiral [26] O(log 2 n · log D) O(log 2 n · log D) General × Hierarchical directory with sparse covers MultiBend (this paper)…”

“…The simulation is compared to two well-known DDPs, Arrow [11] and Ballistic [14]. Our choice of Arrow and Ballistic for the performance comparison among existing DDPs (Arrow [11], Relay [28], Combine [5], Ballistic [14], Spiral [26], Table 1 Comparison of DDPs with their performance bounds, where n, S, D, and l ≤ n respectively, are the number of nodes, stretch of the tree they use, the diameter of the network kind on which they operate, and the number of move operations. …”

“…The low stretch is achieved through a hierarchical directory which we first introduced in [26] for general networks and we adapted here for the mesh network. The load balancing is achieved through an oblivious routing approach (e.g., [17,6,7]) tailored to the ddimensional mesh; in particular, we use the oblivious routing algorithm in Busch et al [7].…”

“…We begin with some necessary definitions which are adapted from [26,7]. We represent a distributed network as a d-dimensional…”