NDLI: Parallelizing algorithms for MIMD architectures with shared memory

Please wait, while we are loading the content...

Multicoloring with lots of colors

A formal framework handling the description and implementation of multigrid algorithms

On the parallel solution of parabolic equations

The doconsider loop

Implementing Linda for distributed and parallel processing

An efficient message-passing scheduler based on guided self scheduling

The composite binary cube — a family of interconnection networks for multiprocessors

I/O issues for hypercubes

Semi-iterative methods on distributed memory multiprocessor architectures

One-to-one mapping of process graphs onto a hypercube

Automatic load balanced paritioning strategies for PDE computations

Multiprocessing algorithms for global spectral numerical weather prediction

Parallel calculations on the wind-driven oceanic circulation using Fourier pseudospectral methods

Simulations of three-dimensional flows with the lattice Boltzmann equation on the IBM 3090/VF

Vectorized molecular dynamics algorithms for very large number of particles

Control flow optimization for supercomputer scalar processing

A global resource-constrained parallelization technique

Array distribution in SUPERB

Compile-time detection of race conditions in a parallel program

A unified semantic approach for the vectorization and parallelization of generalized reductions

Constraint based vectorization

Intererence analysis tools for parallelizing programs with recursive data structures

Data dependence analysis on multi-dimensional array references

Interactive conversion of sequential to multitasking FORTRAN

Alpha du centaur: a prototype environment for the design of parallel regular alorithms

Parallelizing algorithms for MIMD architectures with shared memory

Performance comparisons of Cholesky factorization algorithms using level-2 & 3 BLAS on the national advanced systems AS/XL Vector computer

Portable and efficient factorization algorithms on the IBM 3090/VF

A comparison of parallel processing on CRAY X-MP AND IBM 3090 VF multiprocessors

Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems

Rectangular spatial decomposition methods for parallel simulated annealing

Parallel algorithms for solution of tridiagonal systems on multicomputers

Very high-speed communication in large MIMD supercomputers

A version control approach to Cache coherence

A asynchronous buffering network for tightly coupled multiprocessors

High-speed storage control schemes of HITACHI supercomputer S-820 system

The Kyushu University reconfigurable parallel processor: design of memory and intercommunicaiton architectures

FEM-TORUS: token driven processor torus array functional simulation and performance evaluation — for processing of finite-element-method matrices

The specification of a new Manchester Dataflow machine

The NOV-II super parallel computer for signal processing

Supercomputer development in Europe

Overview of a high-performance programmable pipeline structure

Restricted Fetch and Φ operations for parallel processing

Instruction fetch unit for parallel execution of branch instructions

Performance benefits of large execution atomic units in dynamically scheduled machines

Performance prediction of loop constructs on multiprocessor hierarchical-memory systems

Influence of the stride on the cache utilization in the IBM 3090 VF

Performance analysis of buffered banyan networks under nonuniform traffic

Convergence rate and termination of asynchronous iterative algorithms

Acceleration of the outer conjugate gradient by reorthogonalization for a domain decomposition method for structural analysis problems

Vectorizing a robust inner product algorithm

Parallelizing algorithms for MIMD architectures with shared memory

Content Provider	ACM Digital Library
Author	Brehm, Jürgen Jordan, Harry F.
Abstract	The solution of a system of linear equations Ax = b is an important application in scientific computation. It arises for the numerical solution of self adjoint problems using finite difference or finite element methods for discretization. For realistic problems the coefficient matrix A is sparse most of the times, i.e. a large number of its elements are zero. The three commonly used classes of algorithms to solve the linear system of equations are direct methods, semi-iterative methods and iterative methods which differ in their numerical properties and their computer implementations. The multiprocessor L/U Decomposition for sparse systems was implemented by Gita Alaghband [Git85] as an example for a parallelized direct method. In this paper we will present examples for efficient parallelizations of iterative and semi-iterative algorithms and their implementations on various MIMD shared memory architectures. The iterative methods generate a sequence of approximate solutions which converge to the exact solution. To improve the rate of convergence the Multigrid approach [Hac80] is used as an accelerator. Semi-iterative methods operate in an iterative manner with the property of finite termination in exact arithmetic. The Conjugate Gradient methods shown in this paper are among the most popular representatives of this class of algorithms. They are usually not as robust as direct methods but there are computational advantages over methods that require the factorization of the coefficient matrix A.First we present FORCE [Jor87] as an example for a portable parallel language, then, in section three, the implementation of the algorithms on three MIMD shared memory architectures is described and finally runtime measurements and speedup calculations are carried out in section four.
Starting Page	244
Ending Page	253
Page Count	10
File Format	PDF
ISBN	0897913094
DOI	10.1145/318789.318816
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-06-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in