Searching for authors named "Olivier Delmas" – sorted by Relevance.
8 documents found, showing 1 through 8.
-
Design of fault-tolerant networks on satellites (TWTA redundancy)
- …This article deals with the design of networks to be loaded on satellites. These networks should connect inputs (corresponding to signals arriving on the satellite) to outputs (corresponding to amplifiers), even in case of failures of amplifiers. They are made of links and expensive switches, hence …
- Cited by 1 (1 self) – Add To MetaCart
-
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks
- …In this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched routing. The algorithm is based on a recursive decomposition of a torus. The protocol requires an optima…
- Cited by 8 (1 self) – Add To MetaCart
-
Diffusion En Mode Commutation De Circuits Dans Les Tores De Dimension
- …. This paper deals with broadcasting in k\Gammadimensional torus network under the circuitswitched routing model. We suppose that a node can send a message simultaneously on all its out-links. Here, we consider a broadcast protocol as a succession of rounds ; during each round, the communication dip…
- Add To MetaCart
-
Hamilton circuits in directed Butterfly networks.
- …In this paper we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We also conjecture that ~ WBF(d;n) can be decomposed into d Hamilton circuits, except for d = 2 n = 2, d =…
- Cited by 3 (1 self) – Add To MetaCart
-
Tight Bounds for Broadcasting in the Linear Cost Model
- …This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as α + Lτ. In this model, the communication time of any algorithm A is expressed as the sum R_A · α + T_A ·…
- Add To MetaCart
-
Hamilton cycle decomposition of the Butterfly network
- …In this paper, we prove that the wrapped Butterfly graph WBF(d;n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2.…
- Cited by 2 (2 self) – Add To MetaCart
-
Hamilton circuits in the directed wrapped Butterfly network
- …In this paper, we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We also conjecture that ~ WBF(d;n) can be decomposed into d Hamilton circuits, except for {d = 2 and n = …
- Add To MetaCart
-
Design of Fault-Tolerant Networks for Satellites
- …This article deals with the design of networks to be placed on satellites. These networks should connect inputs (corresponding to signals arriving at the satellite) to outputs (corresponding to ampliers), even in case of failures of ampliers. The networks are made of links and expensive switches,…
- Add To MetaCart
Showing 1 through 8.
