{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:40:27Z","timestamp":1737373227224,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675532"},{"type":"electronic","value":"9783540454922"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45492-6_33","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T23:19:58Z","timestamp":1187219998000},"page":"333-342","source":"Crossref","is-referenced-by-count":3,"title":["High Level Software Synthesis of Affine Iterative Algorithms onto Parallel Architectures"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Marongiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Palazzari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Cinque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferdinando","family":"Mastronardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,12]]},"reference":[{"key":"33_CR1","unstructured":"Clauss P., \u201cAn Efficient Allocation Strategy for Mapping Affine Recurrences into Space and Time Optima Regular Processor Arrays\u201d, Parcella, Sep. 1994."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Clauss P., Perrin G.R., \u201cOptimal Mapping of Systolic Algorithms by Regular Instruction Shifts\u201d, IEEE Intern. Conf. Application-Specific Array Processors, pp. 224\u2013235, Aug. 1994.","DOI":"10.1109\/ASAP.1994.331801"},{"key":"33_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-61736-1_44","volume-title":"Les Menuires","author":"P. Feautrier","year":"1996","unstructured":"Feautrier P., \u201cAutomatic Parallelization in the Polytope Model\u201d, Les Menuires, Vol. LNCS 1132 pp. 79\u2013100, 1996."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01379404","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"Feautrier P., \u201cSome Efficient Solution to the Affine Scheduling Problem, II Multi-Dimensional Time\u201d, Intern. J. Parallel Programming, Vol. 21, pp. 389\u2013420, Dec. 1992.","journal-title":"Intern. J. Parallel Programming"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00925828","volume":"3","author":"H. Verge Le","year":"1991","unstructured":"H. Le Verge, Ch. Mauras, P. Quinton-\u201cThe alpha language and its use for the design of systolic arrays\u201d-Journal of VLSI and signal processing, 3: 173\u2013182, 1991.","journal-title":"Journal of VLSI and signal processing"},{"issue":"12","key":"33_CR6","first-page":"1578","volume":"C-37","author":"P. Lee","year":"1988","unstructured":"Lee P., Kedem Z., \u201cSynthesizing Linear Array Algorithms from Nested For Loop Algorithms\u201d, IEEE Trans. on Computers, Vol. C-37, No. 12, pp. 1578\u20131598, Dec. 1988.","journal-title":"IEEE Trans. on Computers"},{"key":"33_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-57208-2_28","volume-title":"CONCUR","author":"C. Lengauer","year":"1993","unstructured":"Lengauer C., \u201cLoop Parallelization in the Polytope Model\u201d, CONCUR, Vol. LNCS 715, pp. 398\u2013416, 1993."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Loechner V., Mongenet C., \u201cOPERA: A Toolbox for Loop Parallelization\u201d, International Workshop on Software Engineering for Parallel and Distribuited Systems, PDSE, 1996.","DOI":"10.1007\/978-0-387-34984-8_12"},{"key":"33_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BFb0046638","volume-title":"HPCN\u2019 95","author":"V. Loechner","year":"1995","unstructured":"Loechner V., Mongenet C., \u201cA Toolbox for Affine Recurrence Equations Parallelization\u201d,HPCN\u2019 95, Milan, Vol. LNCS 919. pp. 263\u2013268, May 1995."},{"key":"33_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/BFb0002752","volume-title":"EUROPAR\u2019 97","author":"V. Loechner","year":"1997","unstructured":"Loechner V., Mongenet C., \u201cSolutions to the Communication Minimization Problem for Affine Recurrence Equations\u201d, EUROPAR\u2019 97, Vol. LNCS 1300, pp.328\u2013337 1997."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Mongenet C., \u201cData Compiling for System of Affine Recurrence Equations\u201d, IEEE Intern. Conf. on Application-Specific Array Processors, ASAP, pp. 212\u2013223, Aug. 1994.","DOI":"10.1109\/ASAP.1994.331802"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01192158","volume":"31","author":"C. Mongenet","year":"1994","unstructured":"Mongenet C., Clauss P., Perrin G.R., \u201cGeometrical Tools to Map System of Affine Recurrence Equations on Regular Arrays\u201d, Acta Informatica, Vol. 31, No. 2, pp. 137\u2013160, 1994.","journal-title":"Acta Informatica"},{"key":"33_CR13","unstructured":"D. K. Wilde-\u201cThe ALPHA language\u201d-Technical Report Internal Publication N.827, IRISA, May 1994"},{"key":"33_CR14","unstructured":"Marongiu A., Palazzari P., \u201cA New Memory-Saving Technique to Map System of Affine Recurrence Equations (SARE) onto Distributed Memory Systems\u201d. Proc. Intern. Parallel Processing Symposium IPPS 99 \u2014 Puerto Rico \u2014 April, 12th, 16th 1999."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Bartoloni et al, \u201cA Hardware implementation of the APE100 architecture\u201d, Int. Journal of Modern Physics, C4, 1993.","DOI":"10.1142\/S0129183193000744"},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport L., \u201cThe parallel execution of DO loops\u201d, Comm. Of the ACM, 17(2):83\u201393, Feb. 1974.","journal-title":"Comm. Of the ACM"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jpdc.1995.1105","volume":"29","author":"A. Darte","year":"1995","unstructured":"Darte A., Robert Y., \u201cAffine-by-Statement scheduling of uniform and affine loop nests over parametric domains\u201d, Journ. of Parallel and Distributed Computing, Vol. 29, pp 43\u201359, 1995","journal-title":"Journ. of Parallel and Distributed Computing"},{"key":"33_CR18","unstructured":"Darte A., Robert Y., \u201cMapping uniform loop nests onto distributed memory architectures\u201d, Research Report n o 93-03 LIP-ENS Lyon, Jan. 1993."},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-8191(90)90055-E","volume":"16","author":"M.L. Dowling","year":"1990","unstructured":"Dowling M.L., \u201cOptimal code parallelization using unimodular transformations\u201d, Parallel Computing, 16, pp. 157\u2013171. 1990.","journal-title":"Parallel Computing"},{"key":"33_CR20","unstructured":"Mongenet C., \u201cAffine dependence classification for communications minimization\u201d, ICPS Research Report No. 96-07, downloadable from http:\/\/icps.u-strasbg.fr\/pub-96"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Kirkpatrick S., Gelatt C.D., Vecchi M.P., \u201cOptimization by simulated annealing\u201d, Science, Vol. 220, N. 4589, 13 May 1983","DOI":"10.1126\/science.220.4598.671"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"M. W. Hall, J. M. Anderson, S. P. Amarasinghe, B. R. Murphy, S.-W. Liao, E. Bugnion and M. S. Lam, \u201cMaximizing Multiprocessor Performance with the SUIF Compiler\u201d, IEEE Computer, December 1996.","DOI":"10.1109\/2.546613"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"A. W. Lim and M. S. Lam, \u201cMaximizing Parallelism and Minimizing Synchronization with Affine Transforms\u201d, Conference Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January, 1997.","DOI":"10.1145\/263699.263719"},{"key":"33_CR24","unstructured":"Marongiu A., Palazzari P., \u201cAutomatic Mapping of System of N-dimensional Affine Recurrence Equations (SARE) onto Distributed Memory Parallel Systems\u201d Accepted to appear in the special issue of IEEE Trans. Software Engineering on Architecture-Independent Languages and Software Tools for Parallel Processing"},{"key":"33_CR25","unstructured":"A. Marongiu, P. Palazzari: \u201cOptimization of Automatically Generated Parallel Programs\u201d The 3rd IMACS International Multiconference on Circuits, Systems, Communications and Computers (CSCC\u201999)-July 4\u20138, 1999, Athens (Greece)."},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"P. Feautrier, \u201cData Flow Analysis of Scalar end Array References\u201d, Intern. Journal of Parallel Programming, vol. 20, n. 1, 1991","DOI":"10.1007\/BF01407931"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"High Performance Fortran Forum, \u201cHigh Performance Fortran language Specification\u201d, Sci. Prog., vol. 2, 1993.","DOI":"10.1145\/190783.1041310"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"J. Merlin, A. Hey, \u201cAn Introduction to High Performance Fortran\u201d, Sci. Prog. vol. 4, 1995.","DOI":"10.1155\/1995\/612973"},{"key":"33_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1007944932429","volume":"17","author":"K.H. Zimmermann","year":"1997","unstructured":"Zimmermann K.H., \u201cA Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP\u201d, Journal of VLSI Signal Processing, 17, pp 21\u201341, 1997.","journal-title":"Journal of VLSI Signal Processing"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45492-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:15:22Z","timestamp":1737371722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45492-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675532","9783540454922"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-45492-6_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}