Efficient self simulation algorithms for reconfigurable arrays

Yosi Ben-Asher, Dan Gordon, Assaf Schuster

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Perhaps the most basic question concerning a model for parallel computation is the self simulation problem: given an algorithm which is designed for a large machine, can it be executed efficiently on a smaller one? In this work we give several positive answers to the serf simulation problem on dynamically reconfigurable meshes. We show that the simulation of a reconfiguring mesh by a smaller one cast be carried optimally by using standard methods, on meshes such that buses axe established along rows or along columns. A novel technique is shown to achieve asymptotically optimal self simulation on models which allow buses to switch column and row edges, provided that a bus is a “linear” path of connected edges. Finally, for models in which a bus is any sub-graph of the underlying mesh efficient simulations are presented, paying by an extra factor which is polylogarithmic in the size of the simulated mesh. Although the self simulation algorithms are complex and require extensive bookkeeping operations, the required space is asymptotically optimal.

Original languageEnglish
Title of host publicationAlgorithms ESA 1993 – 1st Annual European Symposium, Proceedings
EditorsThomas Lengauer
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540572732
StatePublished - 1993
Event1st Annual European Symposium on Algorithms, ESA 1993 - Bad Honnef, Germany
Duration: 30 Sep 19932 Oct 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume726 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference1st Annual European Symposium on Algorithms, ESA 1993
CityBad Honnef

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Efficient self simulation algorithms for reconfigurable arrays'. Together they form a unique fingerprint.

Cite this