{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:16:56Z","timestamp":1758125816415},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437925"},{"type":"electronic","value":"9783540480860"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48086-2_8","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:54:50Z","timestamp":1180335290000},"page":"71-78","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays"],"prefix":"10.1007","author":[{"given":"Noriyuki","family":"Fujimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenichi","family":"Hagihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,6]]},"reference":[{"issue":"9","key":"8_CR1","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1109\/71.722221","volume":"9","author":"I. Ahmad","year":"1998","unstructured":"Ahmad, I. and Kwok, Y.: On Exploiting Task Duplication in Parallel Program Scheduling, IEEE Trans. on Parallel and Distributed Systems, Vol. 9, No. 9 (1998) 872\u2013892","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129626400000263","volume":"10","author":"J. Blazewicz","year":"2000","unstructured":"Blazewicz, J., Guinand, F., Penz, B., and Trystram, D.: Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays, Parallel Processing Letters, Vol. 10, No. 4 (2000) 267\u2013277","journal-title":"Parallel Processing Letters"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","volume":"43","author":"P. Chr\u00e9tienne","year":"1989","unstructured":"Chr\u00e9tienne, P.: A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System under Tree-like Precedence Constraints, European J. Oper. Res. Vol. 43 (1989) 225\u2013230","journal-title":"European J. Oper. Res."},{"key":"8_CR4","unstructured":"Chr\u00e9tienne, P. and Picouleau, C.: Scheduling with Communication Delays: A Survey, Scheduling Theory and Its Applications, Wiley (1995) 65\u201390"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1287\/opre.39.4.680","volume":"39","author":"J. Y. Colin","year":"1991","unstructured":"Colin, J. Y. and Chritienne, P.: C.P.M. Scheduling with Small Communication Delays and Task Duplication, Operations Research, Vol. 39, No. 4 (1991) 680\u2013684","journal-title":"Operations Research"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/71.655248","volume":"9","author":"S. Darbha","year":"1998","unstructured":"Darbha, S. and Agrawal, D. P.: Optimal Scheduling Algorithm for Distributed-Memory Machines, IEEE Trans. on Parallel and Distributed Systems, Vol. 9, No. 1 (1998) 87\u201395","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"8_CR7","unstructured":"El-Rewini, H., Lewis, T.G., and Ali, H.H.: TASK SCHEDULING in PARALLEL and DISTRIBUTED SYSTEMS, PTR Prentice Hall (1994)"},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/71.242154","volume":"4","author":"A. Gerasoulis","year":"1993","unstructured":"Gerasoulis, A. and Yang, T.: On the Granularity and Clustering of Directed Acyclic Task Graphs, IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 6 (1993) 686\u2013701","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Ann. Discrete Math. Vol. 5 (1979) 287\u2013326","journal-title":"Discrete Math"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1051\/ro:2000101","volume":"34","author":"F. Guinand","year":"2000","unstructured":"Guinand, F. and Trystram, D.: Optimal Scheduling of UECT Trees on Two Processors, RAIRO Operations Research, Vol. 34, No. 2(2000) 131\u2013144","journal-title":"RAIRO Operations Research"},{"key":"8_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-55706-7_15","volume-title":"The Complexity of Scheduling Problems with Communication Delays for Trees","author":"A. Jakoby","year":"1992","unstructured":"Jakoby, A. and Reischuk, R.: The Complexity of Scheduling Problems with Communication Delays for Trees, Lecture Notes in Computer Science, Vol. 621. Springer-Verlag (1992) 165\u2013177"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/inco.1993.1041","volume":"105","author":"H. Jung","year":"1993","unstructured":"Jung, H., Kirousis, L., and Spirakis, P.: Lower bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays, the Information and Computation Journal, Vol. 105, No. 1 (1993) 94\u2013104","journal-title":"the Information and Computation Journal"},{"key":"8_CR13","unstructured":"Lawler, E. L.: Scheduling Trees on Multiprocessors with Unit Communication Delays, Presented at the First Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Lake Como, Italy, unpublished manuscript, June (1993)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/jagm.1996.0007","volume":"20","author":"J. K. Lenstra","year":"1996","unstructured":"Lenstra, J. K., Veldhorst, M., and Veltman, B.: The Complexity of Scheduling Trees with Communication Delays, Journal of Algorithms, Vol. 20 (1996) 157\u2013173","journal-title":"Journal of Algorithms"},{"key":"8_CR15","volume-title":"Ph.D. thesis","author":"C. Picouleau","year":"1992","unstructured":"Picouleau, C.: Etude de Probl\u00e8mes les Syst\u00e8mes Distribu\u00e9s, Ph.D. thesis, Univ. Piere et Marie Curie, Paris, France (1992)"},{"key":"8_CR16","first-page":"229","volume":"3","author":"R. Thurimella","year":"1992","unstructured":"Thurimella, R. and Yesha, Y.: A scheduling principle for precedence graphs with communication delay, International Conference on Parallel Processing, 3 (1992) 229\u2013236","journal-title":"International Conference on Parallel Processing"},{"issue":"10","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1109\/71.539738","volume":"7","author":"T. A. Varvarigou","year":"1996","unstructured":"Varvarigou, T. A., Roychowdhury, V. P., Kailath, T., and Lawler, E.: Scheduling In and Out Forests in the Presence of Communication Delays, IEEE Trans. on Parallel and Distributed Systems, Vol. 7, No. 10 (1996) 1065\u20131074","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"9","key":"8_CR18","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T. Yang","year":"1994","unstructured":"Yang, T. and Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors, IEEE Trans. on Parallel and Distributed Systems, Vol. 5, No. 9 (1994) 951\u2013967","journal-title":"IEEE Trans. on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48086-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:20:17Z","timestamp":1558272017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48086-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437925","9783540480860"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48086-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"6 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}