Sciweavers

208 search results - page 20 / 42
» ipps 1998
Sort
View
IPPS
1998
IEEE
15 years 1 months ago
A Case for Aggregate Networks
Parallel processing networks, even full crossbars, that only implement point-to-point and multicast message passing are inefficient for collective communications because multiple ...
Raymond Hoare, Henry G. Dietz
IPPS
1998
IEEE
15 years 1 months ago
Synchronizing Operations on Multiple Objects
Parallel programming on distributed memory systems is one of the most challenging research areas in parallel computingtoday. Objectbased parallel programming languages are an impor...
Tim Rühl, Henri E. Bal
IPPS
1998
IEEE
15 years 1 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
IPPS
1998
IEEE
15 years 1 months ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
IPPS
1998
IEEE
15 years 1 months ago
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...