Aggregation methods for solving sparse triangular systems on multiprocessors
Journal Article
·
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (USA)
- Dept. of Computer Science, Yale Univ., New Haven, CT (US)
Efficient methods are presented for solving large sparse triangular systems on multiprocessors. These methods use heuristics for the aggregation, mapping, and scheduling of relatively fine-grained computations whose data dependencies are specified by directed acyclic graphs. Results of experiments run on the Encore Multimax, as well as model problem analysis, measure the performance of the partitioning strategies on shared-memory architectures with varying synchronization costs.
- OSTI ID:
- 6502514
- Journal Information:
- SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (USA), Journal Name: SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (USA) Vol. 11:1; ISSN 0196-5204; ISSN SIJCD
- Country of Publication:
- United States
- Language:
- English
Similar Records
On partitioning of algorithms for parallel execution on VLSI circuit architectures
Program partitioning for NUMA multiprocessor computer systems. [Nonuniform memory access]
NP-completeness of linearly-connected multiprocessor scheduling
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6930573
Program partitioning for NUMA multiprocessor computer systems. [Nonuniform memory access]
Journal Article
·
Sun Oct 31 23:00:00 EST 1993
· Journal of Parallel and Distributed Computing; (United States)
·
OSTI ID:5703692
NP-completeness of linearly-connected multiprocessor scheduling
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5090885