Sciweavers

1519 search results - page 31 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
ICDCS
1991
IEEE
14 years 16 days ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
SPAA
2009
ACM
14 years 9 months ago
Classifying peer-to-peer network coding schemes
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
Christian Ortolf, Christian Schindelhauer, Arne Va...
SC
2005
ACM
14 years 2 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
ICA3PP
2005
Springer
14 years 2 months ago
Analytical Models of Probability Distributions for MPI Point-to-Point Communication Times on Distributed Memory Parallel Compute
Abstract. Measurement and modelling of distributions of data communication times is commonly done for telecommunication networks, but this has not previously been done for message ...
Duncan A. Grove, Paul D. Coddington