Publication:4864234
From MaRDI portal
zbMath0861.68040MaRDI QIDQ4864234
Ananth Grama, Vipin Kumar, George Karypis, Anshul Gupta
Publication date: 30 January 1996
shortest path; fast Fourier transforms; parallel algorithms; transitive closure; minimum spanning tree; sparse graphs; parallel computer architectures
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68M99: Computer system organization
68W15: Distributed algorithms
Related Items
A fault tolerant systolic mesh for linear system solution, An efficient parallel algorithm or visible-surface detection in 3d graphics display, SCALEA: a performance analysis tool for parallel programs, A Parallel Multivariate Interpolation Algorithm With Radial Basis Functions, Parallel algorithms for a multi-level network optimization problem, A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems, A multigrid method based on graph matching for convection–diffusion equations, Unnamed Item, A fast parallel algorithm for the Poisson equation on a disk, A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM, Hybrid finite-element/molecular-dynamics/electronic-density-functional approach to materials simulations on parallel computers, A study of the performance of Neville elimination using two kinds of partitioning techniques, Large-scale topology optimization in 3D using parallel computing, Efficient indirect all-to-all personalized communication on rings and 2-D tori, A multiple-heaps algorithm for parallel simulation of collision systems, Neville elimination: a study of the efficiency using checkerboard partitioning, ``Miniaturized linearizations for quadratic 0/1 problems, Analyzing scalability of Neville elimination, Performance study and analysis of parallel multilevel preconditioners, Design and implementation of a massively parallel version of DIRECT, A bandwidth latency tradeoff for broadcast and reduction, Hamiltonian connectivity of 2-tree-generated networks, Parallel ILP for distributed-memory architectures, Parallel methods for absolute irreducibility testing, The average diameter of general tree structures, Performance of fault-tolerant data and compute intensive programs over a network of workstations, A parallel Davidson-type algorithm for several eigenvalues, A bookkeeping strategy for multiple objective linear programs, The calculation of average distance in mesh structures., A parallel hydrodynamic model for shallow water equations., The average diameter and its estimation in nonlinear structures, A study of average-case speedup and scalability of parallel computations on static networks, Optimal gray-code labeling and recognition algorithms for hypercubes, Honeycomb tori are Hamiltonian, An approximation algorithm for scheduling trees of malleable tasks, Parallel electromagnetic modelling for the nonlinear electrotechnic systems, A compositional framework for developing parallel programs on two-dimensional arrays, Parallel implementation of the recursive Green's function method, Searching for spreads and packings, Parallelization of Linear Algebra Algorithms Using ParSol Library of Mathematical Objects, Parallel Numerical Algorithm for the Traveling Wave Model, Embedding hypercubes, rings, and odd graphs into hyper-stars, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
Uses Software
