
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Alessandro Marongiu, Paolo Palazzari, "Automatic Mapping of System of NDimensional Affine Recurrence Equations (SARE) onto Distributed Memory Parallel Systems," IEEE Transactions on Software Engineering, vol. 26, no. 3, pp. 262275, March, 2000.  
BibTex  x  
@article{ 10.1109/32.842951, author = {Alessandro Marongiu and Paolo Palazzari}, title = {Automatic Mapping of System of NDimensional Affine Recurrence Equations (SARE) onto Distributed Memory Parallel Systems}, journal ={IEEE Transactions on Software Engineering}, volume = {26}, number = {3}, issn = {00985589}, year = {2000}, pages = {262275}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.842951}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Automatic Mapping of System of NDimensional Affine Recurrence Equations (SARE) onto Distributed Memory Parallel Systems IS  3 SN  00985589 SP262 EP275 EPD  262275 A1  Alessandro Marongiu, A1  Paolo Palazzari, PY  2000 KW  Automatic parallelization KW  polytope model KW  affine functions KW  ndimensional projection KW  SARE. VL  26 JA  IEEE Transactions on Software Engineering ER   
Abstract—Automatic extraction of parallelism from algorithms, and the consequent parallel code generation, is a challenging problem. In this work, we present a procedure for automatic parallel code generation in the case of algorithms described through Set of Affine Recurrence Equations (SARE); starting from the original SARE description in an
[1] P. Clauss, “An Efficient Allocation Strategy for Mapping Affine Recurrences into Space and Time Optima Regular Processor Arrays,” Parcella, Sept. 1994.
[2] P. Clauss and G.R. Perrin, “Optimal Mapping of Systolic Algorithms by Regular Instruction Shifts,” Proc. IEEE Int'l Conf. ApplicationSpecific Array Processors, ASAP, pp. 224235, Aug. 1994.
[3] P. Feautrier, “Automatic Parallelization in the Polytope Model,” Les Menuires, pp. 79100, 1996.
[4] 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.
[5] I.N. Herstein, Topics in Algebra. John Wiley&Sons, 1975.
[6] P. Lee and Z. Kedem, “Synthesizing Linear Array Algorithms from Nested For Loop Algorithms,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1,5781,598, Dec. 1988.
[7] C. Lengauer, “Loop Parallelization in the Polytope Model,” CONCUR, pp. 398416, 1993.
[8] V. Loechner and C. Mongenet, “OPERA: A Toolbox for Loop Parallelization,” Proc. Int'l Workshop Software Eng. for Parallel and Distributed Systems, PDSE, 1996.
[9] V. Loechner and C. Mongenet, “A Toolbox for Affine Recurrence Equations Parallelization,” Proc. High Performance Computer Networking '95, pp. 263268, May 1995.
[10] V. Loechner and C. Mongenet, “Solutions to the Communication Minimization Problem for Affine Recurrence Equations,” Proc. EUROPAR '97, pp. 328337, Aug. 1997.
[11] C. Mongenet, “Data Compiling for System of Affine Recurrence Equations,” Proc. IEEE Int'l Conf. ApplicationSpecific Array Processors, ASAP, pp. 212223, Aug. 1994.
[12] C. Mongenet, P. Clauss, and G.R. Perrin, “Geometrical Tools to Map System of Affine Recurrence Equations on Regular Arrays,” Acta Informatica, vol. 31, no. 2, pp. 137160, 1994.
[13] H. Le Verge, V. Van Dongen, and D.K. Wilde, “Loop Nest Synthesis Using the Polyhedral Library,” IRISA, Internal Report no. 830, May 1994.
[14] D.K. Wilde, “A Library for Doing Polyhedral Operations,” IRISA, Internal Report no. 785, Dec. 1993.
[15] A. Bartoloni et al, “A Hardware Implementation of the APE100 Architecture,” Int'l J. Modern Physics, vol. C4, 1993.
[16] L. Lamport, "The Parallel Execution of DO Loops," Comm. ACM, vol. 17, Feb. 1974.
[17] A. Darte and Y. Robert, “AffinebyStatement Scheduling of Uniform and Affine Loop Nests over Parametric Domains,” J. Parallel and Distributed Computing, vol. 29, pp. 4359, 1995.
[18] A. Darte and Y. Robert, “Mapping Uniform Loop Nests onto Distributed Memory Architectures,” Research Report no. 9303, LIPENS Lyon, Jan. 1993.
[19] M.L. Dowling, “Optimal Code Parallelization Using Unimodular Transformations,” Parallel Computing, vol. 16, pp. 157171, 1990.
[20] V. Loechner and D.K. Wilde, “Parameterized Polyhedra and Their Vertices,” Int'l J. Parallel Programming, vol. 25, no. 6, Dec. 1997.
[21] P. Clauss, V. Loechner, and D. Wilde, “Deriving Formulae to Count Solutions to Parameterized Linear Systems Using Ehrhart Polynomials: Applications to the Analysis of NestedLoop Programs,” downloadable fromwww.ee.byu.edu/~wildepubs.html.
[22] P. Clauss and V. Loechner, “Parametric Analysis of Polyhedral Iteration Spaces,” Proc. IEEE Int'l Conf. ApplicationSpecific Array Processors, ASAP, Aug. 1996.
[23] C. Mongenet, “Affine Dependence Classification for Communications Minimization,” ICPS Research Report No. 9607, downloadable fromicps.ustrasbg.frpub96/.
[24] W. Li and K. Pingali, “A Singular Loop Transformation Framework Based on NonSingular Matrices,” Proc. Fifth Workshop Languages and Compilers for Parallel Computers, pp. 249260, 1992.
[25] A. Schrijver, Theory of Linear and Integer Programming. John Wiley, 1986.
[26] V. Lefebvre and P. Feautrier, “Automatic Storage Management for Parallel Programs,” Parallel Computing, vol. 24, pp. 649671, 1998.
[27] S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, “Optimization by Simulated Annealing,” Science, vol. 220, no. 4,589, 13 May 1983.
[28] A. Deckers and E. Aarts, “Global Optimization and Simulated Annealing,” Math. Programming, vol. 50, 1991.
[29] L. Polverini, “Generation of Integral Unimodular Matrices to ProjectNDimensional Algorithms onto amDimensional Processor Space ($m<N$),” master's thesis, Univ.“La Sapienza,”Rome, 1998 (in Italian).
[30] K.H. Zimmermann, “Linear Mapping ofnDimensional Uniform Recurrences ontokDimensional Systolic Arrays,” J. VLSI Signal Processing, vol. 12, pp. 187202, 1996.
[31] K.H. Zimmermann, “A Unifying LatticeBased Approach for the Partitioning of Systolic Arrays via LPGS and LSGP,” J. VLSI Signal Processing, vol. 17, pp. 2141, 1997.