The complexity of systolic dissemination of information in interconnection networks

J. Hromkovič; R. Klasing; W. Unger; H. Wagener; D. Pardubská

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1994)

  • Volume: 28, Issue: 3-4, page 303-342
  • ISSN: 0988-3754

How to cite

top

Hromkovič, J., et al. "The complexity of systolic dissemination of information in interconnection networks." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 28.3-4 (1994): 303-342. <http://eudml.org/doc/92483>.

@article{Hromkovič1994,
author = {Hromkovič, J., Klasing, R., Unger, W., Wagener, H., Pardubská, D.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {systolic dissemination of information; interconnection networks},
language = {eng},
number = {3-4},
pages = {303-342},
publisher = {EDP-Sciences},
title = {The complexity of systolic dissemination of information in interconnection networks},
url = {http://eudml.org/doc/92483},
volume = {28},
year = {1994},
}

TY - JOUR
AU - Hromkovič, J.
AU - Klasing, R.
AU - Unger, W.
AU - Wagener, H.
AU - Pardubská, D.
TI - The complexity of systolic dissemination of information in interconnection networks
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1994
PB - EDP-Sciences
VL - 28
IS - 3-4
SP - 303
EP - 342
LA - eng
KW - systolic dissemination of information; interconnection networks
UR - http://eudml.org/doc/92483
ER -

References

top
  1. [BHMS90] A. BAGCHI, S. L. HAKIMI, J. MITCHEM and E. SCHMEICHEL, Parallel algorithms for gossiping by mail, Information, Process. Letters, 1990, 34, pp. 197-202. Zbl0696.68048MR1060435
  2. [CC84] C. CHOFFRUT and K. CULIK II, On real-time cellular automata and trellis automata, Acta Informatica, 1984, 21, pp. 393-407. Zbl0534.68039MR767316
  3. [CGS83] K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic automata for VLSI on balanced trees, Acta Informatica, 1983, 18, pp. 335-344. Zbl0493.68054MR691733
  4. [CGS84] K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic trellis automata. Part I, Intern. J. Comput. Math., 1984, 15, pp. 195-212. Zbl0571.68041MR754266
  5. [CSW84] K. CULIK II, A. SALOMAA and D. WOOD, Systolic tree acceptors, R.A.I.R.O. Theoretical Informatics, 1984, 18, pp. 53-69. Zbl0571.68043MR750451
  6. [FHMMM92] R. FELDMANN, J. HROMKOVIČ, S. MADHAVAPEDDY, B. MONIEN and P. MYSLIWIETZ, Optimal algorithms for dissemination of information in generalized communication modes, Proc. PARLE'92, Springer-Verlag, Lecture Notes in Computer Science, 1992, 605, pp. 115-130. Zbl0823.68041MR1230238
  7. [HHL88] S. M. HEDETNIEMI, S. T. HEDETNIEMI and A. L. LIESTMANN, A survey of gossiping and broadcasting in communication networks, Networks, 1988, 18, pp. 319-349. Zbl0649.90047MR964236
  8. [HJM93] J. HROMKOVIČ, C.-D. JESCHKE and B. MONIEN, Note an optimal gossiping in some weak-connected graphs, Theoretical Computer Science (to appear). Zbl0824.68010MR1275825
  9. [HKMP93] J. HROMKOVIČ, R. KLASING, B. MONIEN and R. PEINE, Dissemination of information in interconnection networks (broadcasting & gossiping), In Combinatorial Network Theory (Frank Hsu, Ding-Zhu Du, Eds), Science Press, AMS 1993 (to appear). Zbl0840.68088MR1382871
  10. [IK84] O. H. IBARRA and S. M. KIM, Characterizations and computational complexity of systolic trellis automata, Theoretical Computer Science, 1984, 29, pp. 123-153. Zbl0536.68048MR742405
  11. [IKM85] O. H. IBARRA, S. M. KIM and S. MORAN, Sequential machine characterizations of trellis and cellular automata and applications, SIAM J. Comput., 1985, 14, pp. 426-447. Zbl0574.68044MR784748
  12. [IPK85] O. H. IBARRA, M. A. PALIS and S. M. KIM, Fast parallel language recognition by cellular automata, Theoretical Computer Science, 1985, 41, pp. 231-246. Zbl0591.68054MR847679
  13. [Ku79] H. T. KUNG, Let's design algorithms for VLSI systems, In Proc. of the Caltech Conference of VLSI (CL. L. Seifz Ed.), Pasadena, California, 1979, pp. 65-90. 
  14. [LHL93] R. LABAHN, S. T. HEDETNIEMI and R. LASKAR, Periodic gossiping on trees, in Discrete Applied Mathematics (to appear). Zbl0836.68085MR1291010
  15. [LR93a] A. L. LIESTMAN and D. RICHARDS, Perpetual gossiping, Technical Report, Simon Fraser University, Vancouver, Canada, 1993. MR1279556
  16. [LR93b] A. L. LIESTMAN and D. RICHARDS, Network communication in edge-colored graphs: Gossiping, IEEE Trans. Par. Distr. Syst., 1993, 4, pp. 438-445. 
  17. [MS90] B. MONIEN and I. H. SUDBOROUGH, Embedding one interconnection network in another, Computing Suppl., 1990, 7, pp. 257-282. Zbl0699.68017MR1059934

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.