scientific article
From MaRDI portal
Publication:3773322
zbMath0634.68020MaRDI QIDQ3773322
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic programmingbibliographyfast Fourier transformparallel algorithmsPROLOGmultiprocessorsarray processorsSIMDMIMDpipelined vector processors
Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items (37)
A parallel QR algorithm for the nonsymmetric eigenvalue problem ⋮ Parallelization of differential problems by partitioning method (synchronized algorithm) ⋮ Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers ⋮ Parallel tree contraction and prefix computations on a large family of interconnection topologies ⋮ Graph separation techniques for quadratic zero-one programming ⋮ Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Parallel algorithms for a multi-level network optimization problem ⋮ OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS ⋮ EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗ ⋮ THE CELLULAR AUTOMATA PARADIGM FOR THE PARALLEL SOLUTION OF HEAT TRANSFER PROBLEMS ⋮ The calculation of separated flows using a distributed memory mimd computer ⋮ Parallel depth first search. II: Analysis ⋮ A parallel algorithm for constrained concave quadratic global minimization ⋮ Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge ⋮ Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints ⋮ The Performance of greedy algorithms for the on-line steiner tree and related problems ⋮ The \(3^{*}\)-connected property of pyramid networks ⋮ A fast algorithm to compute irreducible and primitive polynomials in finite fields ⋮ A divide and conquer method for polynomial zeros ⋮ Speedup and optimality in pipeline programs ⋮ Partial sum problem mapping into a hypercube ⋮ Branch-and-bound as a higher-order function ⋮ Data-movement-intensive problems: Two folk theorems in parallel computation revisited ⋮ Parallel solution of Toeplitzlike linear systems ⋮ On the strong distance problems of pyramid networks ⋮ Multiplication, division, and shift instructions in parallel random access machines ⋮ Efficient algorithms for parallel sorting on mesh multicomputers ⋮ Chordal rings as fault-tolerant loops ⋮ Properties of a hierarchical network based on the star graph ⋮ Automatic parallel control structures in SequenceL ⋮ A parallel algorithm for solving the incompressible Navier-Stokes problem ⋮ The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm ⋮ Improved parallel computations with Toeplitz-like and Hankel-like matrices ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Parallel processing for fuzzy sets operations ⋮ Space-efficient parallel merging ⋮ Iteration grain sized asynchronous parallel algorithms in optimization
This page was built for publication:
