A universal interconnection pattern for parallel computers
From MaRDI portal
Publication:3951543
DOI10.1145/322344.322353zbMath0489.68042OpenAlexW2049337025WikidataQ29542447 ScholiaQ29542447MaRDI QIDQ3951543
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322344.322353
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (37)
Sequential and parallel algorithms for the NCA problem on pure pointer machines ⋮ An introduction to parallelism in combinatorial optimization ⋮ A chained-matrices approach for parallel computation of continued fractions and its applications ⋮ On the construction of parallel computers from various basis of Boolean functions ⋮ Parallel pointer machines ⋮ Array processing machines: an abstract model ⋮ Towards optimal parallel bucket sorting ⋮ On nondeterminism in parallel computation ⋮ On the time required to sum n semigroup elements on a parallel machine with simultaneous writes ⋮ The problem of space invariance for sequential machines ⋮ Simulations among concurrent-write PRAMs ⋮ On characterizations of the class PSPACE/poly ⋮ Parallel computation with threshold functions ⋮ An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits ⋮ THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† ⋮ Low complexity classes of multidimensional cellular automata ⋮ Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs ⋮ Complexity theory of parallel time and hardware ⋮ Communication aspects of networks based on geometric incidence relations ⋮ Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs ⋮ Fast and optimal simulations between CRCW PRAMs ⋮ Computation models and function algebras ⋮ Classifying the computational complexity of problems ⋮ An optimal time bound for oblivious routing ⋮ Incomparability in parallel computation ⋮ The graph matching problem ⋮ Processor-time tradeoffs in PRAM simulations ⋮ Multiplication, division, and shift instructions in parallel random access machines ⋮ An improved parallel algorithm for integer GCD ⋮ ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS ⋮ Modelling knowledge and action in distributed systems ⋮ Efficient parallel algorithms for parameterized problems ⋮ Optical computing ⋮ A note on the parallel computation thesis ⋮ Restricted CRCW PRAMs ⋮ Large parallel machines can be extremely slow for small problems ⋮ Parallel solutions to geometric problems in the scan model of computation
This page was built for publication: A universal interconnection pattern for parallel computers
