Access and Alignment of Data in an Array Processor
From MaRDI portal
Publication:4094382
DOI10.1109/T-C.1975.224157zbMath0328.68034MaRDI QIDQ4094382
Publication date: 1975
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Formal languages and automata (68Q45) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)
Related Items
Performance analysis of augmented partitioned multistage interconnection networks, A unified theory of interconnection network structure, Self-routing control algorithms and the passability of random inputs by the base-line network, Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks, A graph theoretical approach to equivalence of multistage interconnection networks, The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks, Universality of iterated networks, A method of batching conflict routings in shuffle-exchange networks, A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area, Efficient address generation in a parallel processor, A reliable and fault-tolerant interconnection network, THE VECTOR MULTIPROCESSOR, Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers, A \(d\)-move local permutation routing for the \(d\)-cube, Parallel stereocorrelation on a reconfigurable multi-ring network., The computation and communication complexity of a parallel banded system solver, An implementation of a nonlinear skewing scheme, Perfect Latin squares, A theory of decomposition into prime factors of layered interconnection networks, All-to-all personalized exchange in generalized shuffle-exchange networks, Systolic arrays for multidimensional discrete transforms, Permuting data with the Omega network, Rotator design, Analyzing permutation capability of multistage interconnection networks with colored Petri nets, Strict-sense nonblocking conditions for the \(\log_2 N - 1\) multirate switching fabric for the discrete bandwidth model, Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties, A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures, Bounds on evacuation time for deflection routing, A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks, A generalization of the perfect shuffle, A general performance analysis method for uniform memory architectures
