The Community for Technology Leaders
Green Image
We consider the Continuously Delivery Message Dissemination (CDMD) problem over the n processor single-port complete (all links are present and are bi-directional) static network with the multicasting communication primitive. This problem has been shown to be NP-complete even when all messages have equal length. For the CDMD problem we present an efficient approximation algorithm to construct a message routing schedule with total communication time 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(qn) time, where n is the number of processors and q is the total number of messages that the processors receive.
Data communications aspects, Routing and layout, Parallelism and concurrency, Graph algorithms

T. F. Gonzalez, "Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 1034-1043, 2007.
94 ms
(Ver 3.3 (11022016))