Al-Dubai, Ahmed, Ould-Khaoua, Mohamed and Mackenzie, Lewis (2002) A scalable broadcast algorithm for multiport meshes with minimum communication steps. In: Proceedings of the Ninth International Conference on Parallel and Distributed Systems (ICPADS’02). IEEE Computer Society, USA, pp. 203-208. ISBN 0-7695-1760-9
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial.
Download (107kB) | Request a copy
Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.
|Item Type:||Book Section|
|Additional Information:||Presented at Ninth International Conference on Parallel and Distributed Systems National Central University, Taiwan, ROC, Dec.17-20, 2002 (ICPADS 2002) “© 2002 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works|
|Uncontrolled Keywords:||distributed algorithms; message passing; multiprocessor interconnection networks; network routing; performance evaluation; extending dominating node algorithm; recursive doubling; coded path routing; computational demands; large-scale system; message passing; multiport meshes; network size; parallel applications; performance; scalability; scalable broadcast algorithm;|
|University Divisions/Research Centres:||Faculty of Engineering, Computing and Creative Industries > School of Computing|
|Dewey Decimal Subjects:||000 Computer science, information & general works > 000 Computer science, knowledge & systems > 004 Data processing & computer science > 004.2 Systems analysis, design & performance|
000 Computer science, information & general works > 000 Computer science, knowledge & systems > 005 Computer programming, programs & data
|Library of Congress Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Depositing User:||Computing Research|
|Date Deposited:||15 Dec 2009 12:19|
|Last Modified:||26 Apr 2012 11:09|
Actions (login required)