Issue No. 10 - October (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.35839
A variant of the mapping problem, namely, systolic contractions of program graphs, is considered. The notion of time links is introduced to mechanize the contraction process; the timing of information flow between processors is modeled in terms of fundamental loop and path equations of delays and is optimized using linear programming. While the results apply primarily to systolic contractions,
systolic contractions; program graphs; time links; loop and path equations; linear programming; graph contractions; program graphics; parallel programming; programming theory.
W. Shen and A. Oruc, "On Systolic Contractions of Program Graphs," in IEEE Transactions on Computers, vol. 38, no. , pp. 1451-1457, 1989.