{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:09Z","timestamp":1736084409957,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":59,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601050"},{"type":"electronic","value":"9783540494355"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015237","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:40:23Z","timestamp":1131864023000},"page":"62-77","source":"Crossref","is-referenced-by-count":2,"title":["Efficient use of parallel & distributed systems: From theory to practice"],"prefix":"10.1007","author":[{"given":"Burkhard","family":"Monien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Diekmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Feldmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"L\u00fcling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Knut","family":"Menzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"R\u00f6mke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf-Peter","family":"Schroeder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"M. Adler, S. Chakrabarti, M. Mitzenmacher, L. Rasmussen: Parallel Randomized Load Balancing. Proc. 27th Annual ACM Symp. on Theory of Computing (STOC '95), 1995.","DOI":"10.1145\/225058.225131"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Y. Azar, A.Z. Broder, A.R. Karlin, E. Upfal: Balanced Allocations. Proc. 25th Annual ACM Symp. on Theory of Computing (STOC '93), pp. 593\u2013602, 1993.","DOI":"10.1145\/195058.195412"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"R. Blumofe, C.E. Leiserson: Scheduling Multithreaded Computations by Work Stealing. Proc. 35th Annual IEEE Symp. on Foundations of Computer Science (FOCS '94), pp. 356\u2013368, 1994.","DOI":"10.1109\/SFCS.1994.365680"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"R. Barret, M. Berry, T. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, H. van der Vorst: TEMPLATES for the Solution of Linear Systems: Building Blocks for Iterative Methods. Tech. Rep., CS-Dept., Univ. of Tennessee, 1993. WWW: http:\/\/www.netlib.org\/templates\/templates.ps","DOI":"10.1137\/1.9781611971538"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"3187","DOI":"10.1002\/nme.1620361808","volume":"36","author":"F. Bornemann","year":"1993","unstructured":"F. Bornemann, B. Erdmann, R. Kornhuber: Adaptive Multilevel Methods in Three Space Dimensions. Int. J. on Num. Meth. in Engineering (36), pp. 3187\u20133203, 1993.","journal-title":"Int. J. on Num. Meth. in Engineering"},{"key":"5_CR6","unstructured":"J. Buri\u00e1nek, A. Hole\u010dek, K.Menzel, J. P\u0158ikryl, J. \u017d\u00e1ra: Load Balancing for Parallel Environment on Virtual Walls. accepted for the Winter School of Computer Graphics and CAD Systems, Pilsen, Czech Republic, 1995."},{"key":"5_CR7","unstructured":"S. Bhatt, F. Chung, J. Hong, T. Leighton, B. Obrenic, A. Rosenberg, E. Schwabe: Optimal Emulations by Butterfly-like Networks. J. of the ACM, to appear. (A preliminary version, Optimal Simulations by Butterfly Networks, appeared in: Proc. 20th ACM Symp. on Theory of Computing (STOC '88), pp. 192\u2013204, 1988.)"},{"issue":"No.1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0221012","volume":"21","author":"S. Bhatt","year":"1992","unstructured":"S. Bhatt, F. Chung, T. Leighton, A. Rosenberg: Efficient Embeddings of Trees in Hypercubes. SIAM J. on Computing, Vol. 21, No. 1, pp. 151\u2013162, 1992. (A preliminary version, Optimal Simulations of Tree Machines, appeared in Proc. 27th IEEE Symp. on Foundat. of Computer Science (FOCS '86), pp. 274\u2013282, 1986.)","journal-title":"SIAM J. on Computing"},{"issue":"No.5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1137\/0220052","volume":"20","author":"M.Y. Chan","year":"1991","unstructured":"M.Y. Chan: Embedding of Grids into Optimal Hypercubes. SIAM J. on Computing, Vol. 20, No. 5, pp. 834\u2013864, 1991.","journal-title":"SIAM J. on Computing"},{"key":"5_CR10","unstructured":"M. Cole: Algorithmic Skeletons: Structured Management of Parallel Computation. PhD, Research Monographs in Par. and Distr. Computing, MIT Press."},{"key":"5_CR11","unstructured":"The CUBIT Mesh Generation Research Project, Sandia National Lab 1995, WWW: http: \/\/www.cs.sandia.gov\/HPCCIT\/cubit.html"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"M. Danelutto, R. Di Meglio, S. Orlando, S. Pelagatti, M. Vanneschi: A Methodology for the Development and the Support of Massively Parallel Programs. J. on Future Generation Computer Systems (FCGS), Vol. 8, 1992.","DOI":"10.1016\/0167-739X(92)90040-I"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D.W.N. Sharp, Q. Wu: Parallel Programming Using Skeleton Functions. Proc. of Par. Arch. and Lang. Europe (PARLE '93), Lecture Notes in Computer Science No. 694, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56891-3_12"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"T. Decker, R. Diekmann, R. L\u00fcling, B. Monien: Towards Developing Universal Dynamic Mapping Algorithms. Proc. 7th IEEE Symp. on Parallel and Distributed Processing (SPDP '95), 1995, to appear.","DOI":"10.1109\/SPDP.1995.530718"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"R. Diekmann, D. Meyer, B. Monien: Parallel Decomposition of Unstructured FEM-Meshes. Proc. Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR '95), Lecture Notes in Computer Science, Springer-Verlag, 1995, to appear.","DOI":"10.1007\/3-540-60321-2_17"},{"key":"5_CR16","unstructured":"R. Diekmann, B. Monien, R. Preis: Using Helpful Sets to Improve Graph Bisections. Tech. Rep. tr-rf-94-008, Univ. of Paderborn, 1994, and: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, 1995, to appear."},{"issue":"No.2","key":"5_CR17","first-page":"65","volume":"12","author":"R. Feldmann","year":"1989","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz, O. Vornberger: Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 2, pp. 65\u201373, 1989.","journal-title":"ICCA Journal"},{"key":"5_CR18","volume-title":"Doctoral Thesis","author":"R. Feldmann","year":"1993","unstructured":"R. Feldmann: Game Tree Search on Massively Parallel Systems. Doctoral Thesis, University of Paderborn, Germany, 1993."},{"issue":"No.1\u20133","key":"5_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud, E. Lazard: Methods and problems of communication in usual networks. Discrete Applied Mathematics, Vol. 53, No. 1\u20133, pp. 79\u2013133, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR20","unstructured":"P. Fraigniaud: Vers un principe de localit\u00e9 pour les communications dans les r\u00e9seaux d'interconnection. Habilitation Thesis, ENS Lyon, 1994."},{"key":"5_CR21","unstructured":"W. Furmanski: SuperComputing and Virtual Reality. Presented at the Meckler Conference Virtual Reality '92, San Jose, Ca, 23\u201325 Sept, 1992."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"A. George, J.R. Gilbert, J.W.H. Liu (ed.): Graph Theory and Sparse Matrix Computations. The IMA Volumes in Math. and its Appl. No. 56, Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-8369-7"},{"key":"5_CR23","unstructured":"P.L. George: Automatic Mesh Generation. John Wiley & Sons, 1993."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"B. Ghosh, F.T. Leighton, B. Maggs S. Muthukrishnan, C.G. Plaxton, R. Rajaraman, A.W. Richa, R.E. Tarjan, D. Zuckerman: Tight Analyses of Two Local Load Balancing Algorithms. Proc. 27th Annual ACM Symp. on Theory of Computing (STOC '95), pp. 548\u2013558, 1995.","DOI":"10.1145\/225058.225272"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"A. Gupta, V. Kumar: A Scalable Parallel Algorithm for Sparse Matrix Factorization. Tech. Rep. TR 94-19, Dept. of Comp. Science, Univ. of Minnesota, 1994.","DOI":"10.1145\/602770.602898"},{"key":"5_CR26","unstructured":"S.W. Hammond: Mapping Unstructured Grid Computations to Massively Parallel Computers. Tech. Rep. 92.14, RIACS, NASA Ames Research Center, 1992."},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"R. Heckmann, R. Klasing, B. Monien, W. Unger: Optimal Embedding of Complete Binary Trees into Lines and Grids. Proc. 17th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG '91), Lecture Notes in Computer Science No. 570, Springer-Verlag, pp. 25\u201335, 1991.","DOI":"10.1007\/3-540-55121-2_3"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland: The Chaco User's Guide. Tech. Rep. SAND93-2339, Sandia National Lab., Nov. 1993.","DOI":"10.2172\/10106339"},{"issue":"No.2","key":"5_CR29","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B. Hendrickson","year":"1995","unstructured":"B. Hendrickson, R. Leland: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations. SIAM J. on Scientific Computing, Vol. 16, No. 2, pp. 452\u2013469, 1995.","journal-title":"SIAM J. on Scientific Computing"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jpdc.1994.1124","volume":"23","author":"M. C. Heydemann","year":"1994","unstructured":"M. C. Heydemann, J. Opatrny, D. Sotteau: Embeddings of Hypercubes and Grids into de Bruijn Graphs. J. of Parallel and Distributed Computing, Vol. 23, pp. 104\u2013111, 1994.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, K. Lory\u015a, P. Kanarek, R. Klasing, W. Unger, H. Wagener: On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. Proc. 12th Symp. on Theoretical Aspects of Computer Science (STACS '95), Lecture Notes in Computer Science No. 900, Springer-Verlag, pp. 255\u2013266, 1995.","DOI":"10.1007\/3-540-59042-0_78"},{"key":"5_CR32","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, R. Peine: Dissemination of information in interconnection networks (broadcasting and gossiping). In: F. Hsu, D.-Z. Du (ed.): Combinatorial Network Theory, Kluwer Academic Pub., 1995, to appear."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, W. Unger, H. Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT '94), Lecture Notes in Computer Science No. 824, Springer-Verlag, pp. 219\u2013230, 1994.","DOI":"10.1007\/3-540-58218-5_20"},{"key":"5_CR34","unstructured":"G. Karypis, V. Kumar: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. Techn. Rep. 95-035, Dept. of Comp. Science, University of Minnesota, 1995."},{"key":"5_CR35","unstructured":"F.T. Leighton: Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann Publishers, 1992."},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"T. Leighton, M. Newman, A. Ranade, E. Schwabe: Dynamic Tree Embedding in Butterflies and Hypercubes. Proc. 1st Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA '89), pp. 224\u2013234, 1989.","DOI":"10.1145\/72935.72959"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"R. L\u00fcling, B. Monien: A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. Proc. 5th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA '93), pp. 164\u2013173, 1993.","DOI":"10.1145\/165231.165252"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"E. Ma, D.G. Shea: The Embedding Kernel on the IBM Victor Multiprocessor for Program Mapping and Network Reconfiguration. Proc. 2nd IEEE Symp. on Parallel and Distributed Processing (SPDP '90), 1990.","DOI":"10.1109\/SPDP.1990.143662"},{"key":"5_CR39","first-page":"61","volume":"2","author":"B.M. Maggs","year":"1995","unstructured":"B.M. Maggs, L.R. Matheson, R.E. Tarjan: Models of Parallel Computation: A Survey and Sythesis. Proc. 28th Hawaii Int. Conference on System Sciences (HICSS-w28), Vol. 2, pp. 61\u201370, 1995.","journal-title":"Proc. 28th Hawaii Int. Conference on System Sciences (HICSS-w28)"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, S. N\u00e4her: LEDA, a Library of Efficient Data Types and Algorithms. Proc. 14th Int. Symp. on Mathem. Foundations of Computer Science (MFCS '89), Lecture Notes in Computer Science No. 379, Springer-Verlag, pp. 88\u2013106, 1989.","DOI":"10.1007\/3-540-51486-4_58"},{"key":"5_CR41","first-page":"91","volume-title":"SSCG, Spring School on Computer Graphics","author":"K. Menzel","year":"1994","unstructured":"K. Menzel: Parallel Rendering Techniques for Multiprocessor Systems. SSCG, Spring School on Computer Graphics, Bratislava, Slovakia, 1994, Comenius University Press, pp. 91\u2013103, 1994."},{"key":"5_CR42","first-page":"327","volume":"24","author":"Z. Miller","year":"1994","unstructured":"Z. Miller, I.H. Sudborough: Compressing Grids into Small Hypercubes. NET-WORKS, Vol. 24, pp. 327\u2013358, 1994.","journal-title":"NET-WORKS"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"B. Monien: Simulating binary trees on X-trees. Proc. 3rd Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA '91), pp. 147\u2013158, 1991.","DOI":"10.1145\/113379.113393"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"B. Monien, R. Diekmann, R. L\u00fcling: Communication Throughput of Interconnection Networks. Proc. 19th Int. Symp. on Mathematical Foundations of Computer Science (MFCS '94), Lecture Notes in Computer Science No. 841, Springer-Verlag, pp. 72\u201386, 1994.","DOI":"10.1007\/3-540-58338-6_60"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"B. Monien, R. Feldmann, R. Klasing, R. L\u00fcling: Parallel Architectures: Design and Efficient Use. Proc. 10th Symp. on Theoretical Aspects of Computer Science (STACS '93), Lecture Notes in Computer Science No. 665, Springer-Verlag, pp. 247\u2013269, 1993.","DOI":"10.1007\/3-540-56503-5_27"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"B. Monien, I.H. Sudborough: Simulating Binary Trees on Hypercubes. Proc. Aegean Workshop on Computing (AWOC '88), Lecture Notes in Computer Science No. 319, Springer-Verlag, pp. 170\u2013180, 1988.","DOI":"10.1007\/BFb0040385"},{"key":"5_CR47","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, pp. 257\u2013282, 1990.","journal-title":"Computing Suppl."},{"key":"5_CR48","unstructured":"The Berkeley NOW Project. WWW: http:\/\/now.cs.berkeley.edu\/"},{"key":"5_CR49","unstructured":"A. Nowatzyk: The S3.mp Interconnect System and TIC Chip. in: Hot Interconnects 93, Stanford CA, August 1993."},{"key":"5_CR50","unstructured":"W. Purgathofer, M. Feda: Progressive Refinement Radiosity on a Transputer Network. Proc. 2nd Eurographics Workshop on Rendering, Barcelona, Spain, 1991."},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"A. Ranade: Optimal Speedup for Backtrack Search on a Butterfly Network. Proc. 3rd Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA '91), pp. 40\u201348, 1991.","DOI":"10.1145\/113379.113383"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"T. R\u00f6mke, M. R\u00f6ttger, U.-P. Schroeder, J. Simon: On Efficient Embeddings of Grids into Grids in Parix. Proc. EURO-PAR '95, Lecture Notes in Computer Science, Springer-Verlag, 1995, to appear.","DOI":"10.1007\/BFb0020464"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"M. R\u00f6ttger, U.-P. Schroeder, J. Simon: Implementation of a Parallel and Distributed Mapping Kernel for PARIX. Int. Conference and Exhibition on High-performance Computing and Networking (HPCN Europe '95), Lecture Notes in Computer Science No. 919, Springer-Verlag, pp. 781\u2013786, 1995.","DOI":"10.1007\/BFb0046714"},{"key":"5_CR54","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","volume":"2","author":"H.D. Simon","year":"1991","unstructured":"H.D. Simon: Partitioning of Unstructured Problems for Parallel Processing. Computing Systems in Engineering (2), pp. 135\u2013148, 1991.","journal-title":"Computing Systems in Engineering"},{"issue":"6","key":"5_CR55","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/129888.129890","volume":"35","author":"L. Smarr","year":"1992","unstructured":"L. Smarr, C.E. Catlett: Metacomputing. Comm. of the ACM 35(6), pp. 45\u201352, 1992.","journal-title":"Comm. of the ACM"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"W. St\u00fcrzlinger, C. Wild: Parallel Visibility Computations for Parallel Radiosity. Parallel Processing, pp. 405\u2013413, 1994.","DOI":"10.1007\/3-540-58430-7_36"},{"key":"5_CR57","doi-asserted-by":"crossref","unstructured":"S. Tsch\u00f6ke, R. L\u00fcling, B. Monien: Solving the Traveling Salesman Problem with a Distributed Branch-and-Bound Algorithm on a 1024 Processor Network. Proc. 9th Int. Parallel Processing Symp. (IPPS '95), pp. 182\u2013189, 1995.","DOI":"10.1109\/IPPS.1995.395930"},{"key":"5_CR58","doi-asserted-by":"crossref","unstructured":"A.J. West, T.L.J. Howard et al.: AVIARY: A Generic Virtual Reality Interface for Real Applications. Virtual Reality Systems, 1992.","DOI":"10.1016\/B978-0-12-227748-1.50023-8"},{"key":"5_CR59","unstructured":"O.C. Zienkiewicz: The finite element method. McGraw-Hill, 1989."}],"container-title":["Lecture Notes in Computer Science","Computer Science Today"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:04:25Z","timestamp":1736082265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601050","9783540494355"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/bfb0015237","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}