4045 search results - page 87 / 809 » Special Section on Parallel Distributed Computing and Networ... |
126
click to vote
PODC
1997
ACM
15 years 9 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
125
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
141
click to vote
PVM
1999
Springer
15 years 9 months ago
1999
Springer
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
141
click to vote
ICPP
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
128
click to vote
HOTI
2008
IEEE
15 years 11 months ago
2008
IEEE
—In this paper we describe QsNetIII , an adaptively routed network for High Performance Computing (HPC) applications. We detail the structure of the network, the evolution of our...