This paper concerns the computational aspects of the reconfigurable network model. The computational power of the model is investigated under several network topologies and assuming several variants of the model. In particular, it is shown that there are reconfigurable machines based on simple network topologies, that are capable of solving large classes of problems in constant time. These classes depend on the kinds of switches assumed for the network nodes. Reconfigurable networks are also compared with various other models of parallel computation, like PRAM’s and Branching Programs.
|Title of host publication||Automata, Languages and Programming - 18th International Colloquium, Proceedings|
|Editors||Javier Leach Albert, Mario Rodriguez Artalejo, Burkhard Monien|
|Number of pages||12|
|State||Published - 1991|
|Event||18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 - Madrid, Spain|
Duration: 8 Jul 1991 → 12 Jul 1991
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991|
|Period||8/07/91 → 12/07/91|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)