2473 search results - page 85 / 495 » The Logic of Communication Graphs |
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we describe a compiler framework which can identify communication patterns for MPIbased parallel applications. This has the potential of providing significant perfo...
AAI
2005
13 years 7 months ago
2005
This paper is about people. It is about understanding how learning and communication mutually influence one another; allowing people to infer each other's communicative behavi...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper introduces the Abstract Data and Communication Library (ADCL). ADCL is an application level communication library aiming at providing the highest possible performanc...