scientific article
From MaRDI portal
Publication:3318088
zbMath0534.68006MaRDI QIDQ3318088
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fast algorithmsparallel algorithmparallel computerarray processorsparallel languagesdata flow computermuliprocessor systempiplined computersVLSI computing structure
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25) Theory of software (68N99)
Related Items (62)
Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments ⋮ On the direct parallel solution of systems of linear equations: New algorithms and systolic structures ⋮ A Markov model for multibus multiprocessor systems under asynchronous operation ⋮ On the mean and variance of cover times for random walks on graphs ⋮ Résolution de grands systèmes linéaires creux par méthodes itératives parallèles ⋮ Parallel computation of manipulator inverse dynamics ⋮ An optimal parallel algorithm to construct a deap ⋮ Merging heaps in parallel ⋮ A parallel approach for theorem proving in propositional logic ⋮ PARALLEL MEMORY ALLOCATION AND DATA ALIGNMENT IN SIMD MACHINES ⋮ DISTRIBUTED COMPUTATION IN LOCAL AREA NETWORKS OF WORKSTATIONS ⋮ \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations ⋮ Development of massively parallel applications ⋮ Applications development on the ETA-10 ⋮ The generalized folding-cube network ⋮ Techniques for parallel manipulation of sparse matrices ⋮ Theg-network and its inherent fault tolerant properties ⋮ A systolic algorithm for Riccati and Lyapunov equations ⋮ A vectorized version of a sparse matrix-vector multiply ⋮ A message-routing strategy for multicomputer systems ⋮ On-line scheduling of parallel jobs ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ A study of the factorization fill‐in for a parallel implementation of the finite element method ⋮ Block decomposition structures for the fast modular implementation of two-dimensional digital filters ⋮ Parallelization of the Volterra algorithm for linear optimal open loop control ⋮ An optimistic approach to lock-free FIFO queues ⋮ Speedup and optimality in pipeline programs ⋮ Parallel and vector processing in landscape dynamics ⋮ Sharing special purpose resources in a multiprocessor environment ⋮ Systolic algorithms ⋮ Parallel solution of dense linear systems using diagonalization methods ⋮ Systolic givens factorization of dense rectangular matrices ⋮ Multi-dimensional state-space model for memory management ⋮ Distributed loop network with minimum transmission delay ⋮ A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems ⋮ Chordal rings as fault-tolerant loops ⋮ Finding the closest extreme vertex to a fixed point ⋮ Fault-tolerant routing in unique-path multistage Omega network ⋮ Embedding meshes into twisted-cubes ⋮ Adaptive blocking in the QR factorization ⋮ Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming ⋮ Product networks:a family of symmetric interconnection networks from a group model ⋮ Multi-dimensional state-space model for memory management ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal ⋮ A parallel algorithm for global optimization ⋮ FAST IMPLEMENTATION OF MULTIVARIABLE LINEAR SYSTEMS VIA VLSI ARRAY PROCESSORS ⋮ ON THE AUTOMATIC GENERATION OF EFFICIENT COMPUTATIONAL MODELS ⋮ Improved online algorithms for jumbled matching ⋮ A functional programming-directed database machine ⋮ Locally parallel cache design based on KL1 memory access characteristics ⋮ Optimal scheduling algorithms for parallel Gaussian elimination ⋮ On the communication structures of hyper-ring and hypercube multicomputers ⋮ A relational database system architecture based on a vector-processing method ⋮ Unnamed Item ⋮ A concurrent system for the computation of higher-order moments ⋮ A time-space optimal parallel sorting on a hypercube ⋮ The Newton-arithmetic mean method for the solution of systems of nonlinear equations. ⋮ Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. ⋮ Routings for involutions of a hypercube ⋮ Assignment and scheduling in parallel matrix factorization ⋮ Parallel Cholesky factorization on a shared-memory multiprocessor
This page was built for publication: