병렬처리를 위한 효율적인 사상 기법 = Efficient Mapping Scheme for Parallel Processing

다국어 초록 (Multilingual Abstract)

This paper presents a mapping scheme for parallel processing using an accurate characterization of the communication overhead. A set of objective functions is formulated to evaluate the optimality of mapping a problem graph into a system graph into a system graph. One of them is especially suitable for real-time applecations of parallel processing. These objective functions are different from the conventional objective functions in that the edges in the system graph is employed. This facilitates a more accurate quantification of the communication overhead. An efficient mapping scheme has been developed for the objective functions, where two levels of assignment optimization procedures are employed:initial assignment and pairwise exchange. The mapping scheme has been tested using the hypercube as a system graph.