Faster column operations in star networks

Document Type



Using the methods used to obtain O(log N) routings of permutations, basic algorithms on the star graph which are faster than those previously reported in the literature are obtained. In particular, an O(log2 N) sort and an O(log N) Fourier transform are presented. A simulation of meshes is also given.


Applied Mathematics | Computer and Systems Architecture | Digital Circuits | Non-linear Dynamics


Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.