{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:33Z","timestamp":1742617173766,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_27","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:14:42Z","timestamp":1330254882000},"page":"247-269","source":"Crossref","is-referenced-by-count":3,"title":["Parallel architectures: Design and efficient use"],"prefix":"10.1007","author":[{"given":"B.","family":"Monien","sequence":"first","affiliation":[]},{"given":"R.","family":"Feldmann","sequence":"additional","affiliation":[]},{"given":"R.","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"R.","family":"L\u00fcling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"27_CR1","unstructured":"I. Alth\u00f6fer, A Parallel Game Tree Search Algorithm with linear Speedup, to appear in Journal of Algorithms"},{"issue":"No.3","key":"27_CR2","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/0219037","volume":"19","author":"F. Annexstein","year":"1990","unstructured":"F. Annexstein, M. Baumslag, A.L. Rosenberg, Group Action Graphs And Parallel Architectures, SIAM J. Comput. Vol. 19, No. 3, pp. 544\u2013569, June 1990","journal-title":"SIAM J. Comput."},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0004-3702(78)80011-3","volume":"No. 10","author":"G. M. Baudet","year":"1978","unstructured":"G.M. Baudet, On the Branching Factor of the Alpha-Beta Pruning Algorithm, Artificial Intelligence, No. 10, 1978, pp 173\u2013199","journal-title":"Artificial Intelligence"},{"key":"27_CR4","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V. E. Benes","year":"1965","unstructured":"V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, New York, Acadamy Press, 1965"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"S. Bhatt, J. Y. Cai, Take a Walk, Grow a Tree, Proc. of 27th Symposium on Foundations of Computer Science, 1988, pp. 469\u2013478","DOI":"10.1109\/SFCS.1988.21963"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, Extremal Graph Theory, Academic Press 1978","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"27_CR7","unstructured":"M.Y. Chan, F.Y.L. Chin, Parallelized Simulation of Grids by Hypercubes, Technical Report TR-90-11, Department of Computer Science, University of Hong Kong, Hong Kong."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"C. Clos, A study of non blocking switching networks, Bell System Technical Journal, March 1953, pp. 407\u2013424","DOI":"10.1002\/j.1538-7305.1953.tb01433.x"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01660031","volume":"no 1","author":"W. J. Dally","year":"1986","unstructured":"W.J. Dally, C.L. Seitz, The Torus Routing Chip, Distributed Computing, 1986, no 1, pp. 187\u2013196","journal-title":"Distributed Computing"},{"issue":"no.5","key":"27_CR10","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"c-36","author":"W. J. Dally","year":"1987","unstructured":"W.J. Dally, C.L. Seitz, Deadlock-Free Message Routing in Multiprocessor Interconnection Networks, IEEE Transactions on Computers, vol. c-36 1987, no. 5, pp. 547\u2013553","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"R. Diekmann, R. L\u00fcling, J. Simon, Distributed Simulated Annealing and its Applications, Springer Lecture Notes in Economic Sciences, 1992","DOI":"10.1007\/978-3-642-46787-5_2"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz, O. Vornberger Distributed Game Tree Seach, Parallel Algorithms for Machine Intelligence and Pattern Recognition, V. Kumar, L.N. Kanal, P.S. Gopalakrishnan (Editors), 1990, Springer Verlag","DOI":"10.1007\/978-1-4612-3390-9_3"},{"key":"27_CR13","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz A Fully Distributed Chess Program, Advances in Computer Chess VI, D.F. Beal (Editor), 1990, pp 1\u201327"},{"key":"27_CR14","unstructured":"R. Feldmann, P. Mysliwietz, B. Monien Experiments with a Fully Distributed Chess Program, Heuristic Programming in Artificial Intelligence, 3, J. van den Herik, V. Allis (Editors), 1991, pp 72\u201387"},{"issue":"No.1","key":"27_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1142\/S0129626492000131","volume":"2","author":"R. Feldmann","year":"1992","unstructured":"R. Feldmann, W. Unger, The Cube-Connected Cycles Network is a Subgraph of the Butterfly Network, Parallel Processing Letters, Vol. 2, No. 1, 1992, pp. 13\u201319.","journal-title":"Parallel Processing Letters"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"S. Felperin, P. Raghavan, E. Upfal, A Theory of Wormwhole Routing in Parallel Computers, ACM Symposium on Foundations of Computer Science, 1992, pp. 563\u2013572","DOI":"10.1109\/SFCS.1992.267795"},{"key":"27_CR17","first-page":"128","volume":"2","author":"Ch. Ferguson","year":"1988","unstructured":"Ch. Ferguson, R.E. Korf, Distributed Tree Search and its Application to Alpha-Beta Pruning, Proceedings AAAI-88, Seventh National Conference on Artificial Intelligence, Vol. 2, 1988, pp 128\u2013132","journal-title":"Proceedings AAAI-88, Seventh National Conference on Artificial Intelligence"},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"1901","DOI":"10.1109\/PROC.1966.5273","volume":"54","author":"M. J. Flynn","year":"1966","unstructured":"M. J. Flynn, Very high-speed computing systems, Proceedings of the IEEE 54, 12, Dec. 1966, pp. 1901\u20131909","journal-title":"Proceedings of the IEEE"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"R. Funke, R. L\u00fcling, B. Monien, F. L\u00fccking, H. Blanke-Bohne, An optimized reconfigurable architectre for transputer networks, Proc. of the 25th Hawaii Int. Conf. on System Science, 1992, col. 1, pp. 237\u2013245","DOI":"10.1109\/HICSS.1992.183170"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"R. Heckmann, R. Klasing, B. Monien, W. Unger, Optimal Embedding of Complete Binary Trees into Lines and Grids, Proc. of the 17th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG '91), Lecture Notes in Computer Science 570, Springer Verlag, pp. 25\u201335","DOI":"10.1007\/3-540-55121-2_3"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"H. Hofest\u00e4dt, A. Klein, E. Reyzl, Performance Benefits from Locally Adaptive Interval Routing in Dynamically Switched Interconnection Networks, Proc. of 2nd European Distributed Memory Computing Conference, Lecture Notes in Computer Science 487, Springer Verlag, pp. 193\u2013202","DOI":"10.1007\/BFb0032936"},{"key":"27_CR22","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, R. Peine, Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping), manuscript, University of Paderborn, 1992, to appear as a book chapter."},{"key":"27_CR23","volume-title":"PhD Thesis","author":"F. H. Hsu","year":"1990","unstructured":"F.H. Hsu, Large Scale Parallelization of Alpha-Beta Search: An Algorithmic Architectural Study with Computer Chess, PhD Thesis, Carnegie Mellon University, Pittsburgh, USA, 1990"},{"key":"27_CR24","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0743-7315(92)90081-W","volume":"14","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J. J\u00e1J\u00e1, K. W. Ryo, Load Balancing and Routing on the Hypercube and Related Networks, Journal of Parallel and Distributed Computing, 14, 1992, pp. 431\u2013435","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"R. M. Karp, Y. Zhang, On Parallel Evaluation of Game Trees, ACM Symposium on Parallel Algorithms and Architectures 1989, pp 409\u2013420","DOI":"10.1145\/72935.72979"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"R. Klasing, R. L\u00fcling, B. Monien, Compressing Cube-Connected Cycles and Butterfly Networks, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990, pp. 858\u2013865.","DOI":"10.1109\/SPDP.1990.143659"},{"key":"27_CR27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"No. 6","author":"D. E. Knuth","year":"1975","unstructured":"D.E. Knuth, R.W. Moore, An Analysis of Alpha \u2014 Beta Pruning, Artificial Intelligence, No. 6, pp 293\u2013326, 1975","journal-title":"Artificial Intelligence"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"T. Leighton, M. Newman, A. Ranade, E. Schwabe, Dynamic Tree Embedding in Butterflies and Hypercubes, ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 224\u2013234","DOI":"10.1145\/72935.72959"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, Introduction to Parallel Algorithms and Architectures, Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, 1992","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"F. C. H. Lin, R. M. Keller, The Gradient Model Load Balancing Method, IEEE Transactions on Software Engineering, Vol. 13, No. 1 January 1987","DOI":"10.1109\/TSE.1987.232563"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"R. L\u00fcling, B. Monien, F. Ramme, Load Balancing in Large Networks: A Comparative Study, Proc. of 3rd IEEE Symposium on Parallel and Distributed Processing, Dallas, 1991, pp. 686\u2013689","DOI":"10.1109\/SPDP.1991.218196"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"R. L\u00fcling, B. Monien, Load Balancing for Distributed Branch & Bound Algorithms, Proceedings of Int. Parallel Processing Symposium 1992, pp. 543\u2013549","DOI":"10.1109\/IPPS.1992.222970"},{"key":"27_CR33","unstructured":"R. L\u00fcling, B. Monien, M. R\u00e4cke, S. Tsch\u00f6ke, Efficient Parallelization of a Branch & Bound Algorithm for the Symmetric Traveling Salesman Problem, European Workshop on Parallel Computing (EWPC) 1992, Barcelona"},{"key":"27_CR34","unstructured":"T.A. Marsland, M. Olafsson, J. Schaeffer, Multiprocessor Tree-Search Experiments, Advances in Computer Chess IV, D.F. Beal (Editor), Pergamon Press, 1986, pp. 37\u201351"},{"key":"27_CR35","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","volume":"7","author":"B. Monien","year":"1990","unstructured":"B. Monien, I.H. Sudborough, Embedding one Interconnection Network in Another, Computing Suppl. 7 1990, pp. 257\u2013282.","journal-title":"Computing Suppl."},{"key":"27_CR36","doi-asserted-by":"crossref","unstructured":"B. Monien, Simulating binary trees on X-trees, Proc. of the 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA '91), pp. 147\u2013158.","DOI":"10.1145\/113379.113393"},{"key":"27_CR37","doi-asserted-by":"crossref","unstructured":"B. Monien, R. L\u00fcling, F. Langhammer, A realizable efficient parallel architecture, Proc. of 1st Int. Heinz Nixdorf Symposium: Parallel Architectures and Their Efficient Use, Paderborn, 1992","DOI":"10.1007\/3-540-56731-3_10"},{"key":"27_CR38","unstructured":"L. M. Ni, C. W. Xu, T. B. Gendreau, Drafting Algorithm \u2014 A Dynamic Process Migration Protocoll for Distributed Systems, Proc. of 5 th Int. Conf. on Distr. Comp. Systems 1985, pp. 539\u2013546"},{"key":"27_CR39","unstructured":"D.A. Nicole, E.K. Loyds, J.S. Ward, Switching Networks for Transputer Links, Proceedings of the 8th Occam User Group Technical Meeting, 1988, pp. 147\u2013166"},{"key":"27_CR40","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1145\/63047.63088","volume":"2","author":"S. W. Otto","year":"1988","unstructured":"S.W. Otto, E.W. Felten, Chess on a Hypercube, The Third Conference on Hypercube Concurrent Computers and Applications, Vol. 2, 1988, pp 1329\u20131341","journal-title":"The Third Conference on Hypercube Concurrent Computers and Applications"},{"key":"27_CR41","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(80)90037-5","volume":"No. 14","author":"J. Pearl","year":"1980","unstructured":"J. Pearl, Asymptotic Properties of Minmax Trees and Game Searching Procedures, Artificial Intelligence, No. 14, 1980, pp 113\u2013139","journal-title":"Artificial Intelligence"},{"issue":"no.2","key":"27_CR42","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0218015","volume":"18","author":"D. Peleg","year":"1989","unstructured":"D. Peleg, E. Upfal, The Token Distribution Problem, SIAM Journal of Computing, vol. 18, no. 2, April 1989, pp. 229\u2013243","journal-title":"SIAM Journal of Computing"},{"key":"27_CR43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"J. Petersen, Die Theorie der regulren Graphen, Acta Math. 15 1891, pp. 193\u2013220","journal-title":"Acta Math."},{"key":"27_CR44","doi-asserted-by":"crossref","unstructured":"C. G. Plaxton Load Balancing, Selection and Sorting on the Hypercube, ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 64\u201373","DOI":"10.1145\/72935.72943"},{"issue":"5","key":"27_CR45","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. Preparata","year":"1981","unstructured":"F. Preparata, J. Vuillemin, The Cube-Connected Cycles: A versatile Network for Parallel Computation, Communications of the ACM, 24 (5), May 1981, pp. 300\u2013309","journal-title":"Communications of the ACM"},{"key":"27_CR46","doi-asserted-by":"crossref","unstructured":"A. Ranade, Optimal Speedup for Backtrack Search on a Butterfly Network, ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 40\u201348","DOI":"10.1145\/113379.113383"},{"key":"27_CR47","doi-asserted-by":"crossref","unstructured":"A. Reinefeld, Spielbaum-Suchverfahren, Informatik Fachberichte 200, Springer-Verlag, 1989","DOI":"10.1007\/978-3-642-74413-6"},{"key":"27_CR48","doi-asserted-by":"crossref","unstructured":"A.L. Rosenberg, Graph embeddings 1988: Recent breakthroughs, new directions, Proceedings of the 3rd Aegean Workshop on Computing (AWOC): VLSI Algorithms and Architectures, 1988, LNCS 319, pp. 160\u2013169.","DOI":"10.1007\/BFb0040384"},{"key":"27_CR49","doi-asserted-by":"crossref","unstructured":"L. Rudolph, M. Slivkin-Allalouf, E. Upfal, A Simple Load Balancing Scheme for Task Allocation in Parallel Machines, ACM Symposium on Parallel Algorithms and Architectures 1991, pp. 237\u2013245","DOI":"10.1145\/113379.113401"},{"issue":"No.2","key":"27_CR50","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0743-7315(89)90044-0","volume":"6","author":"J. Schaeffer","year":"1989","unstructured":"J. Schaeffer, Distributed Game-Tree Searching, Journal of Parallel and Distributed Computing, Vol. 6 No. 2, 1989, pp 90\u2013114","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"27_CR51","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/321510.321511","volume":"16","author":"J. R. Slagle","year":"1969","unstructured":"J.R. Slagle, J.K. Dixon, Experiments with some Programs that Search Game Trees, Journal of the ACM, 16, 1969, pp 189\u2013207","journal-title":"Journal of the ACM"},{"key":"27_CR52","unstructured":"J. A. Stankovic, I. S. Sidhu, An Adaptive Bidding Algorithm for Processes, Clusters and Distributed Groups, Proc. of 4 th Int. Conf. on Distributed Computing Systems 1984, pp 49\u201359"},{"key":"27_CR53","unstructured":"J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984."},{"key":"27_CR54","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, G.J. Brebner, Universal Schemes for parallel communication, Proc. of ACM STOC 1981, pp. 263\u2013277","DOI":"10.1145\/800076.802479"},{"key":"27_CR55","unstructured":"O. Vornberger, B. Monien, Parallel Alpha-Beta versus Parallel SSS*, Proceedings IFIP Conference on Distributed Processing, North Holland, 1987, pp 613\u2013625"},{"key":"27_CR56","doi-asserted-by":"crossref","unstructured":"P. Zienicke, Embedding of Treelike Graphs into 2-dimensional Meshes, Proceedings of the 16th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 484, pp. 182\u2013190.","DOI":"10.1007\/3-540-53832-1_42"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:49:42Z","timestamp":1742593782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}