Subscribe

Issue No.08 - August (2008 vol.19)

pp: 1034-1043

ABSTRACT

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.

INDEX TERMS

Data communications aspects, Routing and layout, Parallelism and concurrency, Graph algorithms

CITATION

Teofilo F. Gonzalez, "Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode",

*IEEE Transactions on Parallel & Distributed Systems*, vol.19, no. 8, pp. 1034-1043, August 2008, doi:10.1109/TPDS.2007.70801REFERENCES

- [2] T.F. Gonzalez, “Simple Multimessage Multicasting Approximation Algorithms with Forwarding,”
Algorithmica, vol. 29, pp.511-533, 2001.- [4] A. Goldman, J.G. Peters, and D. Trystram, “Exchanging Messages of Different Sizes,”
J. Parallel and Distributed Computing, vol. 66, pp.1-18, 2006.- [5] S. Ranka, R.V. Shankar, and K.A. Alsabti, “Many-to-Many Personalized Communication with Bounded Traffic,”
Proc. Fifth Symp. the Frontiers of Massively Parallel Computation (Frontiers '95), pp. 20-27, 1995.- [8] E.J. Coffman Jr., M.R. Garey, D.S. Johnson, and A.S. LaPaugh, “Scheduling File Transfers in Distributed Networks,”
SIAM J.Computing, vol. 14, no. 3, pp. 744-780, 1985.- [10] H.A. Choi and S.L. Hakimi, “Data Transfers in Networks,”
Algorithmica, vol. 3, pp. 223-245, 1988.- [14] J. Hall, J. Hartline, A.R. Karlin, J. Saia, and J. Wilkes, “OnAlgorithms for Efficient Data Migration,”
Proc. 12th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '01), pp. 620-629, 2001.- [16] T.F. Gonzalez, “Multimessage Multicasting,”
Proc. Irregular '96, pp. 217-228, 1996.- [17] T.F. Gonzalez, “Distributed Multimessage Multicasting,”
J. Interconnection Networks, vol. 1, no. 4, pp. 303-315, 2000.- [18] T.F. Gonzalez, “Message Dissemination Using Modern Communication Primitives,”
Handbook Parallel Computing: Models, Algorithms, and Applications, S. Rajasekaran and J. Reif, eds., Chapman & Hall/CRC, chapter 36, 2008.- [20] D. Thaker and G. Rouskas, “Multi-Destination Communication in Broadcast WDM Networks: A Survey,”
Optical Networks, vol. 3, no. 1, pp. 34-44, 2002.- [22] S. Khuller, Y.-A. Kim, and Y.-C. Wan, “Broadcasting on Networks of Workstations,”
Proc. 17th ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2005.- [25] T.F. Gonzalez, “Continuous Message Dissemination under the Multicasting Mode,”
Proc. 18th IASTED Int'l Conf. Parallel and Distributed Computing and Systems (PDCS), 2006.- [26] D.B. Shmoys, C. Stein, and J. Wein, “Improved Approximation Algorithms for Shop Scheduling Problems,”
SIAM J. Computing, vol. 23, pp. 617-632, 1994. |