
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Weijia Shang, Edin Hodzic, Zhigang Chen, "On Uniformization of Affine Dependence Algorithms," IEEE Transactions on Computers, vol. 45, no. 7, pp. 827840, July, 1996.  
BibTex  x  
@article{ 10.1109/12.508321, author = {Weijia Shang and Edin Hodzic and Zhigang Chen}, title = {On Uniformization of Affine Dependence Algorithms}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {7}, issn = {00189340}, year = {1996}, pages = {827840}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.508321}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Uniformization of Affine Dependence Algorithms IS  7 SN  00189340 SP827 EP840 EPD  827840 A1  Weijia Shang, A1  Edin Hodzic, A1  Zhigang Chen, PY  1996 KW  Affine dependence KW  communication localization KW  dependence transformation KW  nested loop KW  uniform dependence KW  uniformization. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—This paper deals with the problem of transforming irregular data dependence structures of algorithms with nested loops into more regular ones. Algorithms under consideration are
[1] U. Banerjee,Dependence Analysis for Supercomputing. Norwell, MA: Kluwer, 1988.
[2] J.A.B. Fortes and D.I. Moldvan, "Data Broadcasting in Linear Schedule Array Processors," Proc. 11th Ann. Symp. Computer Architecture, pp. 224231, 1984.
[3] R. Karp, R. Miller, and S. Winograd, "The Organization of Computations for Uniform Recurrence Equations," J. ACM, vol. 14, July 1967.
[4] G.J. Li and B.W. Wah, "The Design of Optimal Systolic Arrays," IEEE Trans. Computers, vol. 34, no. 1, pp. 6677, Jan. 1985.
[5] J.K. Peir and R. Cytron, "Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors," Proc. Int'l Conf. Parallel Processing, pp. 217225,St. Charles, Ill., 1987.
[6] P. Quinton and V. Van Dongen, "The Mapping of Linear Recurrence Equations on Regular Arrays," J. VLSI Signal Processing, vol. 1, no. 2, pp. 95115, Oct. 1989.
[7] W. Shang and J.A.B. Fortes, "On the Optimality of Linear Schedule," J. VLSI Signal Processing, pp. 209220, Jan. 1989.
[8] W. Shang and J.A.B. Fortes, "TimeOptimal and ConflictFree Mappings of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays," Proc. Int'l Conf. Parallel Processing, pp. 101110 (I),St. Charles, Ill., 1990.
[9] W. Shang and J.A.B. Fortes, "Time Optimal Linear Schedules for Algorithms with Uniform Dependencies," IEEE Trans. Computers, vol. 40, June 1991.
[10] W. Shang and J.A.B. Fortes, "Independent Partitioning of Algorithms with Uniform Dependencies," IEEE Trans. Computers, vol. 41, no. 2, pp. 190206, Feb. 1992.
[11] A. Schrijver, Theory of Linear and Integer Programming. John Wiley, 1986.
[12] T. Tzen and L. Ni, "Data Dependence Analysis and Uniformization for Doubly Nested Loops," Proc. Int'l Conf. Parallel Processing, pp. 9199(II),St. Charles, Ill, 1992.
[13] Y. Wong and J.M. Delosme, "Transformation of Broadcasting into Pipelining," Research Report YALEU/DCS/RR544, June 1987.
[14] V. Van Dongen, "The Transformation of nDimensional Linear Recurrences into (n + 1)Dimensional Uniform Recurrences," technical report, Philips Research Laboratory, Belgium, 1988.
[15] V. Van Dongen and P. Quinton, "Uniformization of Linear Recurrence Equations: A Step Toward the Automatic Synthesis of Systolic Arrays," Proc. Int'l Conf. Systolic Arrays,San Diego, 1988.
[16] Y. Yaacoby and P.R. Cappello, "Converting Affine Recurrence Equations to QuasiUniform Recurrence Equations," Technical Report 18, Dept. of Computer Science, Univ. of California Santa Barbara, Feb. 1988.
[17] L.J. Mordell, Diophantine Equations, p. 30.New York: Academic Press, 1969.
[18] W. Shang and B.W. Wah, "Dependence Analysis and Architecture Design for BitLevel Algorithms," Proc. Int'l Conf. Parallel Processing, pp. 3038,St. Charles, Ill, Aug. 1993.
[19] Z. Xing and W. Shang, "An Algorithm for Accurate Data Dependence Test," Proc. IEEE Int'l Conf. Application Specific Array Processors, L. Dadda and B.W. Wah, eds., pp. 404415, Oct. 1993.
[20] A. Darte, L. Khachiyan, and Y. Robert, "Linear Schedule Is Close to Optimality," Proc. IEEE Int'l Conf. Application Specific Array Processors, J. Fortes, E. Lee, and T. Meng, eds., pp. 3746,Berkeley, Calif., Aug. 1992.
[21] P. Feautrier, “Some Efficient Solution to the Affine Scheduling Problem, II MultiDimensional Time,” Int'l J. Parallel Programming, vol. 21, no. 6, pp. 389420, Dec. 1992.
[22] P. Feautrier, “Some Efficient Solution to the Affine Scheduling Problem, II MultiDimensional Time,” Int'l J. Parallel Programming, vol. 21, no. 6, pp. 389420, Dec. 1992.
[23] P. Clauss and C. Mongenet, "Synthesis Aspects in the Design of Efficient Processor Arrays from Affine Recurrence Equations," J. Symbolic Computation, vol. 15, no2.56, pp. 547569, MayJune 1993.
[24] M. Gusev and J. Tasic, "Comparative Analysis of Methods for Broadcasting Elimination," Parallel Computing, vol. 2, no. 8, pp. 857866, Aug. 1992.
[25] P.M. Lenders, "MultiRate Arrays and Affine Recurrence Equations," Parallel Processing Letters, vol. 2, no. 4, pp. 373380, Dec. 1992.
[26] S.V. Rajopadhye, "Synthesizing Systolic Arrays with Control Signals from Recurrence Equations," Distributed Computing, vol. 3, no. 3, pp. 88105, 1989.