Evaluating parallel architectures for two real-time applications with 100 kHz repetition rate (hadron collider data)

In the context of research and development activities for future hadron colliders, competitive implementations of real-time algorithms for feature extraction have been made on various forms of commercial pipelined and parallel architectures. The algorithms used for benchmarking serve for decision making and are of relative complexity; they are required to run with a repetition rate of 100 kHz on data sets of kilobyte size. Results are reported and discussed in detail. Among the commercially available architectures, pipelined image processing systems can compete with custom-designed architectures. General-purpose processors with systolic mesh connectivity can also be used. Massively parallel systems of the SIMD type (many processors executing the same program on different data) are less suitable in the presently marketed form. >

[1]  Shekhar Y. Borkar,et al.  iWarp: an integrated solution to high-speed parallel computing , 1988, Proceedings. SUPERCOMPUTING '88.

[2]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[3]  R. K. Bock,et al.  Fine-grain parallel computer architectures in future triggers , 1990 .

[4]  Ulrich Dr Ing Schmidt,et al.  Data-driven array processor for video signal processing , 1990 .

[5]  R. M. Lea,et al.  ASP: a cost-effective parallel microcomputer , 1988, IEEE Micro.

[6]  Edward W. Davis,et al.  BLITZEN: a highly integrated massively parallel machine , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.

[7]  James Sutton,et al.  iWarp: a 100-MOPS, LIW microprocessor for multicomputers , 1991, IEEE Micro.

[8]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[9]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.