{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:28:05Z","timestamp":1725456485131},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0002741","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"250-257","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Routing on asyncronous processor networks"],"prefix":"10.1007","author":[{"given":"Efstratios","family":"Karaivazoglou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"M.Aleiunas. Randomized parallel communication. In Proc. of the Symp. on Princ. of Distrib. Computing, pp. 60\u201372, 1982.","DOI":"10.1145\/800220.806683"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Voecking. Universal Algorithms for Store-and-Forward and Wormhole Routing. In Proc. of the 28th Symp. on Theory of Computing, pp. 356\u2013365, 1996","DOI":"10.1145\/237814.237982"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"R. Cole and O. Zajicek. The APRAM: Incorporating Asynchrony into the PRAM model. In Proc. of the 1st Annual ACM Symp. on Paral. Alg. and Arch., pp. 169\u2013178, June 1989.","DOI":"10.1145\/72935.72954"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1006\/jcss.1995.1067","volume":"51","author":"R. Cole","year":"1995","unstructured":"R. Cole and O. Zajicek. The Expected Advantage of Asynchrony. In Journal of Computer and Systems Sciences, 51, pp. 286\u2013300, 1995.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"63","author":"W. Dally","year":"1987","unstructured":"W. Dally and C. L. Seitz. Deadlock free message routing in multiprocessor interconnection networks. In IEEE Trans. on Computers, 63, pages 547\u2013553, 1987","journal-title":"IEEE Trans. on Computers"},{"issue":"12","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1320","DOI":"10.1109\/71.250114","volume":"4","author":"J. Duato","year":"1993","unstructured":"J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. In IEEE Trans. on Parallel and Distr. Systems, pages 1320\u20131331","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"29_CR7","volume-title":"Introduction to parallel algorithms and architectures: arraystrees-hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"F.T.Leighton. Introduction to parallel algorithms and architectures: arraystrees-hypercubes, Morgan Kaufmann Publishers (San Mateo, CA 1992)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"F.T.Leighton, B.M. Maggs. Fast algorithms for finding O(congestion + dilation) packet routing schedules. In Proc. of the 28th Int. Conf. on System Sciences, pp.555\u2013563, 1995","DOI":"10.21236\/ADA311323"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, B.M. Maggs, and S.B. Rao. Universal packet routing algorithms ( Extended Abstract ). In Proc. of the 29th Annual Symp. on Found. of Comp. Science, pp. 256\u2013271, 1988.","DOI":"10.1109\/SFCS.1988.21942"},{"key":"29_CR10","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"N.A. Lynch. Distributed Algorithms, Morgan Kaufmann Publishers ( San Francisco, CA 1996)."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Y. Mansour, B. Patt-Shamir. Greedy packet scheduling on shortest paths. In Proc. of the 10th Annual ACM Symp. on Princ. of Distrib. Computing, 1991.","DOI":"10.1145\/112600.112615"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"F.Meyer auf der Heide, and B. Voecking. A Packet Routing Protocol for Arbitrary Networks. In Proc. of the 12th Symp. on Theor. Aspects of Comp. Science, pp. 291\u2013302, 1995.","DOI":"10.1007\/3-540-59042-0_81"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"A.G. Ranade","year":"1991","unstructured":"A.G. Ranade. How to emulate shared memory. In Journal of Computer and System Sciences 42, pp. 307\u2013326, 1991.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E. Upfal","year":"1984","unstructured":"E.Upfal. Efficient schemes for parallel communication. In Journal of ACM Vol.31, No.3, pp. 507\u2013517, 1984.","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:49:28Z","timestamp":1587343768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0002741","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","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"}]}}