Skip to main content
SpringerLink
Log in

On the distributed realization of parallel algorithms

  • Invited Papers
  • Conference paper
  • First Online:
SOFSEM'97: Theory and Practice of Informatics (SOFSEM 1997)

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

Abstract

This paper discusses some aspects of implementing parallel algorithms on distributed computer systems like a LAN-connected set of workstations. The notions of parallel and distributed computing are represented by their interrelation. The possibility of distributed simulations of parallel models is discussed. Finally, the complexity theoretical consequences will be addressed.

Supported by the DFG, Project La618/3-2

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Abolhassan, J. Keller, and W. J. Paul. On the cost-effectiveness and realization of the theoretical pram model. SFB Report 09/1991, Universität des Saarlandes, Saarbrücken, 1991. revised and extended version of SFB Report 21/1990.

    Google Scholar 

  2. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity Theory I. Springer, 1988.

    Google Scholar 

  3. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity Theory II Springer, 1990.

    Google Scholar 

  4. D. Culler, R. Karp, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proc. 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 1–12, 1993.

    Google Scholar 

  5. D. Gomm, M. Heckner, K.-J. Lange, and G. Riedle. On the design of parallel programs for machines with distributed memory. In Distributed Memory Computing, Proc. 2nd European Conference, EDMCC2, volume 487 of LNCS, pages 381–391. Springer, 1991.

    Google Scholar 

  6. T. Hagerup, A. Schmitt, and H. Seidl. FORK: A high-level language for PRAMs. Technical Report 22/90, Universität des Saarlandes, Fachbereich 14, Im Stadtwald, 6600 Saarbrücken, 12 1990.

    Google Scholar 

  7. C. P. Kruskal] L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoret. Comput. Sci., 71:95–132, 1990.

    Google Scholar 

  8. K.-J. Lange and R. Niedermeier. Data-independences of parallel random access machines. In Proc. of 13th Conference on Foundations of Software Technology and Theoretical Computer Science, number 761 in LNCS, pages 104–113. Springer, 1993. Accepted for publication by JCSS.

    Google Scholar 

  9. R. Niedermeier. Recursively divisible problems. In Proc. of the 7th ISAAC, number 1178 in LNCS, pages 183–192. Springer, 1996.

    Google Scholar 

  10. R. Niedermeier. Towards Realistic and Simple Models of Parallel Computation. PhD thesis, Universität Tübingen, 1996.

    Google Scholar 

  11. N. Nishimura. Restricted CROW PRAMs. Theoret. Comput. Sci., 123:415–526, 1994.

    Google Scholar 

  12. P. Panangaden. Does concurrency theory have anything to say about parallel programming? EATCS Bull., 58:140–147, 1996.

    Google Scholar 

  13. A. G. Ranade. How to emulate shared memory. J. Comp. System Sci., 42:307–326, 1991.

    Google Scholar 

  14. K. Reinhardt. Strict sequential P-completeness. In Proc. of 14th STACS, number 1200 in LNCS, pages 329–338. Springer, 1997.

    Google Scholar 

  15. P. Rossmanith. The owner concept for PRAMS. In Proc. of the 8th STACS, number 480 in LNCS, pages 172–183. Springer, 1991.

    Google Scholar 

  16. Gary Wayne Sabot. The Paralation Model. MIT Press Cambridge Massachusetts., 1988.

    Google Scholar 

  17. Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33:103–111, 8 1990.

    Google Scholar 

  18. Paul M.B. Vitányi. Nonsequential computation and laws of nature. In VLSI Algorithms and Architectures, number 227 in LNCS, pages 108–120. Springer, 1986.

    Google Scholar 

  19. Paul M.B. Vitányi. Locality, communication, and interconnect length in multicomputers. SIAM J. Comp., 17:659–672, 1988.

    Google Scholar 

  20. J. S. Vitter and R.A. Simons. New classes for parallel complexity: A study of unification and other complete problems for P. IEEE Trans. on Computers, 35:403–418, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Universität Tübingen, Tübingen, Germany

    Klaus-Jörn Lange

Authors
  1. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

František Plášil Keith G. Jeffery

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, KJ. (1997). On the distributed realization of parallel algorithms. In: Plášil, F., Jeffery, K.G. (eds) SOFSEM'97: Theory and Practice of Informatics. SOFSEM 1997. Lecture Notes in Computer Science, vol 1338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63774-5_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-63774-5_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63774-5

  • Online ISBN: 978-3-540-69645-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation