Communication along shortest paths in a tree machine

@inproceedings{Presnell1981CommunicationAS,
  title={Communication along shortest paths in a tree machine},
  author={H. A. Presnell and Roy P. Pargas},
  booktitle={FPCA},
  year={1981}
}
A cellular binary tree machine proposed by Magó accommodates the parallelism inherent in the functional programming languages of Backus by simultaneously executing innermost applications. Data communication time on this machine is linear in the number of elements moved. This paper addresses the problem of permuting a vector of atomic elements stored in the… CONTINUE READING