{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:52Z","timestamp":1725663952868},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581840"},{"type":"electronic","value":"9783540484776"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-58184-7_95","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:27:53Z","timestamp":1330270073000},"page":"122-133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal parallel execution of complete binary trees and grids into most popular interconnection networks"],"prefix":"10.1007","author":[{"given":"E.","family":"Bampis","sequence":"first","affiliation":[]},{"given":"J. -C.","family":"K\u00f6nig","sequence":"additional","affiliation":[]},{"given":"D.","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"R.J. Anderson, P. Beame, W. Ruzzo, Low Overhead Parallel Schedules for Task Graphs, Proc. SPAA (1990).","DOI":"10.1145\/97444.97460"},{"issue":"N\u21344","key":"11_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1142\/S0129626492000519","volume":"2","author":"E. Bampis","year":"1992","unstructured":"E. Bampis, J-C. K\u00f6nig, D. Trystram, A Low overhead schedule for a 3D-Grid Graph, Parallel Processing Letters Vol. 2, N\u2134 4, (1992) pp 363\u2013372.","journal-title":"Parallel Processing Letters"},{"key":"11_CR3","first-page":"758","volume":"A49","author":"N.G. Bruijn De","year":"1946","unstructured":"N.G. De Bruijn, A Combinatorial Problem, Koninlijke Nederlandsa Academie van Wettenschappen Proc., Ser. A49, 758\u2013764, (1946).","journal-title":"Koninlijke Nederlandsa Academie van Wettenschappen Proc., Ser."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","volume":"C-30","author":"S.H. Bokhari","year":"1981","unstructured":"S.H. Bokhari, On the Mapping Problem, IEEE Trans. Comput. C-30, (1981), pp 207\u2013214.","journal-title":"IEEE Trans. Comput."},{"key":"11_CR5","unstructured":"E.G. Coffman, P.J. Denning, Operating Systems Theory, Prentice Hall (1972)."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"M. Cosnard, A. Ferreira, Designing parallel non numerical algorithms, in Parallel Computing '91, Eds. D.J. Evans et coll., North Holland (1991) pp 3\u201318.","DOI":"10.1016\/0167-8191(92)90114-M"},{"key":"11_CR7","unstructured":"A. Gibbons, W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, (1988)."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"R.M. Karp, V. Ramachandran, A survey of parallel algorithms for shared memory machines, Handbook of Theor. Comp. Sc., Ed. Van Leeuwen, North Holland (1992) pp 869\u2013942.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"11_CR9","unstructured":"S. Rao Kosaraju, A.L. Delcher, Optimal Parallel Evaluation of Tree-structured Computations by Raking, LNCS n\u2134 319, VLSI Algorithms and Architectures, pp 103\u2013110."},{"key":"11_CR10","first-page":"236","volume":"n\u2134 227","author":"G.L. Millet","year":"1986","unstructured":"G.L. Millet, V. Ramachandran, E. Kaltofen, Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits, Proc. Aegean Workshop on Computing, LNCS n\u2134 227, (1986), pp 236\u2013251.","journal-title":"Proc. Aegean Workshop on Computing, LNCS"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"A. Gibbons, M. Patterson, Dense-Edgs Embedding of binary trees in the mesh, Proc. SPAA, (1992) pp 257\u2013263.","DOI":"10.1145\/140901.141876"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"M.S. Patterson, W.L. Ruzzo, L. Snyder, Bounds on Minimax Edge Length for Complete Binary Trees, Proc. of the 13th ACM Symp. on the Theory of Comp., (1981), pp 293\u2013299.","DOI":"10.1145\/800076.802481"},{"issue":"No4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1137\/0216044","volume":"16","author":"C. Papadimitriou","year":"1987","unstructured":"C. Papadimitriou, J. Ullman, A Communication Time Tradeoff, SIAM J. on Computing, Vol. 16, No 4, (1987), pp 639\u2013646.","journal-title":"SIAM J. on Computing"},{"key":"11_CR14","unstructured":"W.L. Ruzzo, L. Snyder, Minimum Edge Length Planar Embeddings of Trees, in Kung, Sprull, Steele: VLSI Systems and Computations, Comp. Sc. Press, 119\u2013123(1981)."},{"key":"11_CR15","unstructured":"Y. Saad, Some Topological Properties of the Hypercube Multiprocessor, Research Report 389, Dept. Comp. Sc., Yale University (1984)."}],"container-title":["Lecture Notes in Computer Science","PARLE'94 Parallel Architectures and Languages Europe"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58184-7_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:39:55Z","timestamp":1558269595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58184-7_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581840","9783540484776"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58184-7_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}