Restricted-Length Hardware Multicasting in Multicomputer Networks

スポンサーリンク

概要

• 論文の詳細を見る

• This paper examines the problem of deadlock in tree based multicast schemes for interconnection networks employing wormhole routing. A detailed graph theoretical study of the problem is carried out and the conditions for prevention of deadlock are presented. Efficient implementation of hardware support for broadcast is seen as critical to the performance of a number of parallel algorithms and a number of previous solutions are briefly discussed. Restricted-length multicast is then introduced and this is followed by a discussion of hardware implementation of restricted-length multicast, the benefits of which are then examined by simulation. Our results indicate that restricted-length multicast can provide a good solution to multicast problems such as multicasting to clusters of nodes found in barrier synchronisation, multicasting to nearest neighbors and the broadcasting to all of the nodes in the network.

• 一般社団法人情報処理学会の論文
• 1995-05-15

著者

• Takahashi Y

  Univ. Tokushima

• Takahashi Yoshizo

  Department Of Information Science And Inteliigent Systems University Of Tokushima.

• Flavell Colin

  Department Of Information Science And Intelligent Systems Faculty Of Engineering University Of Tokus

関連論文

• Efficiency of Parallel Computation on the Binary-Tree Machine CORAL'83
• Strategies and Performance Evaluation of Parallel Computation in Solving the Laplace Equation
• The MEGA Router : A Hardware Message-Passing Gate Array Router
• Restricted-Length Hardware Multicasting in Multicomputer Networks

スポンサーリンク