A Unified theory of interconnection network structure
Theoretical Computer Science
The warp computer: Architecture, implementation, and performance
IEEE Transactions on Computers
Problem size, parallel architecture, and optimal speedup
Journal of Parallel and Distributed Computing
Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications
IEEE Transactions on Computers
Performance Prediction and Calibration for a Class of Multiprocessors
IEEE Transactions on Computers
Speedup Versus Efficiency in Parallel Systems
IEEE Transactions on Computers
Performance-Measurement Tools in a Multiprocessor Environment
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
An analytical approach to performance/cost modeling of parallel computers
Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
The tree machine: a highly concurrent computing environment
The tree machine: a highly concurrent computing environment
Systolic Opportunities for Multidimensional Data Streams
IEEE Transactions on Parallel and Distributed Systems
An Analysis of the Cost Effectiveness of an Adaptable Computing Cluster
Cluster Computing
| Hi-index | 0.00 |
Speedup and efficiency, two measures for performance of pipelined computers, are nowused to evaluate performance of parallel algorithms for multiprocessor systems. However, these measures consider only the computation time and number of processors used and do not include the number of the communication links in the system. The author defines two new measures, cost effectiveness and time-cost effectiveness, for evaluatingperformance of a parallel algorithm for a multiprocessor system. From these two measures two characterization factors for multiprocessor systems are defined and used to analyze some well-known multiprocessor systems. It is found that for a given penalty function, every multiprocessor architecture has an optimal number of processors that produces maximum profit. If too many processors are used, the higher cost of the system reduces the profit obtained from the faster solution. On the other hand, if too few processors are used, the penalty paid for taking a longer time to obtain the solution reduces the profit.