
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Teofilo F. Gonzalez, "Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 8, pp. 10341043, August, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2007.70801, author = {Teofilo F. Gonzalez}, title = {Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {8}, issn = {10459219}, year = {2008}, pages = {10341043}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70801}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode IS  8 SN  10459219 SP1034 EP1043 EPD  10341043 A1  Teofilo F. Gonzalez, PY  2008 KW  Data communications aspects KW  Routing and layout KW  Parallelism and concurrency KW  Graph algorithms VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] T.F. Gonzalez, “Complexity and Approximations for Multimessage Multicasting,” J. Parallel and Distributed Computing, vol. 55, no. 2, pp. 215235, 1998.
[2] T.F. Gonzalez, “Simple Multimessage Multicasting Approximation Algorithms with Forwarding,” Algorithmica, vol. 29, pp.511533, 2001.
[3] J. Bruck, C.T. Ho, S. Kipnis, E. Upfal, and D. Weathersby, “Efficient Algorithms for AlltoAll Communications in Multiport MessagePassing Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 11431156, Nov. 1997.
[4] A. Goldman, J.G. Peters, and D. Trystram, “Exchanging Messages of Different Sizes,” J. Parallel and Distributed Computing, vol. 66, pp.118, 2006.
[5] S. Ranka, R.V. Shankar, and K.A. Alsabti, “ManytoMany Personalized Communication with Bounded Traffic,” Proc. Fifth Symp. the Frontiers of Massively Parallel Computation (Frontiers '95), pp. 2027, 1995.
[6] Y.J. Suh and K.G. Shin, “AlltoAll Personalized Communication in Multidimensional Torus and Mesh Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 1, pp. 3855, Jan. 2001.
[7] S. Ranka, J.C. Wang, and G.C. Fox, “Static and RunTime Algorithms for AlltoMany Personalized Communications on Permutation Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 12661274, 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. 744780, 1985.
[9] J. Whitehead, “The Complexity of File Transfer Scheduling with Forwarding,” SIAM J. Computing, vol. 19, no. 2, pp. 222245, 1990.
[10] H.A. Choi and S.L. Hakimi, “Data Transfers in Networks,” Algorithmica, vol. 3, pp. 223245, 1988.
[11] B. Hajek and G. Sasaki, “Link Scheduling in Polynomial Time,” IEEE Trans. Information Theory, vol. 34, no. 5, pp. 910917, 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. 24752481, Nov. 1982.
[13] P.I. RiveraVega, R. Varadarajan, and S.B. Navathe, “Scheduling File Transfers in Fully Connected Networks,” Networks, vol. 22, pp. 563588, 1992.
[14] J. Hall, J. Hartline, A.R. Karlin, J. Saia, and J. Wilkes, “OnAlgorithms for Efficient Data Migration,” Proc. 12th Ann. ACMSIAM Symp. Discrete Algorithms (SODA '01), pp. 620629, 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. 701708, July 2003.
[16] T.F. Gonzalez, “Multimessage Multicasting,” Proc. Irregular '96, pp. 217228, 1996.
[17] T.F. Gonzalez, “Distributed Multimessage Multicasting,” J. Interconnection Networks, vol. 1, no. 4, pp. 303315, 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. 655662, 1997.
[20] D. Thaker and G. Rouskas, “MultiDestination Communication in Broadcast WDM Networks: A Survey,” Optical Networks, vol. 3, no. 1, pp. 3444, 2002.
[21] S. Khuller, Y.A. Kim, and YC. Wan, “Algorithms for Data Migration with Cloning,” SIAM J. Computing, vol. 33, no. 2, pp.448461, 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. 116129, 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.1829, 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. 617632, 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. 288294, 1997.