A stochastic analysis of multidimensional networks with unidirectional or bidirectional links between nodes is presented. The analysis allows the development of an accurate model for examining the performance and cost trade-offs of different network configurations. The model is validated through simulation and does not rely on the simplifying assumptions of previous models. In addition, the model is valid for the hypercube network. Two new performance-based design constraints are introduced: constant maximum throughput and constant unity queue. These new constraints are fundamentally different than previous constraints, which are based on some characterization of hardware implementation costs. Both of the new constraints allow performance and cost comparisons of different network configurations to be made on the basis of an equal ability to handle a range of traffic load. Results under the new constraints clearly show that a low dimensional network, while offering the lowest message latency, must be significantly more expensive than a comparable high dimensional network and, in some cases, may be impractical to implement. In addition, the constraints demonstrate that performance is highly dependent on offered load.

This paper introduces a coarse-grained FPGA architecture that is specialized for high-performance Finite Impulse Response (FIR) filtering. The proposed architecture provides the flexibility of a DSP processor with performance and area efficiency similar to that of a custom ASIC design, while allowing all of the basic FIR design parameters, including coefficient precision, to be configured. Previous research has already shown that FPGAs can provide a high-performance alternative to DSP processors. Experimental comparisons in this paper show that the performance and area efficiency of the proposed architecture is similar to that of custom approaches across a wide range of filter sizes and configurations.

A stochastic analysis of multidimensional networks with unidirectional links between nodes is presented, which is more accurate than previous models and valid for the hypercube. The results are reconciled with those of previous researchers who have reported conflicting conclusions. In addition to the classic constraints of constant link width, pin-out, and bisection width, a new constraint, constant maximum throughput, is introduced. This constraint dramatizes the performance and cost trade-offs between different network topologies.