NASA Technical Reports Server (NTRS) : Optimal pdf

NASA Technical Reports Server (NTRS) : Optimal

More Book Details

Description of the Book:

A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum-cost way to evaluate an expression, for several different data parallel architectures. This algorithm applies to any architecture in which the metric describing the cost of moving an array is robust. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Remarks are made on several variations of the problem, some of which are solved and some of which remain open

• Creator/s: NASA Technical Reports Server (NTRS
• Date: 4/24/1990
• Year: 1990
• Book Topics/Themes: NASA Technical Reports Server (NTRS), ALGORITHMS, ARCHITECTURE (COMPUTERS), COMPILERS, DATA STRUCTURES, DATA TRANSMISSION, PARALLEL PROCESSING (COMPUTERS), ROBUSTNESS (MATHEMATICS), COST ANALYSIS, COST EFFECTIVENESS, OPERATING COSTS, TREES (MATHEMATICS), Gilbert, John R., Schreiber, Robert

An excerpt captured from the PDF book