Algorithms for Parallel-Search Memories
Journal of the ACM (JACM)
On the Time Required to Perform Addition
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Application of Parallel Processing to Numerical Weather Prediction
Journal of the ACM (JACM)
Matrix Inversion Using Parallel Processing
Journal of the ACM (JACM)
On the Time Required to Perform Multiplication
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Structuring of Parallel Algorithms
Journal of the ACM (JACM)
An Adaptation of the Fast Fourier Transform for Parallel Processing
Journal of the ACM (JACM)
Scheduling Parallel Computations
Journal of the ACM (JACM)
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Journal of the ACM (JACM)
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
The Complexity of Parallel Evaluation of Linear Recurrences
Journal of the ACM (JACM)
On Stable Parallel Linear System Solvers
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Parallel Tridiagonal Equation Solvers
ACM Transactions on Mathematical Software (TOMS)
The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
ACM Transactions on Mathematical Software (TOMS)
Computer Interconnection Structures: Taxonomy, Characteristics, and Examples
ACM Computing Surveys (CSUR)
Fast parallel sorting algorithms
Communications of the ACM
Glypnir—a programming language for Illiac IV
Communications of the ACM
The parallel execution of DO loops
Communications of the ACM
Communications of the ACM
Merging with parallel processors
Communications of the ACM
An efficient data structure for dynamic memory management
Journal of Systems and Software
On the time required for a sequence of matrix products
Communications of the ACM
Parallel numerical methods for the solution of equations
Communications of the ACM
A case study in programming for parallel-processors
Communications of the ACM
Parallel methods for integrating ordinary differential equations
Communications of the ACM
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
Looking for an approach to a theory of models for parallel computation
Proceedings of the International Sympoisum on Theoretical Programming
Towards automtical construction of parallel programs
Proceedings of the International Sympoisum on Theoretical Programming
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
A hierarchical, restructurable multi-microprocessor architecture
ISCA '76 Proceedings of the 3rd annual symposium on Computer architecture
Efficient message routing in Mega-Micro-Computer networks
ISCA '76 Proceedings of the 3rd annual symposium on Computer architecture
Parallel algorithms for the transitive closure and the connected component problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Sorting on a mesh-connected parallel computer
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The complexity of parallel evaluation of linear recurrence
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Interconnecting a distributed processor system for avionics
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
System balance analysis for vector computers
ACM '75 Proceedings of the 1975 annual conference
The universality of various types of SIMD machine interconnection networks
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
A Large Scale, Homogenous, Fully Distributed Parallel Machine, II
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
A GRAPH MODEL FOR PARALLEL COMPUTATIONS
A GRAPH MODEL FOR PARALLEL COMPUTATIONS
AN ANALYSIS OF SORTING NETWORKS
AN ANALYSIS OF SORTING NETWORKS
A survey of models for parallel computing
A survey of models for parallel computing
A generalization of the divide-sort-merge strategy for sorting networks
A generalization of the divide-sort-merge strategy for sorting networks
A lower bound for sorting networks that use the divide-sort-merge strategy
A lower bound for sorting networks that use the divide-sort-merge strategy
Large [g,d] sorting networks
Parallel solution methods for triangular linear systems of equations
Parallel solution methods for triangular linear systems of equations
Parallelism exposure and exploitation in programs
Parallelism exposure and exploitation in programs
Memory-processor connection networks
Memory-processor connection networks
Speedup of iterative programs in multiprocessing systems.
Speedup of iterative programs in multiprocessing systems.
Interprocessor connections--capabilities, exploitation and effectiveness.
Interprocessor connections--capabilities, exploitation and effectiveness.
Parallel graph processing using depth-first search and breadth-first search.
Parallel graph processing using depth-first search and breadth-first search.
A study of parallelism in graph theory.
A study of parallelism in graph theory.
A universal computer capable of executing an arbitrary number of sub-programs simultaneously
IRE-AIEE-ACM '59 (Eastern) Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference
Intercommunication of processors and memory
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
Communications of the ACM - Special section on computer architecture
ACM Transactions on Programming Languages and Systems (TOPLAS)
MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM - Special issue on parallelism
How to share memory in a distributed system
Journal of the ACM (JACM)
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Reduced distance routing in single-state shuffle-exchange interconnection networks
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
IEEE Transactions on Computers
Applications considerations in the system design of highly concurrent multiprocessors
IEEE Transactions on Computers
Matrix operations on a multicomputer system with switchable main memory modules and dynamic control
IEEE Transactions on Computers
Semantic parallelization: a practical exercise in abstract interpretation
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Language and visualization support for large-scale concurrency
ICSE '88 Proceedings of the 10th international conference on Software engineering
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Topologies' - computational messaging for multicomputers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
IEEE Transactions on Computers
2-D SIMD algorithms in the perfect shuffle networks
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
The periodic balanced sorting network
Journal of the ACM (JACM)
Parallel Parsing of Arithmetic Expressions
IEEE Transactions on Computers
“Topologies”—distributed objects on multicomputers
ACM Transactions on Computer Systems (TOCS)
A bridging model for parallel computation
Communications of the ACM
A Parallel Algorithm for Solving Sparse Triangular Systems
IEEE Transactions on Computers
Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
IEEE Transactions on Computers
Making asynchronous parallelism safe for the world
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Process coordination with fetch-and-increment
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Efficient parallel algorithms on restartable fail-stop processors
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Optimal routing of parentheses on the hypercube
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A VLSI decomposition of the deBruijn graph
Journal of the ACM (JACM)
The CM-5 Connection Machine: a scalable supercomputer
Communications of the ACM
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
Parallel solutions to geometric problems in the scan model of computation
Journal of Computer and System Sciences
Are multiport memories physically feasible?
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Are multiport memories physically feasible?
ACM SIGARCH Computer Architecture News
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
Strategic directions in computer architecture
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
The NYU ultracomputer—designing a MIMD, shared-memory parallel machine
25 years of the international symposia on Computer architecture (selected papers)
Connection Machine Lisp: fine-grained parallel symbolic processing
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
Complexity Results for Permuting Data and Other Computations on Parallel Processors
Journal of the ACM (JACM)
Using Emulations to Enhance the Performance of Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
Highly parallel Ada—Ada on an ultracomputer
SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada
An empirical evaluation of two memory-efficient directory methods
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Issues related to MIMD shared-memory computers: the NYU ultracomputer approach
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
A decentralized control, highly concurrent multiprocesssor
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Parallel hashing: an efficient implementation of shared memory
Journal of the ACM (JACM)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An overview of computational complexity
Communications of the ACM
Embedding graphs with bounded treewidth into their optimal hypercubes
Journal of Algorithms
Efficient dynamic embeddings of binary trees into hypercubes
Journal of Algorithms
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
Program Structuring for Effective Parallel Portability
IEEE Transactions on Parallel and Distributed Systems
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
Nordic Journal of Computing
Emulating an MIMD architecture
MICRO 15 Proceedings of the 15th annual workshop on Microprogramming
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
The Boolean Vector Machine [BVM]
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
The NYU Ultracomputer—designing a MIMD, shared-memory parallel machine (Extended Abstract)
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Implementation of multilisp: Lisp on a multiprocessor
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An efficient general purpose parallel computer
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Efficient schemes for parallel communication
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On parallel searching (Extended Abstract)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Relations between concurrent-write models of parallel computation
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A probabilistic relation between desirable and feasible, models of parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Nial: A candidate language for fifth generation computer systems
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Emulating Direct Products by Index-Shuffle Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Parallel Computing - Special issue: High performance computing with geographical data
The design and development of ZPL
Proceedings of the third ACM SIGPLAN conference on History of programming languages
Scan primitives for GPU computing
Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
An overview of computational complexity
ACM Turing award lectures
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer
IEEE Transactions on Computers
IEEE Transactions on Computers
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
Mesh-Connected Computers with Broadcasting
IEEE Transactions on Computers
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
IEEE Transactions on Computers
A Layout for the Shuffle-Exchange Network with O(N2/log3/2N) Area
IEEE Transactions on Computers
Fast scan algorithms on graphics processors
Proceedings of the 22nd annual international conference on Supercomputing
Configurable emulated shared memory architecture for general purpose MP-SOCs and NOC regions
NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Fundamenta Informaticae
| Hi-index | 0.09 |
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.