{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:11:36Z","timestamp":1698041496788},"reference-count":13,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":5995,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1990,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>There are two principal methods used to exploit the parallelism available on a parallel machine: the program to be executed can be optimized by hand, or the program can be automatically converted to parallel machine code by a compiler. The first method usually derives parallelism at the procedure level; a parallel program is written in a high\u2010level language and typically has various modules executing in parallel. By contrast, the compiler methodically transforms the program into parallel code using various transformations, such as code movement. The automatic conversion of a program to parallel code is called <jats:italic>compaction<\/jats:italic> or <jats:italic>parallelization<\/jats:italic>. This paper describes the evolution of a new compaction program and presents a new algorithm for determining legal code movements. A simulator of the target architecture was used to estimate the execution times of a sample suite of programs before and after compaction. The results verify that substantial advantages arise from applying this compaction technique.<\/jats:p>","DOI":"10.1002\/spe.4380200603","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T05:26:10Z","timestamp":1163827570000},"page":"537-554","source":"Crossref","is-referenced-by-count":5,"title":["Code compaction for parallel architectures"],"prefix":"10.1002","volume":"20","author":[{"given":"Kasi","family":"Anantha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho A. V.","year":"1986"},{"key":"e_1_2_1_3_2","volume-title":"Technical Report 85\u2013678","author":"Nicolau A.","year":"1985"},{"key":"e_1_2_1_4_2","unstructured":"A.Aiken \u2018Compaction\u2010based parallelization\u2019 Ph.D. dissertation Cornell University 1988."},{"key":"e_1_2_1_5_2","volume-title":"Technical Report 86\u2013785","author":"Aiken A.","year":"1986"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"K.KarplasandA.Nicolau \u2018Efficient hardware for multi\u2010way jumps and pre\u2010fetches\u2019 Proc. Eighteenth Annual Microprogramming Workshop December1985.","DOI":"10.1145\/18927.18908"},{"key":"e_1_2_1_7_2","unstructured":"R.Gupta \u2018A reconfigurable LIW architecture and its compiler\u2019 Ph.D. Dissertation University of Pittsburgh 1987."},{"key":"e_1_2_1_8_2","volume-title":"Computer Systems Architecture","author":"Baer J.\u2010L.","year":"1980"},{"key":"e_1_2_1_9_2","volume-title":"Computer Programming and Architecture\u2014The VAX\u201011","author":"Levy H. M.","year":"1980"},{"key":"e_1_2_1_10_2","volume-title":"Structured Computer Organization","author":"Tanenbaum A. S.","year":"1984"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676371"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675827"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"A.AikenandA.Nicolau \u2018Optimal loop parallelization\u2019 Proc. 1988 ACM SIGPLAN Conference on Programming Language Design and Implementation June1988.","DOI":"10.1145\/53990.54021"},{"key":"e_1_2_1_14_2","volume-title":"Algorithmics: Theory and Practice","author":"Brassard G.","year":"1988"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380200603","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380200603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T10:20:32Z","timestamp":1697970032000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380200603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["10.1002\/spe.4380200603"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380200603","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}