28357 search results - page 310 / 5672 » Communications |
189
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
167
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
123
Voted
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
169
click to vote
CCGRID
2008
IEEE
15 years 8 months ago
2008
IEEE
We have been developing a Grid-enabled MPI communication library called GridMPI, which is designed to run on multiple clusters connected to a wide-area network. Some of these clust...
136
click to vote
CDES
2006
15 years 8 months ago
2006
In this paper we define communicating distributed H systems with simple splicing rules of types (1,3), (1,4) and (2,3) and study the generative capacity. keyword: Splicing systems,...