A Task Mapping Algorithm for Linear Array Processors

スポンサーリンク

概要

• 論文の詳細を見る

• The linear array processor architecture is an important class of interconnection structures that are suitable for VLSI. In this paper we study the problem of mapping a task tree onto a linear array to minimize the total execution time. First, an optimization algorithm is presented for a message scheduling probrem which occurs in the task tree mapping problem. Next, we give a heuristic algorithm for the task tree mapping problem. The algorithm partitions the node set of a task tree into clusters and maps these clusters onto processors. Simulation experiments showed that the proposed algorithm is much more efficient than a conventional algorithm.

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

著者

• Kawaguchi Tsuyoshi

  Faculty Of Engineering Oita University

• Tamura Yoshinori

  Faculty of Engineering, Miyazaki University

• Utsumiya Kouichi

  Faculty of Engineering, Oita University

• Tamura Yoshinori

  Faculty Of Engineering Miyazaki University

• Utsumiya Kouichi

  Faculty Of Engineering Oita University

関連論文

• Operation Scheduling by Annealed Neural Networks
• A Rule-Based Method for Detection of Ribcage Boundary in Chest Radiographs(International Forum on Medical Imaging in Asia 2009 (IFMIA 2009))
• Object Recognition by Matching between Model and Image Line Segments
• An Architecture for Parallelism of OPS5 Production Systems
• A Task Mapping Algorithm for Linear Array Processors

スポンサーリンク