Research Output

Coded path routing: a new approach to broadcasting in 3-D meshes, Technical Report

  Broadcast is an important collective communication operation required by many real-world parallel applications. This paper proposes the Coded Path Routing (or CPR for short) as a new approach for designing efficient broadcast algorithms for wormhole-switched multicomputer networks. A unique feature of the CPR is that a message can be delivered to an arbitrary number of destination nodes with single start-up latency. The CPR is then used to devise a new broadcast algorithm for the all-port 3-dimensional mesh. The algorithm requires a fixed number of message-passing steps to implement a broadcast operation irrespective of the network size. Results from an 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.

  • Date:

    07 August 2002

  • Publication Status:

    Published

  • Publisher

    IEEE International Performance, Computing and Communications Conference, Proceedings

  • DOI:

    10.1109/IPCCC.2001.918648

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    004 Data processing & computer science

Citation

Al-Dubai, A., & Ould-Khaoua, M. (2002). Coded path routing: a new approach to broadcasting in 3-D meshes, Technical Report. In Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210), 155-162. https://doi.org/10.1109/IPCCC.2001.918648

Authors

Keywords

Broadcasting; 3-d meshes; interconnection networks; wormhole switching; performance analysis; coded path routing;

Monthly Views:

Available Documents