Sciweavers

TPDS
2008

Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode

13 years 11 months ago
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with the multicasting communication primitive. This problem has been shown to be NP-complete, even when all messages have the same length. For the CDMD problem, we present an efficient approximation algorithm to construct a message-routing schedule with a total communication time of at most 3:5d, where d is the total length of the messages that each processor needs to send or receive. The algorithm takes O
Teofilo F. Gonzalez
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TPDS
Authors Teofilo F. Gonzalez
Comments (0)