ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지

One-to-All Broadcasting of Even Networks for One-Port and All-Port Models

  • Kim, Jong-Seok (Department of Information & Communication Engineering, Yeungnam University) ;
  • Lee, Hyeong-Ok (Department of Computer Education, Sunchon National University) ;
  • Kim, Sung-Won (Department of Information & Communication Engineering, Yeungnam University)
  • Received : 2008.12.10
  • Accepted : 2009.02.18
  • Published : 2009.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we demonstrate that the broadcasting algorithm proposed by Madabhushi and others is incorrect. We introduce efficient one-to-all broadcasting schemes of even networks for one-port and all-port models. The broadcasting time of the one-port model is 2d-3 and that of the all-port model is d-1. The total time steps taken by the proposed algorithms are optimal.

Keywords

References

  1. J.-S. Kim and H.-O. Lee, “One-to-All Broadcasting of Odd Networks for One-Port and All-Port Models,” ETRI Journal, vol. 30, no. 6, 2008, pp. 856-858. https://doi.org/10.4218/etrij.08.0208.0272
  2. A. Ghafoor, “A Class of Fault-Tolerant Multiprocessor Networks,” IEEE Trans. Reliability, vol. 38, no. 1, 1989, pp. 5-15. https://doi.org/10.1109/24.24569
  3. J.-S. Kim et al., “Comments on 'A Class of Fault-Tolerant Multiprocessor Networks',” to appear in IEEE Trans. Reliability.
  4. J.-S. Kim et al., “Topological Relationships among Folded Hypercubes, Even Graphs, and Odd Graphs,” Proc. Parallel and Distributed Processing Techniques and Applications, July 2008, pp. 188-192.
  5. J.-S. Kim et al., “Fault Diameter of Even Networks,” Proc. NCM, Sept. 2008, pp. 406-411.
  6. S.V.R. Madabhushi et al., “Analysis of the Modified Even Networks,” Proc. Int'l Parallel & Distributed Processing Symp., Dec. 1991, pp. 128-131.