Sciweavers

2563 search results - page 275 / 513
» Parallel matrix algorithms and applications
Sort
View
ISPASS
2007
IEEE
15 years 10 months ago
Simplifying Active Memory Clusters by Leveraging Directory Protocol Threads
Address re-mapping techniques in so-called active memory systems have been shown to dramatically increase the performance of applications with poor cache and/or communication beha...
Dhiraj D. Kalamkar, Mainak Chaudhuri, Mark Heinric...
TVLSI
2010
14 years 11 months ago
Exploration of Heterogeneous FPGAs for Mapping Linear Projection Designs
In many applications, a reduction of the amount of the original data or a representation of the original data by a small set of variables is often required. Among many techniques, ...
Christos-Savvas Bouganis, Iosifina Pournara, Peter...
PPOPP
1999
ACM
15 years 8 months ago
MagPIe: MPI's Collective Communication Operations for Clustered Wide Area Systems
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
Thilo Kielmann, Rutger F. H. Hofman, Henri E. Bal,...
CLOUDCOM
2010
Springer
15 years 2 months ago
Evaluation of MapReduce for Gridding LIDAR Data
-- The MapReduce programming model, introduced by Google, has become popular over the past few years as a mechanism for processing large amounts of data, using sharednothing parall...
Sriram Krishnan, Chaitanya K. Baru, Christopher J....
IPPS
2002
IEEE
15 years 9 months ago
Toward Optimal Diffusion Matrices
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
Robert Elsässer, Burkhard Monien, Günter...