Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees

@article{Tseng1997TowardOB,
  title={Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees},
  author={Yu-Chee Tseng and Jang-Ping Sheu},
  journal={IEEE Trans. Computers},
  year={1997},
  volume={46},
  pages={593-599}
}
In a multicomputer network, sending a packet typically incurs two costs: start-up time and transmission time. This work is motivated by the observation that most broadcast algorithms in the literature for the star graph networks only try to minimize one of the costs. Thus, many algorithms, though claimed to be optimal, are only so when one of the costs is negligible. In this paper, we try to optimize both costs simultaneously for four types of broadcast problems: one-toall or all-to-all… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Similar Papers

Loading similar papers…