Recent Developments in Mesh Routing Algorithms(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク

概要

• 論文の詳細を見る

• The two dimensional mesh is widely considered to be a promising parallel architecture in its scalability. In this architecture, processors are naturally placed at intersections of horizontal and vertical grids, while there can be three different types of communication links: (i) The first type is the most popular model, called a mesh-connected computer: Each processor is connected to its four neighbours by local connections.(ii) Each processor of the second type is connected to a couple of (row and column)buses. The system is then called a mesh of buses. (iii) The third model is equipped with both buses and local connections, which is called a mesh-connected computer with buses. Mesh routing has received considerable attention for the last two decades, and a variety of algorithms have been proposed. This paper provides an overview of lower and upper bounds for algorithms, with pointers to the literature, and suggests further research directions for mesh routing.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Iwama K

  Kyoto Univ. Kyoto Jpn

• IWAMA KAZUO

  School of Informatics, Kyoto University

• MIYANO Eiji

  Common Technical Courses, Kyushu Institute of Design

• Iwama Kazuo

  School Of Informatics Kyoto University

• Miyano Eiji

  Common Technical Courses Kyushu Institute Of Design

関連論文

• Generating Random Benchmark Circuits with Restricted Fan-Ins (Special Issue on Synthesis and Verification of Hardware Design)
• Average/Worst-Case Gap of Quantum Query Complexities
• Recent Developments in Mesh Routing Algorithms(Special Issue on Algorithm Engineering : Surveys)
• The Axis-bound CNN Problem(Algorithms and Data Structures)
• DS-1-2 Packing Squares with Profits into a Rectangle
• Approximated Vertex Cover for Graphs with Perfect Matchings(Invited Papers from New Horizons in Computing)
• DS-1-11 Reconstructing Strings from Substrings with Quantum Query

スポンサーリンク