登入選單

返回Google圖書搜尋

Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities

Pierre Fraigniaud

出版	Ecole Normale Supérieure de Lyon. Laboratoire de l'Informatique du Parallélisme [LIP], 1990
URL	http://books.google.com.hk/books?id=au_mHgAACAAJ&hl=&source=gbs_api

註釋

Abstract: "Usual algorithms for broadcasting in distributed memory multicomputers generally take as a unit the communication cost between two neighbor processors. A more elaborated model describes this time as a sum of a start up with a propagation time proportional to the message length. This paper proposes a new model which incorporates into the cost function the number of communication links simultaneously used, and thus can also take into account the possibility to communicate through a restricted number of directions. Under these new hypotheses, we analyse and discuss the cost of broadcasting, gossiping, scattering and multiscattering algorithms in n-dimensional hypercubes