{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T05:40:36Z","timestamp":1698385236340},"reference-count":14,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4097,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1996,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper an optimum algorithm to translate control flow graphs to dataflow graphs is proposed for dataflow execution of sequential programs. Some of the existing analysis methods restrict the specification of a program to be processed while others require a very high analysis cost. The algorithm proposed in this paper (<jats:italic>CD<\/jats:italic> translation algorithm), (1) with a very low cost, and (2) for any control structure that can be described by a control flow graph, (3) can generate dataflow programs that give an optimum dataflow execution. Furthermore, this proposed analysis algorithm is designed to handle task level control flow graphs as well as instruction level control flow graphs, which are accepted by the existing methods, so that optimum control is possible for task level dataflow execution.<\/jats:p>","DOI":"10.1002\/scj.4690270402","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T10:51:37Z","timestamp":1183891897000},"page":"12-24","source":"Crossref","is-referenced-by-count":0,"title":["A compiling technique for dataflow machines \u2014 new algorithm for optimum translation from control flow graph into dataflow graph"],"prefix":"10.1002","volume":"27","author":[{"given":"Toshiaki","family":"Yasue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoichi","family":"Muraoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/357153.357157"},{"key":"e_1_2_1_3_2","volume-title":"An asynchronous programming language and computing machine. TR114a","author":"Arvind K.","year":"1978"},{"issue":"3","key":"e_1_2_1_4_2","first-page":"501","article-title":"Design and implementation dataflow language DFC","volume":"71","author":"Shimada T.","year":"1988","journal-title":"Trans. I.E.I.C.E. (D)"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675682"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_2_1_7_2","unstructured":"R. B.Ballance A. B.MaccabeandK. J.Ottenstein.The Program Dependence Web: A Representation Supporting Control\u2010 Data\u2010 and Demand\u2010Driven Interpretation of Imperative Languages. TR CS91\u20107 Dept. of Computer Science Univ.of New Mexico Albuquerque NM (1991)."},{"key":"e_1_2_1_8_2","volume-title":"From Control Flow to Dataflow. TR89\u20101050","author":"Beck M.","year":"1989"},{"issue":"10","key":"e_1_2_1_9_2","first-page":"1454","article-title":"Sentence processing of parallel language DFC for instruction level data driven computers","volume":"31","author":"Sekiguchi T.","year":"1990","journal-title":"Trans. Information Processing Society"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"C. D.Polychronopoulos M. B.Girkar M. R.Haghighat C. L.Lee B.LeungandD. A.Schouten.Parafrase\u20102 an environment for parallelizing partitioning synchronizing and scheduling programs on multiprocessors. InProc. of the 1989 International Conference on Parallel Processing Penn State St. Charles IL (Aug.1989).","DOI":"10.1142\/S0129053389000044"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"R.Cytron J.Ferrante B. K.Rosen M. N.WegmanandF. K.Zadeck.An efficient method of computing static single assignment form. InProc. of 16th Annual ACM Symposium on Principles of Programming Languages Austin Texas pp.25\u201335(1989).","DOI":"10.1145\/75277.75280"},{"issue":"7","key":"e_1_2_1_12_2","first-page":"440","article-title":"A proposal for flow processing for DOACROSS type loops in data driven computers","volume":"75","author":"Ishii Y.","year":"1992","journal-title":"Trans. I.E.I.C.E. (D\u2010I)"},{"key":"e_1_2_1_13_2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho A. V.","year":"1990"},{"key":"e_1_2_1_14_2","first-page":"455","volume-title":"The Development and Efficient Execution of SISAL Programs. Advanced Topics in DATA\u2010FLOW Computing","author":"Wendelborn A. L.","year":"1991"},{"key":"e_1_2_1_15_2","first-page":"265","volume-title":"Compiling C for the DTN Data\u2010Flow Computer. Advanced Topics in DATA\u2010FLOW Computing","author":"Veen A. H.","year":"1991"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690270402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690270402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T22:04:53Z","timestamp":1698357893000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690270402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1002\/scj.4690270402"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690270402","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}