Abstract
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor pi has transmission time ti, which is the time taken to send a message to any other processor in the cluster. Previously, it was shown that the Fastest Node First method (FNF) gives a 1.5 approximate solution. In this paper we show that there is a polynomial time approximation scheme for the problems of broadcasting and multicasting in such a heterogenous cluster. © Springer-Verlag 2004.
Cite
CITATION STYLE
Khuller, S., Kim, Y. A., & Woeginger, G. (2004). Approximation Schemes for Broadcasting in Heterogenous Networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3122, 163–170. https://doi.org/10.1007/978-3-540-27821-4_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
