Ultracomputers
From MaRDI portal
Publication:3922148
DOI10.1145/357114.357116zbMath0468.68027OpenAlexW4206658214MaRDI QIDQ3922148
Publication date: 1980
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357114.357116
Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)
Related Items (39)
An introduction to parallelism in combinatorial optimization ⋮ Routing, merging, and sorting on parallel models of computation ⋮ Parallel tree contraction and prefix computations on a large family of interconnection topologies ⋮ A design of a parallel dictionary using skip lists ⋮ Optimal computation of prefix sums on a binary tree of processors ⋮ Parallel computation with threshold functions ⋮ An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits ⋮ On efficient parallel computations for some dynamic programming problems ⋮ Divide-and-conquer algorithms on the hypercube ⋮ Efficient massively parallel implementation of some combinatorial algorithms ⋮ A probabilistic simulation of PRAMs on a bounded degree network ⋮ Interpolation between bases and the shuffle exchange network ⋮ Techniques for parallel manipulation of sparse matrices ⋮ Parallélisation d'algorithmes avec un nombre fixe de processeurs ⋮ Parallélisation sémantique ⋮ A new scheme for the deterministic simulation of PRAMs in VLSI ⋮ A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area ⋮ A complexity theory of efficient parallel algorithms ⋮ SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK ⋮ Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model ⋮ Oblivious routing with limited buffer capacity ⋮ Radix sort on the hypercube ⋮ Processor-efficient implementation of a maximum flow algorithm ⋮ Communication primitives for BSP computers ⋮ Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ ON THE PERFORMANCE AND COST OF SOME PRAM MODELS ON CMP HARDWARE ⋮ Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram ⋮ Representing graph families with edge grammars ⋮ Efficient parallel algorithms for graph problems ⋮ Exposing graph uniformities via algebraic specification ⋮ An asymptotically optimal layout for the shuffle-exchange graph ⋮ The mathematics of perfect shuffles ⋮ A parallel-design distributed-implementation (PDDI) general-purpose computer ⋮ An optimal parallel connectivity algorithm ⋮ A multiprocess network logic with temporal and spatial modalities ⋮ Space-efficient parallel merging ⋮ Deterministic sorting in nearly logarithmic time on the hypercube and related computers ⋮ Parallel solutions to geometric problems in the scan model of computation
This page was built for publication: Ultracomputers
