By Topic

Optimal simulation of meshes with dynamically separable buses by meshes with statically partitioned buses

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Matsumae, S. ; Dept. of Inf. Syst., Tottori Univ. of Environ. Studies, Japan

This paper studies the simulation problem of meshes with separable buses (MSB) by meshes with multiple partitioned buses (MMPB). The MSB and the MMPB are the mesh-connected computers enhanced by the addition of broadcasting buses along every row and column. The broadcasting buses of the MSB, called separable buses, can be dynamically sectioned into smaller bus segments by program control, while those of the MMPB, called partitioned buses, are statically partitioned in advance. In the MSB model, each row/column has only one separable bus, while in the MMPB model, each row/column has L partitioned buses (L ≥ 1). We present an algorithm that simulates the MSB of size n × n in O (n1(2L+1)/) steps using the MMPB of size n × n, and prove that the time-complexity of the algorithm is optimal in the worst case.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004