Sciweavers

1007 search results - page 16 / 202
» An approach for matching communication patterns in parallel ...
Sort
View
IEEECIT
2010
IEEE
15 years 6 days ago
Parallel Best Neighborhood Matching Algorithm Implementation on GPU Platform
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Guangyong Zhang, Liqiang He, Yanyan Zhang
ICPP
1987
IEEE
15 years 5 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
114
Voted
IWCC
1999
IEEE
15 years 6 months ago
Optimizing User-Level Communication Patterns on the Fujitsu AP3000
In this paper, we present techniques and algorithms to improve the performance of various communication patterns on message-passing platforms where, for reasons of safety, user-le...
Jeremy E. Dawson, Peter E. Strazdins
IPPS
2002
IEEE
15 years 6 months ago
Communication Characteristics of Large-Scale Scientific Applications for Contemporary Cluster Architectures
This paper examines the explicit communication characteristics of several sophisticated scientific applications, which, by themselves, constitute a representative suite of publicl...
Jeffrey S. Vetter, Frank Mueller
COMPCON
1995
IEEE
15 years 5 months ago
Tempest: A Substrate for Portable Parallel Programs
This paper describes Tempest, a collection of mechanisms for communication and synchronization in parallel programs. With these mechanisms, authors of compilers, libraries, and ap...
Mark D. Hill, James R. Larus, David A. Wood