Paper Info
Title
Polylogarithmic time simulation of reconfigurable row/column buses by static buses
Abstract
This paper studies the difference in computational power between the mesh-connected parallel computers equipped with dynamically reconfigurable bus systems and those with static ones. The mesh with separable buses (MSB) is the mesh-connected computer with dynamically reconfigurable row/column buses. The broadcasting buses of the MSB can be dynamically sectioned into smaller bus segments by program control. We examine the impact of reconfigurable capability on the computational power of the MSB model, and investigate how computing power of the MSB decreases when we deprive the MSB of its reconfigurability. We show that any single step of the MSB of size n × n can be simulated in O (log n) time by the MSB without its reconfigurable function, which means that the MSB of size n × n can work with O (log n) step slowdown even if its dynamic reconfigurable function is disabled.
Year
DOI
Venue
2010
10.1109/IPDPSW.2010.5470834
Parallel & Distributed Processing, Workshops and Phd Forum
Keywords
Field
DocType
computational complexity,parallel processing,reconfigurable architectures,system buses,MSB,broadcasting buses,computational complexity,computational power,dynamic reconfigurable function,dynamically reconfigurable bus systems,mesh with separable buses,mesh-connected computer,mesh-connected parallel computers,polylogarithmic time simulation,program control,reconfigurable capability,reconfigurable column buses,reconfigurable row buses,static buses,dynamically reconfigurable bus,polylogarithmic time simulation,processor array,statically partitioned bus
Broadcasting,Row and column spaces,Binary logarithm,Reconfigurability,Polynomial,Processor array,Computer science,Parallel computing,Concurrent computing,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
978-1-4244-6533-0
2
0.45
References 
Authors
5
1
Name
Order
Citations
PageRank
Susumu Matsumae120.45