### Optimal simulations between mesh-connected arrays of processorsOptimal simulations between mesh-connected arrays of processors

Access Restriction
Subscribed

 Author Kosaraju, S. Rao ♦ Atallah, Mikhail J. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1988 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract Let $\textit{G}$ and $\textit{H}$ be two mesh-connected arrays of processors, where $\textit{G}$ = $\textit{g}1,$ X $\textit{g}2$ X … X $\textit{g}1,$ $\textit{H}$ = $\textit{h}1$ x $\textit{h}2$ x … x $\textit{hd},$ and $\textit{g}1$ … $\textit{g1}$ ≤ $\textit{h}1$ … $\textit{hd}.$ The problem of simulating $\textit{G}$ by $\textit{H}$ is considered and the best possible simulation in terms of the $\textit{gi}'s$ and $\textit{hi}'s$ is characterized by giving such a simulation and proving its optimality in the worst-case sense. Also the same bound on the average cost of encoding the edges of $\textit{G}$ as distinct paths in $\textit{H}$ is established. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1988-06-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 35 Issue Number 3 Page Count 16 Starting Page 635 Ending Page 650

#### Open content in new tab

Source: ACM Digital Library