
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

An Efficient ScalingSimulation Algorithm of Reconfigurable Meshes by Meshes with Statically Partitioned Buses
Susumu MATSUMAE
Publication
IEICE TRANSACTIONS on Information and Systems
Vol.E88D
No.1
pp.8288 Publication Date: 2005/01/01
Online ISSN: Print ISSN: 09168532 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: meshconnected computer, reconfigurable bus, statically partitioned bus, simulation,
Full Text: PDF(818.4KB) >>Buy this Article
Summary:
This paper presents an efficient scalingsimulation algorithm that simulates operations of the reconfigurable mesh (RM) of size n n using the mesh with multiple partitioned buses (MMPB) of size m m (m < n). The RM and the MMPB are the twodimensional meshconnected computers equipped with broadcasting buses. The broadcasting buses of the RM can be used to dynamically obtain various interconnection patterns among the processors during the execution of programs, while those of the MMPB are placed only to every row and column and are statically partitioned in advance by a fixed length. We show that the RM of size n n can be simulated in steps by the MMPB of size m m (m < n), where L is the number of broadcasting buses in each row/column of the simulating MMPB. Although the timecomplexity of our algorithm is less efficient than that of the fastest RM scalingsimulation algorithm, the simulating model of our algorithm is the MMPB model where the busreconfiguration is not allowed.

