Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1993: STACS 93 pp 247–269Cite as

Parallel architectures: Design and efficient use

  • Invited Talk
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 665))

Abstract

In this paper we want to demonstrate the large impact of theoretical considerations on the design and efficient use of parallel machines. We describe interconnection networks for parallel computers, tools for their efficient use (mapping, load balancing) and the parallelization of a problem which is hard to parallelize (chess programming).

This work was partly supported by the German Federal Department of Science and Technology (BMFT), PARAWAN project 413-5839-ITR 9007 BO

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Althöfer, A Parallel Game Tree Search Algorithm with linear Speedup, to appear in Journal of Algorithms

    Google Scholar 

  2. F. Annexstein, M. Baumslag, A.L. Rosenberg, Group Action Graphs And Parallel Architectures, SIAM J. Comput. Vol. 19, No. 3, pp. 544–569, June 1990

    Google Scholar 

  3. G.M. Baudet, On the Branching Factor of the Alpha-Beta Pruning Algorithm, Artificial Intelligence, No. 10, 1978, pp 173–199

    Google Scholar 

  4. V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, New York, Acadamy Press, 1965

    Google Scholar 

  5. S. Bhatt, J. Y. Cai, Take a Walk, Grow a Tree, Proc. of 27th Symposium on Foundations of Computer Science, 1988, pp. 469–478

    Google Scholar 

  6. B. Bollobás, Extremal Graph Theory, Academic Press 1978

    Google Scholar 

  7. 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.

    Google Scholar 

  8. C. Clos, A study of non blocking switching networks, Bell System Technical Journal, March 1953, pp. 407–424

    Google Scholar 

  9. W.J. Dally, C.L. Seitz, The Torus Routing Chip, Distributed Computing, 1986, no 1, pp. 187–196

    Google Scholar 

  10. 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–553

    Google Scholar 

  11. R. Diekmann, R. Lüling, J. Simon, Distributed Simulated Annealing and its Applications, Springer Lecture Notes in Economic Sciences, 1992

    Google Scholar 

  12. 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

    Google Scholar 

  13. R. Feldmann, B. Monien, P. Mysliwietz A Fully Distributed Chess Program, Advances in Computer Chess VI, D.F. Beal (Editor), 1990, pp 1–27

    Google Scholar 

  14. 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–87

    Google Scholar 

  15. 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–19.

    Google Scholar 

  16. S. Felperin, P. Raghavan, E. Upfal, A Theory of Wormwhole Routing in Parallel Computers, ACM Symposium on Foundations of Computer Science, 1992, pp. 563–572

    Google Scholar 

  17. 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–132

    Google Scholar 

  18. M. J. Flynn, Very high-speed computing systems, Proceedings of the IEEE 54, 12, Dec. 1966, pp. 1901–1909

    Google Scholar 

  19. R. Funke, R. Lüling, B. Monien, F. Lücking, 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–245

    Google Scholar 

  20. 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–35

    Google Scholar 

  21. H. Hofestädt, 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–202

    Google Scholar 

  22. J. Hromkovič, 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.

    Google Scholar 

  23. 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

    Google Scholar 

  24. J. JáJá, K. W. Ryo, Load Balancing and Routing on the Hypercube and Related Networks, Journal of Parallel and Distributed Computing, 14, 1992, pp. 431–435

    Google Scholar 

  25. R. M. Karp, Y. Zhang, On Parallel Evaluation of Game Trees, ACM Symposium on Parallel Algorithms and Architectures 1989, pp 409–420

    Google Scholar 

  26. R. Klasing, R. Lüling, B. Monien, Compressing Cube-Connected Cycles and Butterfly Networks, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990, pp. 858–865.

    Google Scholar 

  27. D.E. Knuth, R.W. Moore, An Analysis of Alpha — Beta Pruning, Artificial Intelligence, No. 6, pp 293–326, 1975

    Google Scholar 

  28. 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–234

    Google Scholar 

  29. F.T. Leighton, Introduction to Parallel Algorithms and Architectures, Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, 1992

    Google Scholar 

  30. F. C. H. Lin, R. M. Keller, The Gradient Model Load Balancing Method, IEEE Transactions on Software Engineering, Vol. 13, No. 1 January 1987

    Google Scholar 

  31. R. Lüling, 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–689

    Google Scholar 

  32. R. Lüling, B. Monien, Load Balancing for Distributed Branch & Bound Algorithms, Proceedings of Int. Parallel Processing Symposium 1992, pp. 543–549

    Google Scholar 

  33. R. Lüling, B. Monien, M. Räcke, S. Tschöke, Efficient Parallelization of a Branch & Bound Algorithm for the Symmetric Traveling Salesman Problem, European Workshop on Parallel Computing (EWPC) 1992, Barcelona

    Google Scholar 

  34. 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–51

    Google Scholar 

  35. B. Monien, I.H. Sudborough, Embedding one Interconnection Network in Another, Computing Suppl. 7 1990, pp. 257–282.

    Google Scholar 

  36. B. Monien, Simulating binary trees on X-trees, Proc. of the 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA '91), pp. 147–158.

    Google Scholar 

  37. B. Monien, R. Lüling, F. Langhammer, A realizable efficient parallel architecture, Proc. of 1st Int. Heinz Nixdorf Symposium: Parallel Architectures and Their Efficient Use, Paderborn, 1992

    Google Scholar 

  38. L. M. Ni, C. W. Xu, T. B. Gendreau, Drafting Algorithm — A Dynamic Process Migration Protocoll for Distributed Systems, Proc. of 5 th Int. Conf. on Distr. Comp. Systems 1985, pp. 539–546

    Google Scholar 

  39. 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–166

    Google Scholar 

  40. S.W. Otto, E.W. Felten, Chess on a Hypercube, The Third Conference on Hypercube Concurrent Computers and Applications, Vol. 2, 1988, pp 1329–1341

    Google Scholar 

  41. J. Pearl, Asymptotic Properties of Minmax Trees and Game Searching Procedures, Artificial Intelligence, No. 14, 1980, pp 113–139

    Google Scholar 

  42. D. Peleg, E. Upfal, The Token Distribution Problem, SIAM Journal of Computing, vol. 18, no. 2, April 1989, pp. 229–243

    Google Scholar 

  43. J. Petersen, Die Theorie der regulren Graphen, Acta Math. 15 1891, pp. 193–220

    Google Scholar 

  44. C. G. Plaxton Load Balancing, Selection and Sorting on the Hypercube, ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 64–73

    Google Scholar 

  45. F. Preparata, J. Vuillemin, The Cube-Connected Cycles: A versatile Network for Parallel Computation, Communications of the ACM, 24 (5), May 1981, pp. 300–309

    Google Scholar 

  46. A. Ranade, Optimal Speedup for Backtrack Search on a Butterfly Network, ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 40–48

    Google Scholar 

  47. A. Reinefeld, Spielbaum-Suchverfahren, Informatik Fachberichte 200, Springer-Verlag, 1989

    Google Scholar 

  48. 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–169.

    Google Scholar 

  49. 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–245

    Google Scholar 

  50. J. Schaeffer, Distributed Game-Tree Searching, Journal of Parallel and Distributed Computing, Vol. 6 No. 2, 1989, pp 90–114

    Google Scholar 

  51. J.R. Slagle, J.K. Dixon, Experiments with some Programs that Search Game Trees, Journal of the ACM, 16, 1969, pp 189–207

    Google Scholar 

  52. 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–59

    Google Scholar 

  53. J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984.

    Google Scholar 

  54. L.G. Valiant, G.J. Brebner, Universal Schemes for parallel communication, Proc. of ACM STOC 1981, pp. 263–277

    Google Scholar 

  55. O. Vornberger, B. Monien, Parallel Alpha-Beta versus Parallel SSS*, Proceedings IFIP Conference on Distributed Processing, North Holland, 1987, pp 613–625

    Google Scholar 

  56. 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–190.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Paderborn, Germany

    B. Monien, R. Feldmann, R. Klasing & R. Lüling

Authors
  1. B. Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Feldmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Klasing
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. Lüling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Feldmann, R., Klasing, R., Lüling, R. (1993). Parallel architectures: Design and efficient use. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

  • Online ISBN: 978-3-540-47574-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation