On time mapping of uniform dependence algorithms into lowerdimensional processor arrays |
| |
Authors: | Shang W Fortes JAB |
| |
Affiliation: | Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA; |
| |
Abstract: | Most existing methods of mapping algorithms into processor arrays are restricted to the case where n-dimensional algorithms, or algorithms with n nested loops, are mapped into (n-1)-dimensional arrays. However, in practice, it is interesting to map n-dimensional algorithms into (k-1)-dimensional arrays where k<n. A computational conflict occurs if two or more computations of an algorithm are mapped into the same execution time. Based on the Hermite normal form of the mapping matrix, necessary and sufficient conditions are derived to identify mapping without computational conflicts. These conditions are used to find time mappings of n-dimensional algorithms into (k-1)-dimensional arrays, k<n , without computational conflicts. For some applications, the mapping is time-optimal |
| |
Keywords: | |
|
|