Skip to main content
SpringerLink
Log in

Algebraic computing on a local net

  • Conference paper
  • First Online:
Computer Algebra and Parallelism (CAP 1990)

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

Included in the following conference series:

Abstract

An extension of the computer algebra system SAC-2 for the execution of algorithms by the workstations on a local net is described. We are more interested in the reduction of the execution time of existing algorithms than in the development of new parallel computing models. The semantics of the SAC-2 system language ALDES is extended for the specification of concurrent procedure calls. During the parallel execution of these calls the results are represented by futures, whose existence is hidden to the programmer by using data types. The current implementation, based on the SAC-2 I/O concept, is described. As an example for algorithms with many concurrent subtasks, the execution times for a distributed version of a modular algorithm are shown.

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. G.R. Andrews and F.B. Schneider. Concepts and Notations for Concurrent Programming. Computing Surveys, 15(1):3–42, 3 1983.

    Article  Google Scholar 

  2. G. Collins and R. Loos. SAC-2, 1989.

    Google Scholar 

  3. R.H. Halstead. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems, 7(4):501–538, October 1985.

    Article  Google Scholar 

  4. P. Knueven, P.G. Hibbard, and B.W. Leverett. A Language System for a Multiprocessor Environment. In Proc. of the 4. Int. Conf. on the Design and Implementation of Algorithmic Languages, pages 264–274, June 1976.

    Google Scholar 

  5. B. Liskov. ARGUS Reference Manual. Technical report, Laboratory for Computer Science, Cambridge, Mass., 1987.

    Google Scholar 

  6. B. Liskov and L. Shrira. Promises: Linguistic Support for Efficient Asynchronous Procedure Calls in Distributed Systems. In Proceedings of the SIGPLAN 1988, June 22–24, pages 260–267, 1988.

    Google Scholar 

  7. S. Sechrest. An Introductory 4.3BSD Interprocess Communication Tutorial. Technical report, DEECS, University of California, Berkeley, 1986.

    Google Scholar 

  8. S. Seitz. Parallel Algorithm Development. In J. Della Dora and J. Fitch, editors, Computer Algebra and Parallelism, chapter 15, pages 223–232. Academic Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Arbeitsgruppe Computer Algebra, Universität Tübingen, Tübingen, Germany

    Steffen Seitz

Authors
  1. Steffen Seitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Richard E. Zippel

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seitz, S. (1992). Algebraic computing on a local net. In: Zippel, R.E. (eds) Computer Algebra and Parallelism. CAP 1990. Lecture Notes in Computer Science, vol 584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55328-2_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-55328-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47026-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation