Towards understanding optimal MIMD queueless routing of arbitrary permutations on hypercubes

Jung, Jean-Pierre; Sakho, I.

doi:10.1007/s11227-011-0574-8

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The condition (b) can be useful for example in streaming context when every message needs to be sent immediately without delay. This is known as memoryless or queueless communication [17]. The condition (c) ensures that (b) cannot be circumvented by sending message to a neighbor and then back.…”

Section: Introductionmentioning

confidence: 99%

Modelling simultaneous broadcasting by level-disjoint partitions

Gregor

Škrekovski

Vukašinović

2018

Applied Mathematics and Computation

View full text Add to dashboard Cite

Simultaneous broadcasting of multiple messages from the same source vertex in synchronous networks is considered under restrictions that each vertex receives at most one message in a unit time step, every received message can be sent out only in the next time step, no message is sent to already informed vertex. The number of outgoing messages in unrestricted, messages have unit length, and we assume full-duplex mode. In [9] we developed a concept of level-disjoint partitions to study simultaneous broadcasting under this model. In this work we consider the optimal number of level-disjoint partitions. We also provide a necessary condition in terms of eccentricity and girth on existence of k v-rooted level-disjoint partitions of optimal height. In particular, we provide a structural characterization of graphs admitting two level-disjoint partitions with the same root.

show abstract

Section: Introductionmentioning

confidence: 99%