All-to-all Broadcast Problems on Cartesian Product Graphs
碩士 === 國立東華大學 === 應用數學系 === 101 === All-to-all communication occurs in many important applications in parallel processing. In this thesis, we study the all-to-all broadcast number(the shortest time needed to complete the all-to-all broadcast) of Cartesian product of graphs under the assumption that:...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/36723390071716391784 |