Patent · US Expired

Generating local addresses and communication sets for data-parallel programs

US5450313A · kind A · utility

20Cited by
6References
5Claims
0Family size

Assignee

Inventors

Key dates

Filing dateMar 24, 1994
Grant dateSep 12, 1995
Priority date
Expiry dateMar 24, 2014

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F8/45
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

An optimizing compilation process generates executable code which defines the computation and communication actions that are to be taken by each individual processor of a computer having a distributed memory, parallel processor architecture to run a program written in a data-parallel language. To this end, local memory layouts of the one-dimensional and multidimensional arrays that are used in the program are derived from one-level and two-level data mappings consisting of alignment and distribution, so that array elements are laid out in canonical order and local memory space is conserved. Executable code then is generated to produce at program run time, a set of tables for each individual processor for each computation requiring access to a regular section of an array, so that the entries of these tables specify the spacing between successive elements of said regular section resident in the local memory of said processor, and so that all the elements of said regular section can be located in a single pass through local memory using said tables. Further executable code is generated to produce at program run time, another set of tables for each individual processor for each communi…

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.