… We note that the high-level communication pattern and costs of the parallel 1D FFT mentioned
in [15] are closely related to those of our parallel 1D butterfly algorithm. Algorithm 4 was …

… Thus, we base our parallel butterfly peeling algorithm on the parallel bucketing-based
algorithm for k-core in Julienne [19]. In parallel, our butterfly peeling algorithm removes (peels) all …

… algorithm does not have the memory of an iterative process. To improve the movement
efficiency of parallel … planning of parallel robots, an improved butterfly optimization algorithm (…

… For the minimum variance metric, we will use a parallel version of the algorithm in Fig. 5. We
… Thus, we have an efficient parallel algorithm for general algorithms on a butterfly network, …

… Our checking algorithm needs to be more sophisticated than reaching expressions’ use of
IN and OUT. A naive calculation would not detect that a location had been freed twice, since …

… results of the parallel algorithm over its serial counterpart. Also included is a … of a parallel
algorithm using p processors, over a uniprocessor algorithm Ep = Sip efficiency of a parallel …

… algorithm for barrier synchronization that requires only read and write to shared store. The
algorithm … In Section 2, we describe the basic two processor barrier algorithm from the butterfly …

… a collection of BBN Butterfly™ Parallel Processors to conduct research in parallel systems and
… In the course of our work with the Butterfly we have ported three compilers, developed five …

… parallel computer. This paper will discuss a parallel strategy across time in generating a
half-butterfly … The result is a framework for a parallel algorithm for generating Half Butterfly Wing …

… Butterfly Network Sort (BNS) for sorting large data sets. A minimal version of the algorithm
Min-Max Butterfly is … The comparison of butterfly sorting with other algorithms:bitonic, odd-even …