Simulation of PRAM models on meshes

Packet Routing in Fixed-Connection Networks: A Survey

“…In these papers, it is assumed that the network is completely connected (by an optical crossbar switch). Other authors have dealt with bounded degree networks [105,244] or even with simulations on meshes and mesh-like networks [106,187,245,246]. More recently, the focus appears to be no longer on achieving even faster simulations (in [57], a step of a PRAM with N processors is simulated with a delay of O(log log log N } log* N) only), but on more diverse aspects such as fault tolerant simulations [25] and simulations on reconfigurable networks [58].…”

“…By putting nodes on the outside one gets the coated mesh; one can save substantially on the costs of the hardware, without losing much of the computation power. Such architectures are also particularly suited for PRAM simulations [43,187]. Various routing problems are considered in [44].…”

Towards programming on the moving threads architecture

“…Many kinds of architectural solutions satisfying the above have been proposed; see e.g. [4,8,11,13,14]. The internal structure of a scalable network should be such that simple routing nodes are connected to each other with constant length connections and have constant degree.…”

“…Such an architecture is called sparse. We have proposed such architectures in [4,8,11]. The architecture of Eclipse [3] is a 3-dimensional sparse mesh that has been flattened on a 2-dimensional plane (its connections are only between physically neighboring components).…”

Solving fundamental problems on sparse-meshes

“…In comparison with other networks, we have a very simple interconnection network that can be produced easily and is scalable without any problems. The sparsemesh is very similar to the Parallel Alternating Direction Machine, PADAM, considered in [3], [4] and the coatedmesh considered in [12]. Though similar in inspiration, the sparse-mesh is simpler.…”