{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T17:56:58Z","timestamp":1680458218267},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6041,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0166-218x(96)00034-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"5-24","source":"Crossref","is-referenced-by-count":12,"title":["Some models for scheduling parallel programs with communication delays"],"prefix":"10.1016","volume":"72","author":[{"given":"Evripidis","family":"Bampis","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Guinand","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00034-0_BIB1","series-title":"Proceedings of the Aegian Workshop on Computing (AWOC)","first-page":"134","article-title":"Scheduling DAGs to minimize time and computation","author":"Afrati","year":"1988"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB2","series-title":"Proceedings of SPAA","first-page":"66","article-title":"Low overhead parallel schedules for task graphs","author":"Anderson","year":"1990"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB3","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB4","article-title":"L'impact des communications sur la complexit\u00e9 des algorithmes parall\u00e8les","author":"Bampis","year":"1993"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB5","doi-asserted-by":"crossref","unstructured":"E. Bampis, C. Delorme and J-C. K\u00f6nig, Optimal schedules for dD-grid graphs with communication delays, in: C. Puech, R. Reischuk eds., STACS'96 LNCS No. 1046, 655\u2013666.","DOI":"10.1007\/3-540-60922-9_53"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0167-8191(05)80017-1","article-title":"Impact of communications on the complexity of the parallel Gaussian elimination","volume":"17","author":"Bampis","year":"1991","journal-title":"Parallel Comput."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB7","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 Process. Lett."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)00267-M","article-title":"Optimal parallel execution of complete binary trees and grids into most popular interconnection networks","volume":"147","author":"Bampis","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB9","doi-asserted-by":"crossref","unstructured":"E. Bampis, J.-C. K\u00f6nig and D. Trystram, Minimizing the schedule length for a parallel 3D-grid precedence graph, European J. Oper. Res., to appear.","DOI":"10.1016\/0377-2217(95)00297-9"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB10","series-title":"Operating Systems Theory","author":"Coffman","year":"1972"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB11","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.39.4.680","article-title":"CPM scheduling with small interprocessor communication delays","volume":"39","author":"Colin","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB12","first-page":"3","article-title":"Designing parallel non numerical algorithms","author":"Cosnard","year":"1991"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB13","article-title":"Communications dans les r\u00e9seaux de processeurs","author":"De Rumeur","year":"1994","journal-title":"Masson, collection ERI"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB14","series-title":"Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing","first-page":"620","article-title":"Optimal architecture-independent scheduling of fine-grain tree-sweep computations","author":"Gao","year":"1995"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB15","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB16","article-title":"Ord\u00f3nnancement avec communications pour architectures multiprocesseurs dans divers mod\u00e8les d'ex\u00e9cution","author":"Guinand","year":"1995"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB17","article-title":"Optimal scheduling of UECT trees on two processors","author":"Guinand","year":"1993"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB18","series-title":"Proceedings of the Scandinavian Workshop of Algorithmic Theory","first-page":"165","article-title":"The complexity of scheduling problems with communication delays for trees","volume":"Vol. 621","author":"Jakoby","year":"1992"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB19_1","first-page":"254","article-title":"Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays","volume":"105","author":"Jung","year":"1989"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB19_2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/inco.1993.1041","volume":"105","author":"Jung","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Lageweg","year":"1990","journal-title":"Parallel Comput"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB21","first-page":"14","article-title":"Scheduling trees on multiprocessors with unit communication delays, Workshop on Models and Algorithms for Planning and Scheduling Problems","author":"Lawler","year":"1993"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB22","series-title":"Proceedings of the 24th Annual ACM Symposium on Theory Comput.","first-page":"77","article-title":"Methods for message routing in parallel machines","author":"Leighton","year":"1992"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB23","series-title":"Parallel Computing: From Theory to Sound Practice","first-page":"360","article-title":"Partitioning DAG computations: a cautionary note","author":"Norman","year":"1992"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB24","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 J. Comput."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB25_1","series-title":"Proceedings of 20th ACM Symposium on Theory of Computing","article-title":"Towards an architecture-independent analysis of parallel algorithms","author":"Papadimitriou","year":"1988"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB25_2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","volume":"9","author":"Papadimitriou","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB26","article-title":"Elude des Probl\u00e8mes d'Optimisation dans les Syst\u00e8mes Distribu\u00e9s","author":"Picouleau","year":"1993"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB27","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 Appl. Math."},{"key":"10.1016\/S0166-218X(96)00034-0_BIB28","series-title":"Proceedings of International Parallel Processing Symp. (IPPS'93)","first-page":"173","article-title":"Scheduling in and out forests in the presence of communication delays","author":"Varvarigou","year":"1993"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB29","doi-asserted-by":"crossref","unstructured":"T. Varvarigou, V.P. Roychowdhury and T. Kailath, E. Lawler, Scheduling in and out forests in the presence of communication delays, IEEE Tran. Parallel Distributed Systems, to appear.","DOI":"10.1109\/IPPS.1993.262886"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB30","article-title":"A linear time algorithm to schedule trees with communication delays optimally on two machines","author":"Veldhorst","year":"1993"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB31","doi-asserted-by":"crossref","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","author":"Veltman","year":"1993"},{"key":"10.1016\/S0166-218X(96)00034-0_BIB32","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T16:48:16Z","timestamp":1579020496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0166218X96000340"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00034-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}