Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
The complexity of reconfiguring network models
Information and Computation
On the power of segmenting and fusing buses
Journal of Parallel and Distributed Computing
String matching on multicontext FPGAs using self-reconfiguration
FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
Genetic Programming Using Self-Reconfigurable FPGAs
FPL '99 Proceedings of the 9th International Workshop on Field-Programmable Logic and Applications
A Self-Reconfigurable Gate Array Architecture
FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Configuring the Circuit Switched Tree for Multiple Width Communications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Power-aware routing for well-nested communications on the circuit switched tree
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The self-reconfigurable gate array (SRGA) architecture consists of an array of processing elements connected by row and column trees. In this paper, we study the communication capability of this interconnection fabric. We derive a necessary condition for any set of k one-to-one communications to be performed in t steps, for any 1 驴 t 驴 k. Next we identify a property of the communication set, called partitionability, for which this necessary condition is sufficient as well. Then we show two classes of communication sets to possess this property. As a special case of one of these results, we show that the set of 1-step communications of a segmentable bus requires at most two steps on the SRGA architecture. This result implies that the communication ability of the bit model HV-R-Mesh, a special case of the bit model R-Mesh, can be emulated by the SRGA architecture without signifficant overhead.