Actions for Parallel language constructs for tensor product computations on loosely coupled architectures

Email RIS file
Bookmark
Report an Issue

Parallel language constructs for tensor product computations on loosely coupled architectures

Author
Mehrotra, Piyush
Published
Sep 1, 1989.
Physical Description
1 electronic document
Additional Creators
Vanrosendale, John
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
Distributed memory architectures offer high levels of performance and flexibility, but have proven awkard to program. Current languages for nonshared memory architectures provide a relatively low level programming environment, and are poorly suited to modular programming, and to the construction of libraries. A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. Tensor product array computations are focused on along with a simple but important class of numerical algorithms. The problem of programming 1-D kernal routines is focused on first, such as parallel tridiagonal solvers, and then how such parallel kernels can be combined to form parallel tensor product algorithms is examined.
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19890019690.
Accession ID: 89N29061.
ICASE-89-41.
NAS 1.26:181900.
NASA-CR-181900.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15689139