{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:49Z","timestamp":1759638769081},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-44520-x_37","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"277-287","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Towards Optimal Load Balancing Topologies"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Decker","sequence":"first","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Preis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"N. Biggs. Algebraic Graph Theory, Second Edition. Cambridge University Press, 1974\/1993.","DOI":"10.1017\/CBO9780511608704"},{"key":"37_CR2","unstructured":"F. Comellas. (degree,diameter)-graphs. \n                    http:\/\/www-mat.upc.es\/grup_de_grafs\/table_g.html\n                    \n                  ."},{"key":"37_CR3","unstructured":"D.M. Cvetkovic, M. Doob, and H. Sachs. Spectra of Graphs. Joh. Ambrosius Barth, 1995."},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G. Cybenko","year":"1989","unstructured":"G. Cybenko. Load balancing for distributed memory multiprocessors. J. of Parallel and Distributed Computing, 7:279\u2013301, 1989.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"T. Decker. Virtual Data Space-Load balancing for irregular applications. Parallel Computing, 2000. To appear.","DOI":"10.1016\/S0167-8191(00)00061-2"},{"issue":"7","key":"37_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0167-8191(99)00018-6","volume":"25","author":"R. Diekmann","year":"1999","unstructured":"R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789\u2013812, 1999.","journal-title":"Parallel Computing"},{"key":"37_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-48311-X_36","volume-title":"EuroPar\u201999","author":"R. Elsasser","year":"1999","unstructured":"R. Elsasser, A. Frommer, B. Monien, and R. Preis. Optimal and alternating-direction load-balancing schemes. In EuroPar\u201999, LNCS 1685, pages 280\u2013290, 1999."},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"G. Fertin, A. Raspaud, H. Schr\u00f6der, O. Sykora, and I. Vrto. Diamater of Kn\u00f6del graph. In Workshop on Graph-Theoretic Concepts in Computer Science ( WG), 2000. to appear.","DOI":"10.1007\/3-540-40064-8_15"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"B. Ghosh, S. Muthukrishnan, and M.H. Schultz. First and second order diffusive methods for rapid, coarse, distributed load balancing. In SPAA, pages 72\u201381, 1996.","DOI":"10.1145\/237502.237509"},{"key":"37_CR10","unstructured":"M. C. Heydemann, N. Marlin, and S. Perennes. Cayley graphs with complete rotations. Technical Report 1155, L.R.I. Orsay, 1997."},{"issue":"4","key":"37_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0167-8191(99)00002-2","volume":"25","author":"Y.F. Hu","year":"1999","unstructured":"Y.F. Hu and R.J. Blake. An improved diffusion algorithm for dynamic load balancing. Parallel Computing, 25(4):417\u2013444, 1999.","journal-title":"Parallel Computing"},{"issue":"6","key":"37_CR12","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1002\/(SICI)1096-9128(199805)10:6<467::AID-CPE325>3.0.CO;2-A","volume":"10","author":"Y.F. Hu","year":"1998","unstructured":"Y.F. Hu, R.J. Blake, and D.R. Emerson. An optimal migration algorithm for dynamic load balancing. Concurrency: Prac. and Exp., 10(6):467\u2013483, 1998.","journal-title":"Concurrency: Prac. and Exp."},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W. Knodel","year":"1975","unstructured":"W. Knodel. New gossips and telephones. Discrete Mathematics, 13:95, 1975.","journal-title":"Discrete Mathematics"},{"key":"37_CR14","unstructured":"G. Royle. Cages of higher valency. \n                    http:\/\/www.cs.uwa.edu.au\/~gordon\/cages\/allcages.html\n                    \n                  ."},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/S0167-8191(99)00040-X","volume":"25","author":"P. Sanders","year":"1999","unstructured":"P. Sanders. Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Computing, 25:1013\u20131033, 1999.","journal-title":"Parallel Computing"},{"issue":"2","key":"37_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jpdc.1997.1410","volume":"47","author":"K. Schloegel","year":"1997","unstructured":"K. Schloegel, G. Karypis, and V. Kumar. Multilevel diffusion schemes for repartitioning of adaptive meshes. J. of Parallel and Distributed Computing, 47(2): 109\u2013124, 1997.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"37_CR17","unstructured":"R.S. Varga. Matrix Iterative Analysis. Prentice-Hall, 1962."},{"key":"37_CR18","unstructured":"C. Xu and F.C.M. Lau. Load Balancing in Parallel Computers. Kluwer, 1997."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:33:44Z","timestamp":1587342824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}