ملخص
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.
اللغة الأصلية | English |
---|---|
عنوان منشور المضيف | IEEE International Performance, Computing and Communications Conference, Proceedings |
الصفحات | 155-162 |
عدد الصفحات | 8 |
حالة النشر | Published - 2001 |
الحدث | 20th IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States المدة: أبريل ٤ ٢٠٠١ → أبريل ٦ ٢٠٠١ |
Other
Other | 20th IEEE International Performance, Computing, and Communications Conference |
---|---|
الدولة/الإقليم | United States |
المدينة | Phoenix, AZ |
المدة | ٤/٤/٠١ → ٤/٦/٠١ |
ASJC Scopus subject areas
- ???subjectarea.asjc.2200.2214???