Parallel language constructs for tensor product computations on loosely coupled architecturesA set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. The authors focus on tensor product array computations, a simple but important class of numerical algorithms. They consider first the problem of programming one-dimensional kernel routines, such as parallel tridiagonal solvers, and then look at how such parallel kernels can be combined to form parallel tensor product algorithms.
Document ID
19900047374
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Mehrotra, Piyush (NASA Langley Research Center Hampton, VA, United States)
Van Rosendale, John (NASA Langley Research Center; Institute for Computer Applications in Science and Engineering Hampton, VA, United States)