Accession Number:

ADA158274

Title:

Sparse Elimination on Vector Multiprocessors.

Descriptive Note:

Interim rept. 1 Nov 84-1 Apr 85,

Corporate Author:

MICHIGAN UNIV ANN ARBOR SUPERCOMPUTER ALGORITHM RESEARCH LAB

Personal Author(s):

Report Date:

1985-04-16

Pagination or Media Count:

7.0

Abstract:

Studies of microtasking with up to 16 CRAY X-MP processors for LU decomposition of dense systems of equations have given rise to hybrid algorithms. One issue addressed has been the problem of memory bank conflicts, which increases with the number of processors. Conflict resistant algorithms have been developed. It is possible to assembly-code the X-MP so that accesses are pre-fetched into vector registers. Several reports have been prepared recently under this effort, and a paper entitled Task Granularity Studies in a Many-Processor Cray X-MP has been accepted for publication in Parallel Computing.

Subject Categories:

  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE