{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:57:54Z","timestamp":1649019474895},"reference-count":10,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1016\/s0167-8191(99)00039-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:52:00Z","timestamp":1049727120000},"page":"1063-1079","source":"Crossref","is-referenced-by-count":0,"title":["An empirical study of dynamic scheduling on rings of processors"],"prefix":"10.1016","volume":"25","author":[{"given":"Miranda E.","family":"Barrows","sequence":"first","affiliation":[]},{"given":"Dawn E.","family":"Gregory","sequence":"additional","affiliation":[]},{"given":"Lixin","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Arnold L.","family":"Rosenberg","sequence":"additional","affiliation":[]},{"given":"Paul R.","family":"Cohen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(99)00039-3_BIB1","doi-asserted-by":"crossref","unstructured":"P. Fizzano, D. Karger, C. Stein, J. Wein, Job scheduling in rings, In: Proceedings of the Sixth ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 210\u2013219","DOI":"10.1145\/181014.181333"},{"key":"10.1016\/S0167-8191(99)00039-3_BIB2","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1006\/jpdc.1996.0131","article-title":"Toward efficient scheduling of evolving computations on rings of processors","volume":"38","author":"Gao","year":"1996","journal-title":"J. Parallel Distr. Comput."},{"key":"10.1016\/S0167-8191(99)00039-3_BIB3","unstructured":"L.-X. Gao, A.L. Rosenberg, R.K. Sitaraman, Optimal clustering of tree-sweep computations for high-latency parallel environments. IEEE Trans. on Parallel and Distributed Systems (1999), to appear. See also, Optimal architecture-independent scheduling of fine-grain tree-sweep computations, In: Proceedings of the Seventh IEEE Symposium on Parallel and Distribution Processing, 1997, pp. 620\u2013629"},{"key":"10.1016\/S0167-8191(99)00039-3_BIB4","doi-asserted-by":"crossref","unstructured":"A. Gerasoulis, T. Yang, Static scheduling of parallel programs for message passing architectures, Parallel Processing CONPAR 92 \u2013 VAPP V. Lecture Notes in Computer Science 634, Springer, Berlin, 1992, pp. 601\u2013612","DOI":"10.1007\/3-540-55895-0_461"},{"key":"10.1016\/S0167-8191(99)00039-3_BIB5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","article-title":"Communication efficient basic linear algebra computations on hypercube architectures","volume":"4","author":"Johnsson","year":"1987","journal-title":"J. Parallel Distr. Comput."},{"key":"10.1016\/S0167-8191(99)00039-3_BIB6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF01184935","article-title":"Branch-and-bound and backtrack search on mesh-connected arrays of processors","volume":"27","author":"Kaklamanis","year":"1994","journal-title":"Math. Syst. Th."},{"key":"10.1016\/S0167-8191(99)00039-3_BIB7","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/174130.174145","article-title":"Randomized parallel algorithms for backtrack search and branch-and-bound computation","volume":"40","author":"Karp","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0167-8191(99)00039-3_BIB8","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Y. Zhang, On parallel evaluation of game trees, J. ACM 45 (1999) 1050\u20131075","DOI":"10.1145\/293347.293353"},{"key":"10.1016\/S0167-8191(99)00039-3_BIB9","doi-asserted-by":"crossref","unstructured":"R. L\u00fcling, B. Monien, A dynamic, distributed load-balancing algorithm with provable good performance, In: Proceedings of the Fifth ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 164\u2013172","DOI":"10.1145\/165231.165252"},{"key":"10.1016\/S0167-8191(99)00039-3_BIB10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01187094","article-title":"Optimal speedup for backtrack search on a butterfly network","volume":"27","author":"Ranade","year":"1994","journal-title":"Math. Syst. Th."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000393?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000393?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T23:44:38Z","timestamp":1580255078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":10,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0167819199000393"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00039-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}