| Summary: | 碩士 === 國立臺灣大學 === 資訊工程研究所 === 84 === The goal of this paper is to discuss how to merge messages
introduced by HPF programs so that the cost of communication
can be reduced. The basic strategy of our approach is divide-
and-conquer. By using graph notations, called message graph,
we study communication properties for one axis of processor
array first. Then, by the idea of Cartesian product of message
graphs, we can acquire communication properties for the whole
processor array easily. Based upon those properties, we can
detect messages that can be merged by others. This study is
also helpful for an HPF compiler when allocating logical
processors to physical processors.
|
|---|
