dakramer@phoenix.princeton.edu (David Anthony Kramer) (03/20/90)
I am interested in determining the communications overhead on the Connection Machine. Does anybody have data for the time taken to do routing on permutations between PEs? Specific permutations, as well as general routing would be useful. Pointers to anything which may have been published would be appreciated. I will summarize the replies if there is sufficient interest. David Kramer Department of Electrical Engineering Princeton University Princeton, NJ 08544 Internet,Bitnet: dakramer@olympus.princeton.edu ------------------------------------------------------------------------ Life can be modelled as a hidden Markov process with infinite states and no a-priori knowlege of the probabability density functions. ------------------------------------------------------------------------