The Community for Technology Leaders
RSS Icon
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.70801
REFERENCES
[1] T.F. Gonzalez, “Complexity and Approximations for Multimessage Multicasting,” J. Parallel and Distributed Computing, vol. 55, no. 2, pp. 215-235, 1998.
[2] T.F. Gonzalez, “Simple Multimessage Multicasting Approximation Algorithms with Forwarding,” Algorithmica, vol. 29, pp.511-533, 2001.
[3] J. Bruck, C.-T. Ho, S. Kipnis, E. Upfal, and D. Weathersby, “Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 1143-1156, Nov. 1997.
[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.
[6] Y.-J. Suh and K.G. Shin, “All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 1, pp. 38-55, Jan. 2001.
[7] S. Ranka, J.-C. Wang, and G.C. Fox, “Static and Run-Time Algorithms for All-to-Many Personalized Communications on Permutation Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 1266-1274, Dec. 1994.
[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.
[9] J. Whitehead, “The Complexity of File Transfer Scheduling with Forwarding,” SIAM J. Computing, vol. 19, no. 2, pp. 222-245, 1990.
[10] H.A. Choi and S.L. Hakimi, “Data Transfers in Networks,” Algorithmica, vol. 3, pp. 223-245, 1988.
[11] B. Hajek and G. Sasaki, “Link Scheduling in Polynomial Time,” IEEE Trans. Information Theory, vol. 34, no. 5, pp. 910-917, 1988.
[12] I.S. Gopal, G. Bongiovanni, M.A. Bonuccelli, D.T. Tang, and C.K. Wong, “An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Band Width Beams,” IEEE Trans. Comm., vol. 30, no. 11, pp. 2475-2481, Nov. 1982.
[13] P.I. Rivera-Vega, R. Varadarajan, and S.B. Navathe, “Scheduling File Transfers in Fully Connected Networks,” Networks, vol. 22, pp. 563-588, 1992.
[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.
[15] T.F. Gonzalez, “An Efficient Algorithm for Gossiping in the Multicasting Communication Environment,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 7, pp. 701-708, July 2003.
[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.
[19] H. Shen, “Efficient Multiple Multicasting in Hypercubes,” J.Systems Architecture, vol. 43, no. 9, pp. 655-662, 1997.
[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.
[21] S. Khuller, Y.-A. Kim, and Y-C. Wan, “Algorithms for Data Migration with Cloning,” SIAM J. Computing, vol. 33, no. 2, pp.448-461, 2004.
[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.
[23] R. Gandhi, M.M. Halldorsson, M. Kortsarz, and H. Shachnai, “Improved Results for Data Migration and Open Shop Scheduling,” ACM Trans. Algorithms, vol. 2, no. 1, pp. 116-129, 2006.
[24] Y.S. Hwang, R. Das, J. Saltz, M. Hodoscek, and B. Brooks, “Parallelizing Molecular Dynamics Programs for Distributed Memory Machines,” IEEE Computational Science and Eng., vol. 2, no. 2, pp.18-29, 1995.
[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.
[27] D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, and D.B. Shmoys, “Short Shop Schedules,” Operations Research, vol. 45, no. 2, pp. 288-294, 1997.
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool