Improved parallel prefix computation on optical multi-trees

A parallel algorithm for prefix computation was reported on a recently proposed interconnection network called optical multi-trees (OMULT). Using 2n³-n² processors, the algorithm was shown to run in O(log n)^A electronic moves +5 optical moves for n² data points. In this paper we present a new and improved parallel algorithm for prefix computation on the same network. Although the algorithm requires O(log n) electronic moves +4 optical moves using the same number of processors, the number of data points involved in our algorithm is n³ in contrast to n².