dakramer@phoenix.princeton.edu (David Anthony Kramer) (10/05/89)
I am looking for benchmarks of FFT and matrix multiplication algorithms running on parallel machines such as CM, MPP, DAP etc, as well as on fast vector processors such as Crays, Cybers etc. I am particularly interested in how performance is affected by increase in the number of bits per data element. Are there any landmark papers in this area? I would also appreciate any actual data that someone may have measured off one or more actual machines. Thanks in advance David Kramer Department of Electrical Engineering Princeton University Princeton, NJ 08544 Internet, Bitnet: dakramer@olympus.princeton.edu "Statistics in the hands of an engineer are like a lamppost to a drunk--they're used more for support than illumination." --Bill Sangster, Dean of Engineering, Georgia Tech