{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T14:47:26Z","timestamp":1693752446922},"reference-count":22,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":[[1998,10]]},"DOI":"10.1016\/s0167-8191(98)00047-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:52:00Z","timestamp":1049741520000},"page":"1653-1664","source":"Crossref","is-referenced-by-count":5,"title":["Optimal schedules for d-D grid graphs with communication delays"],"prefix":"10.1016","volume":"24","author":[{"given":"E.","family":"Bampis","sequence":"first","affiliation":[]},{"given":"C.","family":"Delorme","sequence":"additional","affiliation":[]},{"given":"J.-C.","family":"K\u00f6nig","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00047-7_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","article-title":"Communication complexity of PRAMs","volume":"71","author":"Aggarwal","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB2","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974"},{"issue":"1","key":"10.1016\/S0167-8191(98)00047-7_BIB3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1142\/S0129626493000083","article-title":"The time complexity of scheduling interval orders with communication is polynomial","volume":"3","author":"Ali","year":"1993","journal-title":"Parallel Processing Letters"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB4","doi-asserted-by":"crossref","unstructured":"R.J. Anderson, P. Beame, W. Ruzzo, Low overhead parallel schedules for task graphs, Proceedings of SPAA (1990) 66\u201375","DOI":"10.1145\/97444.97460"},{"issue":"4","key":"10.1016\/S0167-8191(98)00047-7_BIB5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1142\/S0129626492000519","article-title":"A low overhead schedule for a 3D-grid graph","volume":"2","author":"Bampis","year":"1992","journal-title":"Parallel Processing Letters"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB6","unstructured":"P. Chr\u00e9tienne, C. Picouleau, Scheduling with communication delays: A survey, in: P. Chretienne et al. (Eds.), Sheduling Theory and Its Applications, Wiley, New York, 1995"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(96)00035-7","article-title":"Optimal schedules for UET-UCT series parallel digraphs on two processors","volume":"162","author":"Finta","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB8","unstructured":"R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB9","doi-asserted-by":"crossref","unstructured":"F. Guinand, C. Rapine, D. Trystram, Worst case analysis of Lawler's algorithm for scheduling trees with communication delays, IEEE on Transactions in Parallel and Distributed Systems 8 (10) 1997","DOI":"10.1109\/71.629491"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB10","unstructured":"F. Guinand, D. Trystram, Optimal scheduling of UECT trees on two processors, Technical Report APACHE RR-93-03. IMAG, Grenoble, 1993"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","article-title":"Three, four, five, six or the complexity of scheduling with communication delays","volume":"16","author":"Hoogeveen","year":"1994","journal-title":"Operational Research Letters"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB12","unstructured":"J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesly, Reading, MA, 1979"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB13","unstructured":"E.L. Lawler, Scheduling trees on multiprocessors with unit communication delays, Proceedings of the Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Lake como, Italy, 1993"},{"issue":"1","key":"10.1016\/S0167-8191(98)00047-7_BIB14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1996.0007","article-title":"The complexity of scheduling trees with communication delays","volume":"20","author":"Lenstra","year":"1996","journal-title":"Journal of Algorithms"},{"issue":"4","key":"10.1016\/S0167-8191(98)00047-7_BIB15","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0216044","article-title":"A communication time tradeoff","volume":"16","author":"Papadimitriou","year":"1987","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"10.1016\/S0167-8191(98)00047-7_BIB16","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","article-title":"Towards an architecture-independent analysis of parallel algorithms","volume":"19","author":"Papadimitriou","year":"1990","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB17","unstructured":"C. Picouleau, Etude des Probl\u00e9mes d'Optimisation dans les Systemes Distribu\u00e9s, Ph.D. Thesis, University Paris VI, France, 1992"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with unit interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB19","doi-asserted-by":"crossref","unstructured":"T. Varvarigou, V.P. Roychowdhury, T. Kailath, Scheduling in and out forests in the presence of communication delays, Proceedings of the International Parallel Processing Symposium, Newport Beach, CA, 1993, 222\u2013229","DOI":"10.1109\/IPPS.1993.262886"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB20","unstructured":"M. Veldhorst, A linear time algorithm to schedule trees with communication delays optimally on two machines, Technical Report COSOR 93-07, Department of Mathematics and Computer Science, Eindhoven University of Technology, 1993"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB21","unstructured":"B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, CWI-Amsterdam, 1993"},{"key":"10.1016\/S0167-8191(98)00047-7_BIB22","unstructured":"H. Wilf, Generatingfunctionology, Academic Press, New York, 1990"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000477?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000477?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T05:22:18Z","timestamp":1556342538000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198000477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0167819198000477"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00047-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}