D. Barth and P. Fraigniaud. Approximation algorithms for structured communication problems. In 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA '97), pages 180--188, 1997. (Tech. Rep. LRI-1239, Univ. Paris-Sud. http://www.lri.fr/pierre). Home/Search Document Details and Download
Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
The Hierarchical Factor Algorithm for All-to-all Communication - Sanders, Träff (2002) (1 citation) (Correct)
.... decompositions of the complete graph into permutations that can be efficiently executed on mesh like networks [11, 5] for gossiping [14] and for all to all communication on fully connected networks [10] Our variant of the single ported communication model is similar to the telephone model [2, 1]. Collective communication on hierarchical systems has recently received some attention [12, 8, 7] Huse [7] reports experiments with an implementation of a regular all to all algorithm which ensures that only one processor per node is involved in inter node communication at a time. Algorithmic ....
D. Barth and P. Fraigniaud. Approximation algorithms for structured communication problems. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 180--188, Newport, Rhode Island, June 22--25, 1997. SIGACT/SIGARCH and EATCS.
HiHCoHP - Toward a Realistic Communication Model.. - Cappello.. (2001) (Correct)
....for cluster synchronization [16, 20] generally use heuristics whose quality is known only for special computations on specific clusters. We now develop a broadcast reduction algorithm whose efficiency and optimality under certain circumstances is established analytically. One finds in [6, 8, 17] approximation algorithms and heuristics for broadcast and multicast in the telephone model of NOWs. Optimal broadcast and reduction algorithms within the LogP model appear in [19] Heuristics for broadcast within node heterogeneous clusters are studied empirically in [5] and shown in [22] to be ....
D. Barth and P. Fraigniaud (1997): Approximation algorithms for structured communication problems. 9th ACM Symp. on Parallel Algorithms and Architectures, 180-- 188. (See also: Tech. Rpt. 1239, LRI, Univ. Paris-Sud. (http://www.lri.fr/pierre)).
Minimum-Time Broadcast under Edge-Disjoint Paths Modes - Fraigniaud (2001) (1 citation) Self-citation (Fraigniaud) (Correct)
No context found.
D. Barth and P. Fraigniaud. Approximation algorithms for structured communication problems. In 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA '97), pages 180--188, 1997. (Tech. Rep. LRI-1239, Univ. Paris-Sud. http://www.lri.fr/pierre).
Approximation Algorithms for Minimum-Time Broadcast under the.. - Fraigniaud (2001) (1 citation) Self-citation (Fraigniaud) (Correct)
....to the description of broadcast and gossip protocols performing in a small number of rounds. Under the local model, many authors have considered speci c topologies (see, e.g. 4, 15, 18, 19] but lots of e orts have also been made to derive approximation algorithms for arbitrary topologies [1, 2, 24, 27, 28]. The line model has also been very much investigated, in its two variants: the edge disjoint paths mode [3, 5, 7 9, 11, 13, 22, 26] and the vertex disjoint paths mode [5, 6, 20, 21, 23, 24] The former mode speci es that the paths joining the participants of simultaneous calls must be pairwise ....
D. Barth and P. Fraigniaud. Approximation algorithms for structured communication problems. In 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA '97), pages 180-188, 1997. (Tech. Rep. LRI-1239, Univ. Paris-Sud. http://www.lri.fr/~pierre).
Approximation Algorithms for Collective Communications with.. - Fraigniaud (2000) Self-citation (Fraigniaud) (Correct)
....the case of the CBT and PIM protocols [1, 12] About the gossip problem, Bermond et al. 5] have shown that g(G) n 1) min where min is the smallest integer k such that there is a tree of maximum degree k spanning G. It was conjectured that this bound is tight. Barth and Fraigniaud [3] have shown that it is indeed the case, and moreover that there exists an O(1) approximation algorithm for the gossip problem in the local model. 1.3 Line models The local model aims to model switching technologies such as store and forward. Other switching technologies (such as ....
D. Barth and P. Fraigniaud. Approximation algorithms for structured communication problems. In 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA '97), pages 180-188, 1997. (See also: Tech. Rep. 1239, LRI, Univ. Paris-Sud, 91405 Orsay, France. http://www.lri.fr/~pierre).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC