416 search results - page 17 / 84 » A Paradigm for Parallel Matrix Algorithms: |
154
click to vote
PLDI
1993
ACM
15 years 3 months ago
1993
ACM
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
79
Voted
EUROPAR
2009
Springer
15 years 5 months ago
2009
Springer
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...
112
click to vote
EUROPAR
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
JISE
2006
14 years 11 months ago
2006
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
CLUSTER
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...