{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:04Z","timestamp":1757629504017,"version":"3.44.0"},"reference-count":39,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0743-7315(92)90017-h","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"338-351","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":167,"title":["SOS: Synthesis of application-specific heterogeneous multiprocessor systems"],"prefix":"10.1016","volume":"16","author":[{"given":"Shiv","family":"Prakash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alice C.","family":"Parker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"12","key":"10.1016\/0743-7315(92)90017-H_BIB1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","article-title":"A comparison of list schedules for parallel processing systems","volume":"17","author":"Adam","year":"1974","journal-title":"Comm. ACM"},{"issue":"12","key":"10.1016\/0743-7315(92)90017-H_BIB2","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1109\/12.9739","article-title":"Partitioning techniques for large-grained parallelism","volume":"37","author":"Agrawal","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/0743-7315(92)90017-H_BIB3","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1109\/32.62447","article-title":"Lower bound on the number of processors and time for scheduling precedence graphs with communication costs","volume":"16","author":"Al-Mouhamed","year":"1990","journal-title":"IEEE Trans. Software Engng."},{"issue":"6","key":"10.1016\/0743-7315(92)90017-H_BIB4","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TSE.1981.226469","article-title":"A shortest tree algorithm for optimal assignments across space and time in a distributed processor system","volume":"SE-7","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"issue":"1","key":"10.1016\/0743-7315(92)90017-H_BIB5","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/12.75137","article-title":"Partitioning problems in parallel, pipelined, and distributed computing","volume":"37","author":"Bokhari","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/0743-7315(92)90017-H_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MC.1980.1653419","article-title":"Task allocation in distributed data processing","volume":"13","author":"Chu","year":"1980","journal-title":"Computer"},{"issue":"6","key":"10.1016\/0743-7315(92)90017-H_BIB7","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/TC.1987.1676960","article-title":"Task allocation and precedence relations for distributed real-time systems","volume":"C-36","author":"Chu","year":"1987","journal-title":"IEEE Trans. Comput."},{"year":"1973","series-title":"Operating Systems Theory","author":"Coffman","key":"10.1016\/0743-7315(92)90017-H_BIB8"},{"issue":"6","key":"10.1016\/0743-7315(92)90017-H_BIB9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1982.1654050","article-title":"Heuristic models of task assignment scheduling in distributed systems","volume":"15","author":"Efe","year":"1982","journal-title":"Computer"},{"issue":"2","key":"10.1016\/0743-7315(92)90017-H_BIB10","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","article-title":"Scheduling parallel program tasks onto arbitrary target machines","volume":"9","author":"El-Rewini","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"issue":"8","key":"10.1016\/0743-7315(92)90017-H_BIB11","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1109\/TC.1973.5009153","article-title":"Bounds on the number of processors and time for multiprocessor optimal schedules","volume":"C-22","author":"Fernandez","year":"1973","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0743-7315(92)90017-H_BIB12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0743-7315(85)90029-2","article-title":"Parallelism detection and transformation techniques useful for VLSI algorithms","volume":"2","author":"Fortes","year":"1985","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(92)90017-H_BIB13","series-title":"Proceedings of the Parallel\/Distributed Computing Networks Seminar","article-title":"Superconcurrent processing, a dynamic approach to heterogeneous parallelism","author":"Freund","year":"1990"},{"issue":"1","key":"10.1016\/0743-7315(92)90017-H_BIB14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.26.1.3","article-title":"Performance guarantees for scheduling algorithms","volume":"26","author":"Garey","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0743-7315(92)90017-H_BIB15","series-title":"Tech. Rep. TR 89-11","article-title":"Analysis, modeling and optimization of multiprocessing execution time","author":"Haddad","year":"1989"},{"key":"10.1016\/0743-7315(92)90017-H_BIB16","series-title":"Proceedings 1989 International Conference on Parallel Processing","article-title":"Partitioned load allocation for minimum parallel processing time","author":"Haddad","year":"1989"},{"key":"10.1016\/0743-7315(92)90017-H_BIB17","series-title":"Proceedings 28th Design Automation Conference","first-page":"14","article-title":"Constraint improvements for MILP-based hardware synthesis","author":"Hafer","year":"1991"},{"key":"10.1016\/0743-7315(92)90017-H_BIB18","series-title":"Tech. Rep. CMPT TR 90-2","article-title":"Bringing up Bozo","author":"Hafer","year":"1990"},{"issue":"1","key":"10.1016\/0743-7315(92)90017-H_BIB19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TCAD.1983.1270016","article-title":"A formal method for the specification, analysis, and design of register-transfer level digital logic","volume":"CAD-2","author":"Hafer","year":"1983","journal-title":"IEEE Trans. Comput. Aided Design"},{"issue":"7","key":"10.1016\/0743-7315(92)90017-H_BIB20","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1109\/32.56096","article-title":"Module allocation of real-time applications to distributed systems","volume":"16","author":"Houstis","year":"1990","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0743-7315(92)90017-H_BIB21","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/0743-7315(92)90017-H_BIB22","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/43.75629","article-title":"A formal approach to the scheduling problem in high level synthesis","volume":"10","author":"Hwang","year":"1991","journal-title":"IEEE Trans. Comput. Aided Design"},{"issue":"2","key":"10.1016\/0743-7315(92)90017-H_BIB23","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0218016","article-title":"Scheduling precedence graphs in systems with interprocessor communication times","volume":"18","author":"Hwang","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0743-7315(92)90017-H_BIB24","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/TSE.1986.6312889","article-title":"Optimal partitioning of randomly generated distributed programs","volume":"SE-12","author":"Indurkhya","year":"1986","journal-title":"IEEE Trans. Software Engrg."},{"issue":"11","key":"10.1016\/0743-7315(92)90017-H_BIB25","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"C-33","author":"Kasahara","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90017-H_BIB26","first-page":"867","article-title":"On supercomputing with systolic\/wavefront array processors","volume":"72","author":"Kung","year":"1984"},{"issue":"1","key":"10.1016\/0743-7315(92)90017-H_BIB27","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TC.1985.1676516","article-title":"The design of optimal systolic arrays","volume":"C-34","author":"Li","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(92)90017-H_BIB28","first-page":"41","article-title":"A task allocation model for distributed computing systems","volume":"C31","author":"Ma","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90017-H_BIB29","first-page":"301","article-title":"The high-level synthesis of digital systems","volume":"78","author":"McFarland","year":"1990"},{"key":"10.1016\/0743-7315(92)90017-H_BIB30","series-title":"Tech. Rep. DRC-18-55-82","article-title":"Task scheduling on multiprocessors","author":"Mehrotra","year":"1982"},{"issue":"2","key":"10.1016\/0743-7315(92)90017-H_BIB31","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02253685","article-title":"Spacetime representations of computational structures","volume":"32","author":"Miranker","year":"1984","journal-title":"Computing"},{"issue":"2","key":"10.1016\/0743-7315(92)90017-H_BIB32","doi-asserted-by":"crossref","DOI":"10.1109\/32.21740","article-title":"Optimal partitioning of random programs across two processors","volume":"15","author":"Nicol","year":"1989","journal-title":"IEEE Trans. Software Engng."},{"key":"10.1016\/0743-7315(92)90017-H_BIB33","series-title":"High-Level VLSI Synthesis","first-page":"331","article-title":"Unified System Construction (USC)","author":"Parker","year":"1991"},{"article-title":"Guiding design decisions in RT-level logic synthesis","year":"1987","author":"Prakash","key":"10.1016\/0743-7315(92)90017-H_BIB34"},{"key":"10.1016\/0743-7315(92)90017-H_BIB35","series-title":"CEng Tech. Rep. 91-17","article-title":"A mathematical programming model for synthesis of multiprocessor systems: Linearization, an example model, and some tradeoff studies","author":"Prakash","year":"1991"},{"issue":"4","key":"10.1016\/0743-7315(92)90017-H_BIB36","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1979.1675348","article-title":"Assignment of tasks in a distributed processor system with limited memory","volume":"C-28","author":"Rao","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0743-7315(92)90017-H_BIB37","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TC.1985.1676563","article-title":"A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion","volume":"C-34","author":"Shen","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90017-H_BIB38","series-title":"Computer Architecture","first-page":"387","article-title":"An overview of the PASM parallel processing system","author":"Siegel","year":"1987"},{"issue":"1","key":"10.1016\/0743-7315(92)90017-H_BIB39","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"SE-3","author":"Stone","year":"1977","journal-title":"IEEE Trans. Software Engng."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290017H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290017H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:11Z","timestamp":1757514491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290017H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["074373159290017H"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90017-h","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"SOS: Synthesis of application-specific heterogeneous multiprocessor systems","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90017-H","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}