{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:48:55Z","timestamp":1725475735724},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658214"},{"type":"electronic","value":"9783540489337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/bfb0100634","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T18:11:30Z","timestamp":1165515090000},"page":"732-743","source":"Crossref","is-referenced-by-count":3,"title":["Optimal scheduling of iterative data-flow programs onto multiprocessors with non-negligible interprocessor communication"],"prefix":"10.1007","author":[{"given":"D. Antony Louis","family":"Piriyakumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Levi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Siva Ram","family":"Murthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,17]]},"reference":[{"issue":"no.2","key":"75_CR1","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/12.73588","volume":"40","author":"K.K. Parhi","year":"1991","unstructured":"K.K. Parhi and D.G. Messerschmitt, \u201cStatic rate-optimal scheduling of iterative data-flow programs via optimum unfolding\u201d, IEEE Transactions on Computers, vol. 40, no. 2, pp. 178\u2013194, Feb. 1991.","journal-title":"IEEE Transactions on Computers"},{"key":"75_CR2","doi-asserted-by":"crossref","unstructured":"L.E. Lucke and K.K. Parhi, \u201cData-flow transformations for critical path time reduction in high-level DSP synthesis\u201d, IEEE Transaction on Computer-Aided Design, vol. 12, no. 7, July 1993.","DOI":"10.1109\/43.238043"},{"key":"75_CR3","unstructured":"D.A. Schwartz and T.P. Barnwell, \u201ccyclo-static solutions: Optimal multiprocessor realizations of recursive algorithms\u201d, VLSI Signal processing II, IEEE Press, 1986."},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"K.K. Parhi, \u201cAlgorithm transformation techniques for concurrent processors\u201d, Proceedings of the IEEE, vol. 77, no. 12, Dec. 1989.","DOI":"10.1109\/5.48830"},{"issue":"no.9","key":"75_CR5","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T. Yang","year":"1994","unstructured":"T. Yang and A. Gerasoulis, \u201cDSC: Scheduling Parallel Tasks on an Unbounded Number of Processors\u201d, IEEE. Trans. on Parallel and Distributed Systems, vol. 5, no. 9, pp. 951\u2013967, September. 1994.","journal-title":"IEEE. Trans. on Parallel and Distributed Systems"},{"key":"75_CR6","unstructured":"M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., 1979."},{"issue":"No.6","key":"75_CR7","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/71.595579","volume":"8","author":"T. Yang","year":"1997","unstructured":"T. Yang and C. Fu, \u201cHeuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machine\u201d, IEEE Transaction on Parallel and Distributed Systems, vol. 8, No. 6, pp. 608\u2013622, June 1997.","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"75_CR8","doi-asserted-by":"crossref","unstructured":"C.E. Leiserson, F. Rose, and J. Saxe, \u201coptimizing synchronous circuitry by retiming\u201d, Proc. Third Caltech Conf. VLSI, Pasadena, CA, pp. 87\u2013116, March 1983.","DOI":"10.1007\/978-3-642-95432-0_7"},{"key":"75_CR9","doi-asserted-by":"crossref","unstructured":"J.J. Hwang, Y.C. Cow, F.D. Anger, and C.Y. Lee, \u201cScheduling Precedence Graphs in Systems with Interprocessor Communication times\u201d, SIAM Journal of Computing, pp. 244\u2013257, 1989.","DOI":"10.1137\/0218016"},{"issue":"no.3","key":"75_CR10","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/71.277783","volume":"5","author":"S. Selvakumar","year":"1994","unstructured":"S. Selvakumar and C. Siva Ram Murthy, \u201cScheduling Precedence-constrained Task Graphs with Non-negligible Intertask Communication onto Multiprocessors\u201d, IEEE Transaction on Parallel and Distributed Systems, vol 5, no. 3, pp. 328\u2013336, 1994.","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"75_CR11","unstructured":"N.J. Nilson, Principles of Artificial Intelligence, Springer-Verlag, 1980."},{"key":"75_CR12","doi-asserted-by":"crossref","unstructured":"D. Antony Louis Piriyakumar, C. Siva Ram Murthy, and Paul Levi, \u201cA New A * Based Optimal Task Scheduling in Heterogeneous Multiprocess or Systems Applied to Computer Vision\u201d, HPCN-98, Amsterdam, April, 1998.","DOI":"10.1007\/BFb0037158"}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0100634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:37:44Z","timestamp":1555961864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0100634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658214","9783540489337"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0100634","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}