416 search results - page 9 / 84 » A Paradigm for Parallel Matrix Algorithms: |
133
click to vote
CLUSTER
2001
IEEE
15 years 7 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
179
click to vote
HPCN
2000
Springer
15 years 7 months ago
2000
Springer
We build an analytical model for an application utilizing master-slave paradigm. In the model, only three architecture parameters are used: latency, bandwidth and flop rate. Instea...
134
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
DSP applications can be suitably represented using Process Network Models. This paper uses a modification of Kahn Process Network to solve the problem of finding an optimum arch...
116
click to vote
JPDC
2008
15 years 4 months ago
2008
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
160
click to vote
IPPS
1997
IEEE
1997
IEEE
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
15 years 7 months ago
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...