## Abstract

The reconfigurable mesh (RN-MESH) can solve a large class of problems in constant time, including problems that require logarithmic time by other, even shared memory, models such as the PRAM with a similar number of processors. In this work we show that for the RN-MESH these constants can always be reduced to one, still using a polynomial number of processors. Given a reconfigurable mesh that computes a set of values in constant time, we show that it can be simulated by a single step reconfigurable mesh with maximum size that is polynomial in the size of the original mesh. The proof is constructive, where the construction of the single step RN-MESH holds for the relatively weak undirected RN-MESH model. In this model broadcasts made on buses arrive at all nodes that belong to the undirected connected component of the transmitting processor. A result similar to the one that is obtained in this work was previously obtained for the directed reconfigurable mesh model (DRN). However, the construction for the DRN-MESH relies on the fact that the buses are directed, and thus cannot be applied to the undirected case. In addition, the construction presented here is simpler and uses significantly fewer processors than the one obtained for the DRN-MESH.

Original language | English |
---|---|

Pages | 284-289 |

Number of pages | 6 |

State | Published - 1997 |

Event | Proceedings of the 1997 4th International Conference on High Performance Computing, HiPC - Bangalore, India Duration: 18 Dec 1997 → 21 Dec 1997 |

### Conference

Conference | Proceedings of the 1997 4th International Conference on High Performance Computing, HiPC |
---|---|

City | Bangalore, India |

Period | 18/12/97 → 21/12/97 |

## ASJC Scopus subject areas

- Computer Science (all)