Ultracomputers
ACM Transactions on Programming Languages and SystemsPublished 1 October 1980
Jacob T. Schwartz
Citations288
SJR quartileQ2
SJR score0.56
SNIP1.52
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.
Abstract
A class of parallel processors potentially involving thousands of individual processing elements is described. The architecture is based on the perfect shuffle connection and has two favorable characteristics: (1) Each processor communicates with a fixed number of other processors. (2) Important communication functions can be accomplished in time proportional to the logarithm of the number of processors. A number of basic algorithms for these “ultracomputers” are presented, and physical design considerations are discussed in a preliminary fashion.
Keywords
Computer Science
Bell System Technical JournalA Study of Non-Blocking Switching Networks
1,721 Citations1953Charles Clos
IEEE Transactions on ComputersParallel Processing with the Perfect Shuffle
1,254 Citations1971Harold S. Stone
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.
IEEE Transactions on ComputersA Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
1,244 Citations1973Peter M. Kogge, Harold S. Stone
This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Iliac IV.
IEEE Transactions on ComputersAccess and Alignment of Data in an Array Processor
1,119 Citations1975Duncan H. Lawrie
This paper discusses the design of a primary memory system for an array processor which allows parallel, conflict-free access to various slices of data, and subsequent alignment of these data for processing, and a network based on Stone's shuffle-exchange operation is presented.
Journal of Computer and System SciencesParallel program schemata
984 Citations1969Richard M. Karp, Raymond E. Miller
This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing, related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation.
Proceedings of the IEEEVery high-speed computing systems
943 Citations1966Michael Flynn
The constituents of a system: storage, execution, and instruction handling (branching) are discussed with regard to recent developments and/or systems limitations.
Journal of the ACMThe Parallel Evaluation of General Arithmetic Expressions
818 Citations1974Richard P. Brent
It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.
Communications of the ACMThe parallel execution of DO loops
605 Citations1974Leslie Lamport
Methods are developed for the parallel execution of different iterations of a DO loop and practical application to the design of compilers for such computers is discussed.
Journal of the ACMThe Organization of Computations for Uniform Recurrence Equations
554 Citations1967Richard M. Karp, Raymond E. Miller +1 more
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 ACMA Permutation Network
444 Citations1968Abraham Waksman
The construction of a switching network capable of n-permutation of its input terminals to its output terminals is described and an algorithm is given for the setting of the binary cells in the network according to any specified permutation.
IEEE Transactions on Electronic ComputersAnalysis of Programs for Parallel Processing
424 Citations1966A. J. Bernstein
A set of conditions are described which determine whether or not two successive portions of a given program can be performed in parallel and still produce the same results.
SIAM Journal on ComputingParallelism in Comparison Problems
400 Citations1975Leslie G. Valiant
The worst-case time complexity of algorithms for multiprocessor computers with binary comparisons as the basic operations is investigated and the algorithm for finding the maximum is shown to be optimal for all values of k and n.
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.
SIAM ReviewA Survey of Parallel Algorithms in Numerical Linear Algebra
338 Citations1978Don Heller
A comprehensive survey of parallel techniques for problems in linear algebra is given, specific topics include: relevant computer models and their consequences for programs, evaluation of arithmetic expressions, solution of general and special linear systems of equations, and computation of eigenvalues.
Journal of the ACMAn Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
319 Citations1973Harold S. Stone
An efficient parallel algorithm is presented in which computation time grows as log 2, which can be used to solve recurrence relations of all orders.
Bell System Technical JournalOptimal Rearrangeable Multistage Connecting Networks
300 Citations1964Vladimír Beneš
By using a large number of stages, these designs achieve a far greater combinatorial efficiency than has been attained heretofore.
IEEE Transactions on ComputersThe Organization and Use of Parallel Memories
288 Citations1971Paul P. Budnik, David J. Kuck
As computer CPUs get faster, primary memories tend to be organized in parallel banks, and important questions of design and use of such memories are discussed.
Journal of the ACMOn Stable Parallel Linear System Solvers
258 Citations1978Ahmed Sameh, David J. Kuck
Three stable parallel algorithms for solving dense and tndlagonai systems of lmear equations are discussed and one of the algorithms presented here is superior to the best previous algorithm in that with a modest increase in time.
IEEE Transactions on ComputersBitonic Sort on a Mesh-Connected Parallel Computer
255 Citations1979Nassimi, Sahni
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented and is an adaptation of Batcher's bitonic sort.
Bell System Technical JournalOn a Class of Rearrangeable Switching Networks Part I: Control Algorithm
251 Citations1971D. C. Opferman, N. Tsao-Wu
An algorithm is developed to control a class of rearrangeable switching networks, particularly with the base-2 structure, and system organization and processing time for rearranging the network are studied and are shown to be practical.
Journal of the ACMScheduling Parallel Computations
229 Citations1968Raymond Reiter
A model for parallel computations is given as a directed graph in which nodes represent elementary operations, and branches, data channels, and an algorithm is given for the determination of the number of initiations of each node in the graph defining a parallel computation.
Communications of the ACMParallel methods for integrating ordinary differential equations
204 Citations1964J. Nievergelt
This paper is dedicated to the proposition that, in order to take full advantage for real-time computations of highly parallel computers as can be expected to be available in the near future, much of numerical analysis will have to be recast in a more “parallel” form.
IEEE Transactions on ComputersReal-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
195 Citations1969Stephen N. Cole
An n-dimensional iterative array of finite-state machines is formally introduced as a real-time tape acceptor and the computational characteristics of iterative arrays are illuminated by establishing several results concerning the sets of tapes that they recognize.
ACM Computing SurveysComputer Interconnection Structures: Taxonomy, Characteristics, and Examples
189 Citations1975George A. Anderson, E. Douglas Jensen
This paper presents a taxonomy, or naming scheme, for systems of interconnected computers, based on interprocessor message handling and hardware interconnection topology, and distinguishes ten basic multiple-computer architectures.
IEEE Transactions on ComputersCellular Logic-in-Memory Arrays
175 Citations1969William H. Kautz
As a direct consequence of large-scale integration, many advantages in the design, fabrication, testing, and use of digital circuitry can be achieved if the circuits can be arranged in a two-dimensional iterative, or cellular, array of identical elementary networks, or cells.
IEEE Transactions on ComputersNew Parallel-Sorting Schemes
160 Citations1978Preparata
A family of parallel-sorting algorithms for a multiprocessor system that is enumeration sortings and includes the use of parallel merging to implement count acquisition, matching the performance of Hirschberg's algoithm, which, however, is not free of fetch conflicts.
Mathematics of ComputationParallel methods for the numerical integration of ordinary differential equations
159 Citations1967Willard L. Miranker, Werner Liniger
A class of numerical integration formulas of a parallel type for ordinary differential equations may be used simultaneously on a set of arithmetic processors to increase the integration speed.
Journal of the ACMBounds to Complexities of Networks for Sorting and for Switching
157 Citations1975David E. Muller, Franco P. Preparata
A network which sorts n numbers when used to sort numbers of only two sizes, 0 and 1, can be regarded as forming the n frontal (unate) symmetric boolean functions of n arguments.
ACM Transactions on Mathematical SoftwareParallel Tridiagonal Equation Solvers
153 Citations1975Harold S. Stone
Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations, and cyclic odd-even reduction appears to be the most preferable algorithm for all cases.
Mathematics of ComputationOn Jacobi and Jacobi-like algorithms for a parallel computer
138 Citations1971Ahmed Sameh
ACM Transactions on Mathematical SoftwareThe Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
129 Citations1975J. J. Lambiotte, Robert G. Voigt
The problem of solving tridmgonal linear systems on vector computers is considered and implementations of several direct and lterative methods are given for the Control Data Corporatlon STAR-100 computer.
Journal of the ACMOn the Time Required to Perform Addition
112 Citations1965S. Winograd
If the group operation is adding integers modulo t~, it is shown that the lower bound behaves as log log a(t~), where a(,) is the largest power of a prime which divides ~.4bslracl.
IEEE Transactions on Electronic ComputersParallel Processing in a Restructurable Computer System
112 Citations1963Gerald Estrin, B. Bussell +2 more
This paper describes the organization, programming, and hardware of a variable structure computer system presently under construction at UCLA.
IEEE Transactions on ComputersA Shuffle-Exchange Network with Simplified Control
102 Citations1976Tomás Lang, Harold S. Stone
It is shown that the shuffle-exchange interconnection network permits the efficient partitioning of an array computer into subarrays to allow for the simultaneous computation of several identical problems.
Communications of the ACMFast parallel sorting algorithms
97 Citations1978D. S. Hirschberg
A parallel bucket-sort algorithm is presented that requires time O(log log n) and the use of n processors and makes use of a technique that requires more space than the product of processors and time.
NetworksOn non‐blocking switching networks
96 Citations1971David G. Cantor
It is shown that σ(a, a) ⩽ C ae2√log a·log 2.2 shows the minimal number of switches necessary to connect a inputs to b outputs using a non-blocking network.
Journal of Computer and System SciencesOptimal algorithms for parallel polynomial evaluation
96 Citations1973Ian Munro, Michael S. Paterson
IBM Journal of Research and DevelopmentParallel Solution of Recurrence Problems
95 Citations1974Peter M. Kogge
It is shown that if the recurrence function f has associated with it two other functions that satisfy certain composition properties, then it can be constructed elegant and efficient parallel algorithms that can compute all N elements of the series in time proportional to ⌈log2N⌉.
SIAM ReviewA Survey of Parallelism in Numerical Analysis
95 Citations1971W. L. Miranker
A survey of a number of studies of aspects of parallelism in numerical analysis dealing with optimization, root finding, differential equations and solutions of linear systems is presented here.
IEEE Transactions on ComputersTime and Parallel Processor Bounds for Linear Recurrence Systems
94 Citations1975Shyh-Ching Chen, David J. Kuck
By a simple transformation, the results can also be applied to the solution of any triangular linear system of equations Ax̄ = b̄, and the computer need only perform one type of operation at each time step.
IEEE Transactions on ComputersInterconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
94 Citations1976Lang
A network is proposed that permits the realization of any permutation in 0([mi][/mi]N) shuffle-exchange steps and an efficient procedure is described for the realizing of a shuffle permutation of N elements on an array computer with M memory modules where M < N.
Journal of the ACMAlgorithms for Parallel-Search Memories
94 Citations1962Adin D. Falkoff
It is shown that there is a hierarchy of dependency among these algorithms, that they appear in pairs with each member of a pair belonging to one or the other of two distinct classes, and that every type of search can be executed within each class.
IEEE Transactions on ComputersGeneralized Connection Networks for Parallel Processor Intercommunication
94 Citations1978Thompson
This paper demonstrates an intimate connection between the problems of GCN construction, message routing on SIMD computers, and "resource partitioning" as well as the minimal known construction of Ofman's GCN.
IEEE Transactions on ComputersCellular Interconnection Arrays
93 Citations1968William H. Kautz, Karl Levitt +1 more
Various network forms are described, differing in the number of cells needed, in the shape of the array, and in the length and regularity of intercell connections, which are some ways of setting up the array to achieve a desired permutation.
IEEE Transactions on ComputersA Comparison of Some Theoretical Models of Parallel Computation
91 Citations1973Raymond E. Miller
This paper describes and compares a number of theoretical models for parallel computation; namely, Petri nets, computation graphs, and parallel program schemata, and shows how marked graphs, a particular type of Petri net, are a restricted type of computation graph.
Information Processing LettersMatrix multiplication by diagonals on a vector/parallel processor
90 Citations1976Niel K. Madsen, Garry Rodrigue +1 more
A new algorithm for matrix multiplication is presented which is readily “‘vectorizetl”, is very efficient for narrow banded matrices, and allows for the transpose to be easily accessible in a vector form.
SIAM Journal on Numerical AnalysisSolving Triangular Systems on a Parallel Computer
88 Citations1977Ahmed Sameh, Richard P. Brent
In this paper, alternative formulations of the algorithms of Chen and Kuck are presented and a detailed error analysis is given, showing that if $\tilde x$ is the computable number, then Chen-Kuck algorithms are invalid.
Bell System Technical JournalMemory Requirements in a Telephone Exchange
87 Citations1950Claude E. Shannon
Comparison of any proposed design with the minimum requirements obtained from the relations gives a measure of the efficiency in memory utilization of the design.
IEEE Transactions on ComputersA Rectangular Logic Array
83 Citations1972Sheldon B. Akers
A rectangular logic array is described that can realize any combinational switching function and the realizations of a number of special functions include threshold functions, parity functions, symmetric functions, and universal logic functions.
Bell System Technical JournalPermutation Groups, Complexes, and Rearrangeable Connecting Networks
79 Citations1964Vladimír Beneš
Journal of the ACMOn the Time Required to Perform Multiplication
75 Citations1967S. Winograd
A lower bound on the time required to perform multiplication, as well as multiplication modulo N, is derived and it is shown that these lower bounds can be approached.
Journal of the ACMThe Complexity of Parallel Evaluation of Linear Recurrences
65 Citations1977Laurent Hyafil, H. T. Kung
The authors prove upper bounds on speed-ups achievable by parallel computers for a particular problem, the solution of first order linear recurrences for Cmmp and ILLIAC 4.
Communications of the ACMGlypnir—a programming language for Illiac IV
57 Citations1975Duncan H. Lawrie, T. Layman +2 more
The characteristics, goals, and philosophy of theGLYPNIR are described, and some of the problems associated with parallel computer architectures are discussed.
Proceedings of the IEEEA survey of problems and preliminary results concerning parallel processing and parallel processors
57 Citations1966M. M. Lehman
Some of the results obtained to date in a project which aims to develop and evaluate a unified hardware-software parallel processing computing system and the techniques for its use are described.
Journal of Optimization Theory and ApplicationsDynamic programming and parallel computers
56 Citations1973John L. Casti, M. Richardson +1 more
The computational theory of dynamic programming is examined from the viewpoint of parallel computation and parallel aspects of various dimensionality reduction techniques such as state increment dynamic programming, successive approximations, and shift vectors are given.
IEEE Transactions on ComputersA Parallel QR Algorithm for Symmetric Tridiagonal Matrices
55 Citations1977Ahmed Sameh, David J. Kuck
It is shown that if the size of the tridiagonal matrix in any given iteration is n, then the parallel QR algorithm requires 0(log2n) steps with 0(n) processors per iteration and no square roots, which results in a speedup of 0 (n/log 2n) over the sequential algorithm with an efficiency of 0(1/ log2n).
Communications of the ACMCellular arrays for the solution of graph problems
50 Citations1972Karl Levitt, William H. Kautz
It is shown that cellular arrays are inherently well suited for the solution of many graph problems, with direct applications to wire routing, PERT chart analysis, and the analysis of many types of networks.
IEEE Transactions on ComputersOn the Addition of Binary Numbers
48 Citations1970Richard P. Brent
An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit delay, and assuming that all numbers have the usual binary encoding.
IEEE Transactions on ComputersThe Parallel Evaluation of Arithmetic Expressions Without Division
47 Citations1973Richard P. Brent, David J. Kuck +1 more
As computers become capable of executing more arithmetic operations simultaneously, the question of compiling for such machines becomes more important.
Bell System Technical JournalAlgebraic and Topological Properties of Connecting Networks
45 Citations1962Vladimír Beneš
A connecting network is an arrangement of switches and transmission links allowing a certain set of terminals to be connected together in various combinations, usually by disjoint chains (paths): e.g., a central office, toll center, or military communications system.
Communications of the ACMA case study in programming for parallel-processors
45 Citations1969Jack L. Rosenfeld
An affirmative partial answer is provided to the question of whether it is possible to program parallel-processor computing systems to efficiently decrease execution time for useful problems and it is shown that, with proper programming, solution time when NP processors are applied approaches 1/NP times the solution time for a single processor, while improper programming can actually lead to an increase of solution time with the number of processors.
SIAM Journal on ControlA Nongradient and Parallel Algorithm for Unconstrained Minimization
44 Citations1970Daniel Chazan, W. L. Miranker
An algorithm for unconstrained optimization which is suitable for execution on a parallel computer is described and it is shown that the algorithm terminates at the minimum for quadratics and converges for strictly convex twice continuously differentiable functions.
Journal of the ACMMatrix Inversion Using Parallel Processing
43 Citations1967Marshall C. Pease
It is shown that both methods of matrix inversion are indeed able to make effective use of parallel capability, and with reasonable assumptions on the parallelism that is available, the speeds of the two methods are roughly comparable.
IRE Transactions on Communications SystemsOn Crossbar Switching Networks
42 Citations1975Nicholas Pippenger
For networks that exhibit neither concentration nor expansion, the well-known probabilistic model of C. Y. Lee is refined so as to take account of the dependence of events in different stages, and the refined model yields exact expressions for the point-to-point blocking probability.
Journal of Combinatorial TheoryParallel minimax search for a maximum
41 Citations1968Richard M. Karp, Willard L. Miranker
IEEE Transactions on ComputersOn the Parallel Evaluation of Polynomials
41 Citations1973Kiyoshi Maruyama
Various techniques for the evaluation of polynomials in a "reasonable number" of "steps" are compared with the known lower bounds.
IEEE Transactions on Electronic ComputersBulk Processing in Distributed Logic Memory
40 Citations1965Bob Crane, J. A. Githens
The memory organization and the storage of data are such that many operations are performed parallel by bit as well as parallel by word, resulting in more efficient algorithms and shorter execution times.
Advances in computersHighly Parallel Information Processing Systems
36 Citations1966John C. Murtha
This chapter discusses the main body of work in the organization of highly parallel information processing systems, which includes parallel networks, distributed control networks, limited application parallel processors, and multiple instruction stream or multiple function systems.
Communications of the ACMMerging with parallel processors
36 Citations1975Fǎnicǎ Gavril
An algorithm for merging A and B with the p parallel processors working synchronously with the best parallel merging algorithm, Batcher's algorithm, which requires at most 2⌈log2(2m</italic) + 1)⌉ + ⌊3 <italic’s m/m/p/p+1)/2⌋ + [“m”/
Management ScienceOptimal Search for a Maximum with Sequences of Simultaneous Function Evaluations
34 Citations1966Mordecai Avriel, Douglass J. Wilde
IEEE Transactions on ComputersInterconnections for Parallel Memories to Unscramble p-Ordered Vectors
32 Citations1974R. C. Swanson
This paper considers the problem of unscrambling vectors when the vectors belong to a class called p-ordered vectors, defined in such a way that elements that should be adjacent in an unscrambled vector are p elements apart in the p- ordered vector.
Journal of the ACMLarge Parallel Computers
31 Citations1966Jacob T. Schwartz
A general class of large-scale multiprocessors is outlined, and some problems of hardware and software implementation for computers of this class are discussed.
The Computer JournalAn Algorithm for Evaluation of Remote Terms in A Linear Recurrence Sequence
28 Citations1966Jeaneé C. Miller, D. J. S. Brown
A method is described for computing terms U n given by a linear recurrence relation from initial conditions near n = 0, whereby values for large n may be obtained without computing all intermediate values.
IEEE Transactions on ComputersOn a Varistructured Array of Microprocessors
28 Citations1977G. Jack Lipovski
On the basis of the simplicity of the fetch-execute cycle, there is hope that this architecture may well be the best way to build minicomputers and large computers using a cellular array of microprocessors.
IEEE Transactions on ComputersParallel Processing Algorithms for the Optimal Control of Nonlinear Dynamic Systems
27 Citations1973Robert E. Larson, Edison Tse
The recent development of parallel processing algorithms for solving optimal control problems for nonlinear dynamic systems, both the deterministic and stochastic cases are considered.
SIAM Journal on ComputingTime Bounds on the Parallel Evaluation of Arithmetic Expressions
25 Citations1975David J. Kuck, Kiyoshi Maruyama
It is shown that if more information than the number of operations (or operands) is known, sharper bounds may be given in certain cases, and generalizations of polynomials and generalization of continued fractions are shown to have improved bounds.
Communications of the ACMParallel numerical methods for the solution of equations
25 Citations1967Gerald S. Shedler
A technique is given for the development of numerical procedures which provide, at each stage, several approximations to a solution of an equation, making the methods of interest in a parallel processing environment.
IEEE Transactions on ComputersDynamic Memories with Enhanced Data Access
25 Citations1972Harold S. Stone
A memory that achieves minimum access time for r = 2 is described, and slight variations of the interconnection patterns lead to a memory that is well suited for FFT and certain matrix computations.
IBM Journal of Research and DevelopmentParallel Methods for Approximating the Root of a Function
24 Citations1969W. L. Miranker
A class of methods for approximating the root of a function is presented designed for execution on a parallel processor and when they are so executed, the speed of the approximation process is increased.
Communications of the ACMParallelism in tape-sorting
24 Citations1974Shimon Even
Two methods for employing parallelism in tape-sorting are presented and both approximately achieve the goal of reducing the processing time by a divisor which is the number of processors.
IEEE Transactions on ComputersProgram Suitability for Parallel Processing
20 Citations1971Mercedes González, C. V. Ramamoorthy
A heuristic procedure has been developed which introduces little overhead and provides a preliminary answer to the suitability question based solely on the nature and number of source program statements.
Communications of the ACMOn the time required for a sequence of matrix products
19 Citations1973Yoichi Muraoka, David J. Kuck
Algorithms are presented which properly parse such matrix sequences subject to the constraints of the machine organization to determine the minimum time required to evaluate such products on ordinary serial computers as well as parallel computers.
Annals of TelecommunicationsStructure et commande optimales de réseaux de connexion sans blocage
18 Citations1969Vladimir I. Neiman
Journal of Combinatorial Theory Series AIndependent permutations, as related to a problem of Moser and a theorem of Pólya
17 Citations1974Ashok K. Chandra
Polya's theorem is obtained that this problem of placing n non-capturing superqueens (chess queens with wrap-around capability) on an n × n board can be solved if and only if n is not a multiple of 2 or 3.
Toward a Lower Bound for Sorting Networks
16 Citations1972David C. Van Voorhis
A sorting network for N items, or an N-sorter, is a circuit with inputs I = i1, i2, ..., iN and outputs O = O, such that O is a monotonically increasing permutation of I.
Journal of the ACMApplication of Parallel Processing to Numerical Weather Prediction
14 Citations1967A. B. Carroll, R. T. Wetherald
It is felt by the authors that a parallel processing system of this type will offer a significant increase in computational speed over that of a sequentially organized computing system in the field of fluid dynamics as well as in other scientific fields.
IEEE Transactions on CommunicationsOn the Complexity of Strictly Nonblocking Concentration Networks
14 Citations1974Nicholas Pippenger
It is shown that a strictly nonblocking concentration network must have at least 3n \log_{3} n - O(n) contacts where n is the number of connections to be established simultaneously.
IEEE Transactions on ComputersDynamic Memories with Rapid Random and Sequential Access
14 Citations1974Alfred V. Aho, Jeffrey D. Ullman
A new architecture for dynamic memories in which the contents of any cell in memory can be accessed by applying a sequence of two primitive memory operations.
IEEE Transactions on ComputersOn Generating Multipliers for a Cellular Fast Fourier Transform Processor
13 Citations1972W.R. Cyre, G.J. Lipovski
A third possibility for hardware implementation of the fast Fourier transform of 2m samples is considered, in which in each pass the multipliers are generated from the values of the multiplier coefficient used in the previous pass.
Journal of the ACMStructuring of Parallel Algorithms
13 Citations1968P. A. Gilmore
The structuring of algorithms suitable for execution on parallel processors is discussed and a restructuring of Bellman's dynamic programming technique is given.
IEEE Transactions on ComputersThe Organization of High-Speed Memory for Parallel Block Transfer of Data
12 Citations1970Harold S. Stone
This paper describes the organization of a multi-module memory, designed to facilitate parallel block transfers, which is assumed to be identical, and the individual modules can fetch or store no more than one word or word group during any single memory cycle.
Mathematics of ComputationThe QR algorithm and Hyman’s method on vector computers
11 Citations1976Robert C. Ward
It is shown that iterative schemes based on Hyman's method will probably be more efficient than the QR algorithm on vector computers for large matrices on vector computers for large matrices.
IEEE Transactions on ComputersA Cellular Permuter Array
11 Citations1972Somnath Bandyopadhyay, Sriparna Basu +1 more
A new scheme for permuter arrays is discussed in this note whereby the variables are selected sequentially by a number of "selector cells" according to the required output ordering.
…