Sciweavers

159 search results - page 22 / 32
» Analytical Models of Probability Distributions for MPI Point...
Sort
View
SPAA
1993
ACM
13 years 11 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
WCE
2007
13 years 8 months ago
Sparse Matrix Multiplication Using UPC
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
Hoda El-Sayed, Eric Wright
HIPC
2005
Springer
14 years 1 months ago
Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
Lei Pan, Ming Kin Lai, Michael B. Dillencourt, Lub...
ICPP
1994
IEEE
13 years 11 months ago
Optimizing IPC Performance for Shared-Memory Multiprocessors
We assert that in order to perform well, a shared-memory multiprocessorinter-process communication (IPC)facility mustavoid a) accessing any shared data, and b) acquiring any locks...
Benjamin Gamsa, Orran Krieger, Michael Stumm
IPPS
2010
IEEE
13 years 5 months ago
Inter-block GPU communication via fast barrier synchronization
The graphics processing unit (GPU) has evolved from a fixedfunction processor with programmable stages to a programmable processor with many fixed-function components that deliver...
Shucai Xiao, Wu-chun Feng