메뉴 건너뛰기




Volumn 9, Issue 6, 1998, Pages 513-525

Gossiping on meshes and tori

Author keywords

Global communication; Gossip; Mesh networks; Torus networks; Wormhole routing

Indexed keywords

COMPUTER WORMS;

EID: 0032097485     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.689439     Document Type: Article
Times cited : (19)

References (18)
  • 3
    • 84955578733 scopus 로고    scopus 로고
    • Circuit-Switched Gossiping in 3-Dimensional Torus Networks
    • O. Delmas and S. Perennes, "Circuit-Switched Gossiping in 3-Dimensional Torus Networks," Proc. Second Euro-Par Conf., LNCS vol. 1123, pp. 370-373, 1996.
    • (1996) Proc. Second Euro-Par Conf., LNCS , vol.1123 , pp. 370-373
    • Delmas, O.1    Perennes, S.2
  • 8
    • 0000733243 scopus 로고    scopus 로고
    • Randomized Multipacket Routing and Sorting on Meshes
    • M. Kaufmann and J.F. Sibeyn, "Randomized Multipacket Routing and Sorting on Meshes," Algorithmica, vol. 17, pp. 224-244, 1997.
    • (1997) Algorithmica , vol.17 , pp. 224-244
    • Kaufmann, M.1    Sibeyn, J.F.2
  • 9
    • 0000612303 scopus 로고
    • Fast Gossiping for the Hypercube
    • D.W. Krumme, "Fast Gossiping for the Hypercube," SIAM J. Computers, vol. 21, no. 2, pp. 365-380, 1992.
    • (1992) SIAM J. Computers , vol.21 , Issue.2 , pp. 365-380
    • Krumme, D.W.1
  • 12
    • 84943681390 scopus 로고
    • A Survey of Wormhole Routing Techniques in Direct Networks
    • Feb.
    • L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
    • (1993) Computer , vol.26 , Issue.2 , pp. 62-76
    • Ni, L.M.1    McKinley, P.K.2
  • 14
    • 0013238536 scopus 로고
    • K-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
    • S. Rajasekaran, "k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh," J. Algorithms, vol. 19, no. 3, pp. 361-382, 1995.
    • (1995) J. Algorithms , vol.19 , Issue.3 , pp. 361-382
    • Rajasekaran, S.1
  • 15
    • 0023213138 scopus 로고
    • A Logarithmic Time Sort for Linear Size Networks
    • J. Reif and L.G. Valiant, "A Logarithmic Time Sort for Linear Size Networks," J. ACM, vol. 34, no. 1, pp. 68-76, 1987.
    • (1987) J. ACM , vol.34 , Issue.1 , pp. 68-76
    • Reif, J.1    Valiant, L.G.2
  • 18
    • 0031120391 scopus 로고    scopus 로고
    • Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach
    • Y.-C. Tseng, T-H. Lin, S.K.S. Gupta, and D.K. Panda, "Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach," IEEE Trans. Parallel and Distributed Systems, vol. 8, pp. 380-396, 1997.
    • (1997) IEEE Trans. Parallel and Distributed Systems , vol.8 , pp. 380-396
    • Tseng, Y.-C.1    Lin, T.-H.2    Gupta, S.K.S.3    Panda, D.K.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.