In this paper we present a 4-systolic algorithm for broadcasting, in the one-port model, in an undirected d-dimensional (d even) wrapped butterfly. We prove that the broadcast time for the algorithm is no more than 5d/2 — 2, hence making it the fastest known algorithm of this nature for broadcasting in a wrapped butterfly.
This algorithm was first proposed by Dr. André Raspaud at Université Bordeaux 1, France, conveyed to Dr. Joseph G. Peters
at Simon Fraser University, Canada, and subsequently conveyed to us by Dr. Sunil Shende at Rutgers University at Camden, New
Jersey, USA.