{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:10:43Z","timestamp":1748405443184,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1023\/a:1018786922750","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T20:54:14Z","timestamp":1045688054000},"page":"5-42","source":"Crossref","is-referenced-by-count":1,"title":["Analyzing Asynchronous Pipeline Schedules"],"prefix":"10.1007","volume":"26","author":[{"given":"Val","family":"Donaldson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeanne","family":"Ferrante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"228478_CR1","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321479.321485","volume":"15","author":"R. Reiter","year":"1968","unstructured":"R. Reiter, Scheduling parallel computations, J. ACM\n15(4): 590\u2013599 (October 1968).","journal-title":"J. ACM"},{"issue":"12","key":"228478_CR2","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"29","author":"D. A. Padua","year":"1986","unstructured":"D. A. Padua and M. J. Wolfe, Advanced compiler optimizations for supercomputers, Comm. ACM\n29(12):1184\u20131201 (December 1986).","journal-title":"Comm. ACM"},{"key":"228478_CR3","volume-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, MIT Press, Cambridge, Massachusetts (1989)."},{"issue":"9","key":"228478_CR4","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T. Yang","year":"1994","unstructured":"T. Yang and A. Gerasoulis, DSC: scheduling parallel tasks on an unbounded number of processors, IEEE Trans. Parallel and Distrib. Syst. 5(9):951\u2013967 (September 1994).","journal-title":"IEEE Trans. Parallel and Distrib. Syst."},{"key":"228478_CR5","volume-title":"The Architecture of Pipelined Computers","author":"P. M. Kogge","year":"1981","unstructured":"P. M. Kogge, The Architecture of Pipelined Computers, Hemisphere Publishing, New York (1981)."},{"key":"228478_CR6","doi-asserted-by":"crossref","unstructured":"A. Aiken and A. Nicolau, Optimal loop parallelization, Proc. SIGPLAN\u201988 Conf. on Progr. Lang. Design and Implementation, Atlanta, Georgia, 308\u2013317 (June 1988).","DOI":"10.1145\/53990.54021"},{"key":"228478_CR7","doi-asserted-by":"crossref","unstructured":"M. Lam, Software pipelining: an effective scheduling technique for VLIW machines, Proc. SIGPLAN\u2019 88 Conf. Progr. Lang. Design and Implementation, Atlanta, Georgia, 318\u2013328 (June 1988).","DOI":"10.1145\/53990.54022"},{"issue":"8","key":"228478_CR8","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1109\/78.388859","volume":"43","author":"S. Banerjee","year":"1995","unstructured":"S. Banerjee, T. Hamada, P. M. Chau, and R. D. Fellman, Macro pipelining based scheduling on high performance heterogeneous multiprocessor systems, IEEE Trans. Signal Processing\n43(8):1468\u20131484 (June 1995).","journal-title":"IEEE Trans. Signal Processing"},{"issue":"6","key":"228478_CR9","doi-asserted-by":"crossref","first-page":"2225","DOI":"10.1109\/78.218149","volume":"41","author":"P. D. Hoang","year":"1993","unstructured":"P. D. Hoang and J. M. Rabaey, Scheduling of DSP programs onto multiprocessors for maximum through-put, IEEE Trans. Signal Processing\n41(6):2225\u20132235 (June 1993).","journal-title":"IEEE Trans. Signal Processing"},{"key":"228478_CR10","doi-asserted-by":"crossref","unstructured":"A. Beguelin, J. J. Dongarra, G. A. Geist, R. Manchek, and V. S. Sunderam, Graphical development tools for network-based concurrent supercomputing, Proc. Supercomputing\u2019 91, Albuquerque, New Mexico, pp. 435\u2013444 (November 1991).","DOI":"10.1145\/125826.126059"},{"key":"228478_CR11","first-page":"151","volume":"II","author":"T. Yang","year":"1995","unstructured":"T. Yang, C. Fu, A. Gerasoulis, and V. Sarkar, Mapping iterative task graphs on distributed memory machines, Proc. 24th Int\u2019l. Conf. Parallel Proc., Oconomowoc, Wisconsin, Vol. II, pp. 151\u2013158 (August 1995).","journal-title":"Proc. 24th Int\u2019l. Conf. Parallel Proc., Oconomowoc, Wisconsin"},{"issue":"5","key":"228478_CR12","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F. Commoner","year":"1971","unstructured":"F. Commoner, A. W. Holt, S. Even, and A. Pnueli, Marked directed graphs, J. Comput. Syst. Sci. 5(5):511\u2013523 (October 1971).","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"228478_CR13","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/0743-7315(87)90032-3","volume":"4","author":"S. Y. Kung","year":"1987","unstructured":"S. Y. Kung, P. S. Lewis, and S. C. Lo, Performance analysis and optimization of VLSI dataflow arrays, J. Parallel and Distribut. Comput. 4(6):592\u2013618 (December 1987).","journal-title":"J. Parallel and Distribut. Comput."},{"key":"228478_CR14","doi-asserted-by":"crossref","unstructured":"F. Gasperoni and U. Schwiegelshohn, Scheduling loops on parallel processors: a simple algorithm with close to optimum performance, Second Joint Int\u2019l. Conf. Vector and Parallel Processing (CONPAR 92-VAPP V), Lyon, France, pp. 625\u2013636 (September 1992).","DOI":"10.1007\/3-540-55895-0_463"},{"key":"228478_CR15","volume-title":"Performance analysis and optimization of asynchronous circuits","author":"S. M. Burns","year":"1991","unstructured":"S. M. Burns, Performance analysis and optimization of asynchronous circuits, Ph.D. Thesis, California Institute of Technology, Pasadena, California (1991)."},{"key":"228478_CR16","volume-title":"Introduction to Parallel Algorithm and Architecture: Arrays, Trees, Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton, Introduction to Parallel Algorithm and Architecture: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, California (1992)."},{"issue":"5","key":"228478_CR17","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1109\/TSE.1980.230492","volume":"SE-6","author":"C. V. Ramamoorthy","year":"1980","unstructured":"C. V. Ramamoorthy and G. S. Ho, Performance evaluation of asynchronous concurrent systems using Petri nets, IEEE Trans. Software Engineering\nSE-6(5):440\u2013449 (September 1980).","journal-title":"IEEE Trans. Software Engineering"},{"key":"228478_CR18","doi-asserted-by":"crossref","unstructured":"V. Donaldson and J. Ferrante, Determining asynchronous acyclic pipeline execution times, Proc. 10th Int\u2019l. Parallel Processing Symp., Honolulu, Hawai, pp. 568\u2013572 (April 1996).","DOI":"10.1109\/IPPS.1996.508113"},{"key":"228478_CR19","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, Massachusetts (1990)."},{"issue":"1","key":"228478_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D. B. Johnson","year":"1975","unstructured":"D. B. Johnson, Finding all the elementary circuits of a directed graph, SIAM J. Comput. 4(1):77\u201384 (March 1975).","journal-title":"SIAM J. Comput."},{"key":"228478_CR21","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawier","year":"1976","unstructured":"E. L. Lawier, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York (1976)."},{"issue":"5","key":"228478_CR22","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H. N. Gabow","year":"1989","unstructured":"H. N. Gabow and R. E. Tarjan, Faster scaling algorithms for network problems, SIAM J. Computing\n18(5):1013\u20131036 (October 1989).","journal-title":"SIAM J. Computing"},{"key":"228478_CR23","first-page":"77","volume-title":"Theory of Graphs","author":"G. B. Dantzig","year":"1967","unstructured":"G. B. Dantzig, W. O. Blattner, and M. R. Rao, Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem, in P. Rosenstiehl (ed.), Theory of Graphs, Dunod, Paris, and Gordon and Breach, New York, pp. 77\u201383 (1967)."},{"issue":"6","key":"228478_CR24","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1002\/net.3230230607","volume":"23","author":"M. Hartmann","year":"1993","unstructured":"M. Hartmann and J. B. Orlin, Finding minimum cost to time ratio cycles with small integral transit times, Networks\n23(6):567\u2013574 (September 1993).","journal-title":"Networks"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018786922750.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018786922750\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018786922750.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:24:11Z","timestamp":1748334251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018786922750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["228478"],"URL":"https:\/\/doi.org\/10.1023\/a:1018786922750","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}