In this paper, we survey the state of the art in real-time emulations of various bounded-degree networks --- that is, where one bounded-degree network performs an arbitrary computation of some other network with only a constant-factor degradation in both space and time. The results use a variety of techniques, from simple embeddings of one network structure into another to quite complex general emulations using redundant computation. We also present new results on the emulation of area- and volume-universal networks and trees of meshes on butterfly networks. The results collected here give a complete view of current knowledge of the relative computational strength of many bounded-degree networks that have been considered as candidates for t...
AbstractIn this paper we show that for each n, the order-n shuffle-exchange network can be emulated ...
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with ...
This paper addresses the simulation of four networks whose underlying topology is a Cayley graph. Th...
Parallel algorithms are normally designed for execution on networks of N processors, with N dependin...
Parallel algorithms are normally designed for execution on networks of N processors, with N dependin...
AbstractUniform emulations are a method to obtain efficient, balanced simulations of large processor...
Parallel algorithms are normally designed for execution on networks of N processors, with N dependi...
Uniform emulations are a method to obtain efficient and structure-preserving simulations of large ne...
In this paper, we study the problem of emulating TG steps of an NG-node guest network, G, on an NH-n...
[[abstract]]Efficient emulations provide general methods to convert algorithms designed on a network...
[[abstract]]Efficient emulations provide general methods to convert algorithms designed on a network...
We present efficient emulations of the CRCW PRAM on a large class of processor interconnection netwo...
The emulation of a guest network G on a host network H is work-preserving and real-time if the ineff...
Abstract. The boolean hypercube is a particularly versatile network for parallel computing. It is we...
We discuss communication algorithms relevant for neural network modeling on distributed memory concu...
AbstractIn this paper we show that for each n, the order-n shuffle-exchange network can be emulated ...
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with ...
This paper addresses the simulation of four networks whose underlying topology is a Cayley graph. Th...
Parallel algorithms are normally designed for execution on networks of N processors, with N dependin...
Parallel algorithms are normally designed for execution on networks of N processors, with N dependin...
AbstractUniform emulations are a method to obtain efficient, balanced simulations of large processor...
Parallel algorithms are normally designed for execution on networks of N processors, with N dependi...
Uniform emulations are a method to obtain efficient and structure-preserving simulations of large ne...
In this paper, we study the problem of emulating TG steps of an NG-node guest network, G, on an NH-n...
[[abstract]]Efficient emulations provide general methods to convert algorithms designed on a network...
[[abstract]]Efficient emulations provide general methods to convert algorithms designed on a network...
We present efficient emulations of the CRCW PRAM on a large class of processor interconnection netwo...
The emulation of a guest network G on a host network H is work-preserving and real-time if the ineff...
Abstract. The boolean hypercube is a particularly versatile network for parallel computing. It is we...
We discuss communication algorithms relevant for neural network modeling on distributed memory concu...
AbstractIn this paper we show that for each n, the order-n shuffle-exchange network can be emulated ...
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with ...
This paper addresses the simulation of four networks whose underlying topology is a Cayley graph. Th...