6800 search results - page 60 / 1360 » On optimizing collective communication |
IEEEPACT
2007
IEEE
14 years 4 months ago
2007
IEEE
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the pro...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
IEEEPACT
2005
IEEE
14 years 3 months ago
2005
IEEE
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
PEWASUN
2008
ACM
13 years 11 months ago
2008
ACM
There has been extensive research focused on maximizing the throughput of wireless networks in general and mesh networks in particular. Recently, techniques have been developed th...
SAC
2011
ACM
13 years 24 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...