{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T02:48:58Z","timestamp":1794365338324,"version":"4.9.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1989,7]]},"DOI":"10.1007\/bf00129843","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T15:38:13Z","timestamp":1099237093000},"page":"71-88","source":"Crossref","is-referenced-by-count":29,"title":["Automatic generation of nested, fork-join parallelism"],"prefix":"10.1007","volume":"3","author":[{"given":"Michael","family":"Burke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ron","family":"Cytron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeanne","family":"Ferrante","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wilson","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Aho, A., Hopcroft, J., and Ullman, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley."},{"issue":"5","key":"CR2","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/0743-7315(88)90015-9","volume":"5","author":"F. Allen","year":"1988","unstructured":"Allen, F., Burke, M., Charles, P., Cytron, R., and Ferrante, J. 1988. An overview of the PTRAN analysis system for multiprocessing. J. Parallel and Distributed Computing, 5, 5 (Oct.), 617?640.","journal-title":"J. Parallel and Distributed Computing"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Allen, R., Callahan, D., and Kennedy, K. 1987. Automatic decomposition of scientific programs for parallel execution. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages (Jan.), pp. 63?76.","DOI":"10.1145\/41625.41631"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Baxter, W., and Bauer, J. R., III. 1989. The program dependence graph in vectorization. In Sixteenth ACM Principles of Programming Languages Symposium (Austin, Tex., Jan. 11?13), pp. 1?11.","DOI":"10.1145\/75277.75278"},{"issue":"7","key":"CR5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/12276.13328","volume":"21","author":"M. Burke","year":"1986","unstructured":"Burke, M., and Cytron, R. 1986. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, 21, 7 (July), 162?175.","journal-title":"Proceedings of the SIGPLAN '86 Symposium on Compiler Construction"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Burke, M., Cytron, R., Ferrante, J., Hind, M., Hsieh, W., and Sarkar, V. 1989. Automatic parallelization for DAG parallelism. Tech. rept., MIT, NYU, IBM (in prep.).","DOI":"10.1145\/74818.74823"},{"key":"CR7","unstructured":"Cytron, R. 1986. Doacross: Beyond vectorization for multiprocessors. In Proceedings of the 1986 International Conference on Parallel Processing (Aug.), pp. 836?844."},{"key":"CR8","unstructured":"Cytron, R., and Ferrante, J. 1987a. An improved control dependence algorithm. IBM tech. rept. RC 13291."},{"key":"CR9","unstructured":"Cytron, R., and Ferrante, J. 1987b. What's in a name? On the value of renaming for parallelism detection and storage allocation. In Proceedings of the 1987 International Conference on Parallel Processing (Aug.), pp. 19?27."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Cytron, R., Hind, M., and Hsieh, W. 1989. Automatic generation of DAG parallelism. In Proceedings of the 1989 SIGPLAN Conference on Programming Language Design and Implementation (to appear).","DOI":"10.1145\/73141.74823"},{"key":"CR11","unstructured":"Cytron, R., Karlovsky, S., and McAuliffe, K. P. 1988. Automatic management of programmable caches (extended abstract). In Proceedings of the 1988 International Conference on Parallel Processing (Aug.)."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Cytron, R., Ferrante, J., Rosen, B., Wegman, M., and Zadeck, K. 1989. An efficient method of computing static single assignment form. In Sixteenth ACM Principles of Programming Languages Symposium (Austin, Tex., Jan. 11?13), pp. 25?35.","DOI":"10.1145\/75277.75280"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Fisher, J. A., Ellis, J. R., Ruttenberg, J. C., and Nicolau, A. 1984. Parallel processing: A smart compiler and a dumb machine. In Proceedings of the ACM Symposium on Compiler Construction (June), pp. 37?47.","DOI":"10.1145\/502874.502878"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Ferrante, J., Ottenstein, K., and Warren, J. 1987. The program dependence graph and its use in optimization. In ACM Transactions on Programming Languages and Systems (July), pp. 319?349.","DOI":"10.1145\/24039.24041"},{"key":"CR15","unstructured":"Gannon, D. 1986. Restructuring nested loops on the Alliant Cedar cluster: A case study of Gaussian elimination of banded matrices. SIAM Special Issue (Feb.)."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Harel, D. 1980. A linear time algorithm for the lowest common ancestor problem. Foundations of Computer Science (Oct.).","DOI":"10.1109\/SFCS.1980.6"},{"key":"CR17","unstructured":"Hecht, M. S. 1977. Flow Analysis of Computer Programs. Elsevier North-Holland, Inc."},{"key":"CR18","unstructured":"Hsieh, W. C. 1988. Extracting parallelism from sequential programs. MIT tech. rept. (May). (M.S. thesis)"},{"key":"CR19","unstructured":"IBM. 1988. Parallel Fortran language and library reference. IBM tech. rept., pub. no. SC23-0431-0 (Mar.)."},{"key":"CR20","unstructured":"Kuck, D. J. 1978. The Structure of Computers and Computations. John Wiley and Sons."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Lengauer, T., and Tarjan, R. 1979. A fast algorithm for finding dominators in a flowgraph. TOPLAS (July).","DOI":"10.1145\/357062.357071"},{"key":"CR22","unstructured":"Mills, H. D. 1982. Mathematical foundations for structured programming. In Writings of the Revolution: Selected Readings on Software Engineering, pp. 220?226."},{"issue":"12","key":"CR23","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"29","author":"D. A. Padua","year":"1986","unstructured":"Padua, D. A., and Wolfe, M. J. 1986. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29, 12 (Dec.), 1184?1201.","journal-title":"Communications of the ACM"},{"key":"CR24","unstructured":"Pountain, D., and May, D. 1987. A tutorial introduction to OCCAM programming. Mar."},{"key":"CR25","unstructured":"Schwartz, J. T., and Sharir, M. 1979. A design for optimizations of the bivectoring class. New York Univ., Courant Institute of Mathematical Science, Courant Computer Science Rept. No. 17 (Sept.)."},{"key":"CR26","unstructured":"Stone, J. M. 1985. Nested parallelism in a parallel FORTRAN environment. IBM, T. J. Watson Research Center, tech. rept. RC 11506 (Nov.)."},{"issue":"3","key":"CR27","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0022-0000(74)80049-8","volume":"9","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R. 1984. Testing flow graph reducibility. J. Computer and System Sciences, 9, 3 (Dec.), 355?365.","journal-title":"J. Computer and System Sciences"},{"key":"CR28","series-title":"Ph.D. diss.","volume-title":"Compiler optimizations and architecture design issues for multiprocessors","author":"A. Veidenbaum","year":"1985","unstructured":"Veidenbaum, A. 1985. Compiler optimizations and architecture design issues for multiprocessors. Univ. Ill. at Urbana-Champaign, Ph.D. diss."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF00289048","volume":"9","author":"H. S. Warren Jr.","year":"1978","unstructured":"Warren, H. S., Jr. 1978. Static main storage packing problems. Acta Informatica, 9: 355?376.","journal-title":"Acta Informatica"},{"key":"CR30","series-title":"M.S. thesis","volume-title":"Techniques for improving the inherent parallelism in programs","author":"M. J. Wolfe","year":"1978","unstructured":"Wolfe, M. J. 1978. Techniques for improving the inherent parallelism in programs. Univ. of Ill. at Urbana-Champaign, M.S. thesis."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129843.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00129843\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T20:50:08Z","timestamp":1682801408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00129843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["BF00129843"],"URL":"https:\/\/doi.org\/10.1007\/bf00129843","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}