ملخص
Broadcast algorithms for wormhole-switched meshes have been widely reported in the literature. However, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. As a consequence, many parallel applications cannot be efficiently supported using existing algorithms. Motivated by these observations, this paper presents a new broadcast algorithm based on our previously proposed Coded Path Routing (or CPR for short) [1]. The main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. Furthermore, its performance is insensitive to the network size, i.e., only two message-passing steps are required to implement a broadcast operation irrespective of the network size. Results from a comparative analysis reveal that the new algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.
اللغة الأصلية | English |
---|---|
عنوان منشور المضيف | Proceedings of the ACM Symposium on Applied Computing |
الصفحات | 840-844 |
عدد الصفحات | 5 |
حالة النشر | Published - 2002 |
الحدث | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain المدة: مارس ١١ ٢٠٠٢ → مارس ١٤ ٢٠٠٢ |
Other
Other | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing |
---|---|
الدولة/الإقليم | Spain |
المدينة | Madrid |
المدة | ٣/١١/٠٢ → ٣/١٤/٠٢ |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1700???