Parallel Processing with the Perfect Shuffle
IEEE Transactions on ComputersPublished 1 February 1971
Harold S. Stone
Citations1,254
SJR quartileQ1
SJR score1.16
SNIP1.61
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to aperfect shuffle of a deck of cards.
Abstract
Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to a perfect shuffle of a deck of cards. Elements of the first half of the vector are interlaced with elements of the second half in the perfect shuffle of the vector.
Keywords
Computer ScienceEngineering
Mathematics of ComputationAn algorithm for the machine calculation of complex Fourier series
12,195 Citations1965J.W. Cooley, John W. Tukey
Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Sorting networks and their applications
2,400 Citations1968Kenneth E. Batcher
To achieve high throughput rates today's computers perform several operations simultaneously; not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently.
IEEE Transactions on ComputersThe ILLIAC IV Computer
524 Citations1968Greg Barnes, Rebecca M. Brown +4 more
The structure of ILLIAC IV, a parallel-array computer containing 256 processing elements, is described, special features include multiarray processing, multiprecision arithmetic, and fast data-routing interconnections.
Journal of the ACMAn Adaptation of the Fast Fourier Transform for Parallel Processing
380 Citations1968Marshall C. Pease
A modified version of the Fast Fourier Transform is developed and described and it is suggested that this form is of general use in the development and classification of various modifications and extensions of the algorithm.
Communications of the ACMAlgorithm 245: Treesort
239 Citations1964Robert W. Floyd
C o m m e n t M[i]:n is moved upward in the subtree of M[l :n] of which it is the root and is moved upward in the subtree of M[l :n] of which it is the root.
The SOLOMON computer
158 Citations1962Daniel L. Slotnick, W. Carl Borck +1 more
The SOLOMON (Simultaneous Operation Linked Ordinal Modular Network), a parallel network computer, is a new system involving the interconnections and programming, under the supervision of a central control unit, of many identical processing elements in an arrangement that can simulate directly the problem being solved.
Communications of the ACMAlgorithm 63: partition
78 Citations1961C. A. R. Hoare
The procedures RANGESUB, RANGEMPY, and RANGEDVD provide for the remaining fundamental operations in range ari thmetic, and real a, b, c, d, e, f is a non-local real procedure.