{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:24Z","timestamp":1725560604320},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280095"},{"type":"electronic","value":"9783540318132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532378_27","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T19:16:36Z","timestamp":1279653396000},"page":"379-393","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Parallelization Using the Value Evolution Graph"],"prefix":"10.1007","author":[{"given":"Silvius","family":"Rus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Rauchwerger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Ammarguellat, Z., Harrison, W.L.: III. Automatic recognition of induction variables and recurrence relations by abstract interpretation. In: ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, White Plains, N.Y, June 1990, pp. 283\u2013295 (1990)","DOI":"10.1145\/93548.93583"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Ballance, R.A., Maccabe, A.B., Ottenstein, K.J.: The Program Dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In: ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, White Plains, N.Y, June 1990, pp. 257\u2013271 (1990)","DOI":"10.1145\/93548.93578"},{"key":"27_CR3","unstructured":"Blume, W., Eigenmann, R.: Symbolic Range Propagation. Technical Report 1381, Univ of Illinois at Urbana-Champaign, Cntr for Supercomputing R&D (1994)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BFb0038664","volume-title":"Languages and Compilers for Parallel Computing","author":"D. Callahan","year":"1992","unstructured":"Callahan, D.: Recognizing and parallelizing bounded recurrences. In: Banerjee, U., Nicolau, A., Gelernter, D., Padua, D.A. (eds.) LCPC 1991. LNCS, vol.\u00a0589, pp. 169\u2013185. Springer, Heidelberg (1992)"},{"issue":"7","key":"27_CR5","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/T-C.1975.224291","volume":"24","author":"S.-C. Chen","year":"1975","unstructured":"Chen, S.-C., Kuck, D.J.: Time and parallel processor bounds for linear recurrence systems. IEEE Transactions on Computers\u00a024(7), 701\u2013717 (1975)","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/178243.178255","volume-title":"Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation","author":"A.L. Fisher","year":"1994","unstructured":"Fisher, A.L., Ghuloum, A.M.: Parallelizing complex scans and reductions. In: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, pp. 135\u2013146. ACM Press, New York (1994)"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M.P. Gerlek","year":"1995","unstructured":"Gerlek, M.P., Stolz, E., Wolfe, M.: Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems\u00a017(1), 85\u2013122 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/209936.209944","volume-title":"Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming","author":"A.M. Ghuloum","year":"1995","unstructured":"Ghuloum, A.M., Fisher, A.L.: Flattening and parallelizing irregular, recurrent loop nests. In: Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, Santa Barbara, CA, pp. 58\u201367. ACM Press, New York (1995)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/224170.224318","volume-title":"Proceedings of the 1995 ACM\/IEEE conference on Supercomputing (CDROM)","author":"J. Gu","year":"1995","unstructured":"Gu, J., Li, Z., Lee, G.: Symbolic array dataflow analysis for array privatization and program parallelization. In: Proceedings of the 1995 ACM\/IEEE conference on Supercomputing (CDROM), p. 47. ACM Press, New York (1995)"},{"issue":"6","key":"27_CR10","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1023\/A:1007560600904","volume":"28","author":"M. Gupta","year":"2000","unstructured":"Gupta, M., Mukhopadhyay, S., Sinha, N.: Automatic parallelization of recursive procedures. International Journal of Parallel Programming\u00a028(6), 537\u2013562 (2000)","journal-title":"International Journal of Parallel Programming"},{"issue":"1\u20134","key":"27_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/176454.176507","volume":"2","author":"R. Gupta","year":"1993","unstructured":"Gupta, R.: Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems\u00a02(1\u20134), 135\u2013150 (1993)","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1145\/233561.233568","volume":"18","author":"M.R. Haghighat","year":"1996","unstructured":"Haghighat, M.R., Polychronopoulos, C.D.: Symbolic analysis for parallelizing compilers. ACM Transactions on Programming Languages and Systems\u00a018(4), 477\u2013518 (1996)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"12","key":"27_CR13","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/2.546613","volume":"29","author":"M. Hall","year":"1996","unstructured":"Hall, M., Anderson, J., Amarasinghe, S., Murphy, B., Liao, S.-W., Bugnion, E., Lam, M.: Maximizing Multiprocessor Performance with the SUIF Compiler. IEEE Computer\u00a029(12), 84\u201389 (1996)","journal-title":"IEEE Computer"},{"key":"27_CR14","unstructured":"Hoeflinger, J.: Interprocedural Parallelization Using Memory Classification Analysis. PhD thesis, University of Illinois, Urbana-Champaign (August 1998)"},{"key":"27_CR15","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e0J\u00e0","year":"1992","unstructured":"J\u00e0J\u00e0, J.: An Introduction to Parallel Algorithms. Addison\u2013Wesley, Reading (1992)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Liao, S.-W., Diwan, A., Jr., R.P.Bosch, Ghuloum, A.M., Lam, M.S.: SUIF explorer: An interactive and interprocedural parallelizer. In: Principles Practice of Parallel Programming, pp. 37\u201348 (1999)","DOI":"10.1145\/329366.301108"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Lin, Y., Padua, D.: Analysis of irregular single-indexed array accesses and its application in compiler optimizations. In: International Conference on Compiler Construction, pp. 202\u2013218 (2000)","DOI":"10.1007\/3-540-46423-9_14"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-49530-4_4","volume-title":"Languages, Compilers, and Run-Time Systems for Scalable Computers","author":"Y. Lin","year":"1998","unstructured":"Lin, Y., Padua, D.A.: On the automatic parallelization of sparse and irregular fortran programs. In: O\u2019Hallaron, D.R. (ed.) LCR 1998. LNCS, vol.\u00a01511, pp. 41\u201356. Springer, Heidelberg (1998)"},{"key":"27_CR19","unstructured":"Pottenger, W., Eigenmann, R.: Parallelization in the presence of generalized induction and reduction variables. Technical Report 1396, Univ. of Illinois at UrbanaChampaign, Center for Supercomp. R&D (January 1995)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Pugh, W.: The Omega test: A fast and practical integer programming algorithm for dependence analysis. In: Supercomputing 1991, Albuquerque, N.M, November 1991, pp. 4\u201313 (1991)","DOI":"10.1145\/125826.125848"},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/71.752782","volume":"10","author":"L. Rauchwerger","year":"1999","unstructured":"Rauchwerger, L., Padua, D.A.: The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization. IEEE Transactions on Parallel and Distributed Systems\u00a010(2), 160\u2013180 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1024597010150","volume":"31","author":"S. Rus","year":"2003","unstructured":"Rus, S., Hoeflinger, J., Rauchwerger, L.: Hybrid analysis: static & dynamic memory reference analysis. International Journal of Parallel Programming\u00a031(3), 251\u2013283 (2003)","journal-title":"International Journal of Parallel Programming"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/PACT.2004.1342558","volume-title":"13th Conference on Parallel Architecture and Compilation Techniques","author":"S. Rus","year":"2004","unstructured":"Rus, S., Zhang, D., Rauchwerger, L.: The value evolution graph and its use in memory reference analysis. In: 13th Conference on Parallel Architecture and Compilation Techniques, pp. 243\u2013254. IEEE Computer Society Press, Los Alamitos (2004)"},{"issue":"6","key":"27_CR24","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/32.391376","volume":"21","author":"M. Spezialetti","year":"1995","unstructured":"Spezialetti, M., Gupta, R.: Loop monotonic statements. IEEE Transactions on Software Engineering\u00a021(6), 497\u2013505 (1995)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Triolet, R., Irigoin, F., Feautrier, P.: Direct parallelization of Call statements. In: ACM 1986 Symp. on Comp. Constr., Palo Alto, CA, June 1986, pp. 175\u2013185 (1986)","DOI":"10.1145\/12276.13329"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Tu, P., Padua, D.: Gated SSA\u2013based demand-driven symbolic analysis for parallelizing compilers. In: Proceedings of the 9th ACM International Conference on Supercomputing, Barcelona, Spain, January 1995, pp. 414\u2013423 (1995)","DOI":"10.1145\/224538.224648"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Wolfe, M.: Beyond induction variables. In: ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, San Francisco, Calif., June 1992, pp. 162\u2013174 (1992)","DOI":"10.1145\/143095.143131"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Wu, P., Cohen, A., Hoeflinger, J., Padua, D.: Monotonic evolution: An alternative to induction variable substitution for dependence analysis. In: 2001 ACM International Conference on Supercomputing, Sorrento, Italy, pp. 78\u201391 (2001)","DOI":"10.1145\/377792.377809"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Wu, P., Cohen, A., Padua, D.: Induction variable analysis without idiom recognition: Beyond monotonicity. In: 2001 Workshop on Lang. and Compilers for Par. Computing, Cumberland Falls, KY, pp. 427\u2013441 (2001)","DOI":"10.1007\/3-540-35767-X_28"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532378_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:25Z","timestamp":1605643765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532378_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280095","9783540318132"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11532378_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}