登入選單

返回Google圖書搜尋

Array Distribution in Data-parallel Programs

Siddhartha Chatterjee

出版	Xerox Corporation, Palo Alto Research Center, 1994
URL	http://books.google.com.hk/books?id=eP1FAQAAMAAJ&hl=&source=gbs_api

註釋

Abstract: "We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines the assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithm on several test problems."