View in EDS

SIMULATING AN R-MESH ON AN LR-MESH IN CONSTANT TIME.

Saved in:
Bibliographic Details
Title: SIMULATING AN R-MESH ON AN LR-MESH IN CONSTANT TIME.
Authors: FERNÁNDEZ-ZEPEDA, JOSÉ ALBERTO1 fernan@cicese.mx, CÓRDOVA-FLORES, CARLOS ALBERTO1 cordovaf@cicese.mx, BOURGEOIS, ANU G.2 abourgeois@cs.gsu.edu
Source: International Journal of Foundations of Computer Science. Dec2008, Vol. 19 Issue 6, p1337-1354. 18p. 7 Diagrams.
Subjects: Research, Connection machines, Simulation games, Technology, Product attributes
Abstract: Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among these models, but they do have certain differences that can take the form of restrictions on configurations allowed. This paper presents a constant time simulation of an R-Mesh on an LR-Mesh (a restricted model of the R-Mesh), proving that in spite of the differences, the two models possess the same complexity. In other words, the LR-Mesh can simulate a step of the R-Mesh in constant time with a polynomial increase in size. This simulation is based on Reingold's algorithm to solve USTCON in log-space. The simulation is also the first to be executed in constant time. The only drawback of this simulation is that the resources required by the LR-Mesh to simulate the R-Mesh are quite big, which is not suitable for any practical application. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among these models, but they do have certain differences that can take the form of restrictions on configurations allowed. This paper presents a constant time simulation of an R-Mesh on an LR-Mesh (a restricted model of the R-Mesh), proving that in spite of the differences, the two models possess the same complexity. In other words, the LR-Mesh can simulate a step of the R-Mesh in constant time with a polynomial increase in size. This simulation is based on Reingold's algorithm to solve USTCON in log-space. The simulation is also the first to be executed in constant time. The only drawback of this simulation is that the resources required by the LR-Mesh to simulate the R-Mesh are quite big, which is not suitable for any practical application. [ABSTRACT FROM AUTHOR]
ISSN:01290541