Sciweavers

296 search results - page 58 / 60
» Kernel Matching Pursuit
Sort
View
95
Voted
HPDC
1997
IEEE
15 years 3 months ago
Supporting Parallel Applications on Clusters of Workstations: The Intelligent Network Interface Approach
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by highspeed ne...
Marcel-Catalin Rosu, Karsten Schwan, Richard Fujim...
88
Voted
ISCA
1996
IEEE
124views Hardware» more  ISCA 1996»
15 years 3 months ago
MGS: A Multigrain Shared Memory System
Parallel workstations, each comprising 10-100 processors, promise cost-effective general-purpose multiprocessing. This paper explores the coupling of such small- to medium-scale s...
Donald Yeung, John Kubiatowicz, Anant Agarwal
110
Voted
HPCN
1997
Springer
15 years 3 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
77
Voted
USENIX
2008
15 years 2 months ago
Fast, Inexpensive Content-Addressed Storage in Foundation
Foundation is a preservation system for users' personal, digital artifacts. Foundation preserves all of a user's data and its dependencies--fonts, programs, plugins, ker...
Sean C. Rhea, Russ Cox, Alex Pesterev
VLSISP
2008
173views more  VLSISP 2008»
14 years 11 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee