Skip to main content

Asynchronous Backtrackable Communications in the SLOOP Object-Oriented Language

  • Conference paper
Programming Environments for Massively Parallel Distributed Systems

Part of the book series: Monte Verità ((MV))

  • 153 Accesses

Abstract

In this paper, we present the resolution algorithm of an extension of the Prolog language to backtrackable communications. This algorithm is based on a dependency graph recording the connections between communication points. An example illustrates the use of backtrackable communications into the SLOOP object-oriented language.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-P. Bodeveix and E. Bizouarn. A Parallel Execution Model — Theroretical Approach and Experimental Results. In IEEE Computer Society Press, editor, procs. of the 7th International Parallel Processing Symposium, pages 7–15, Apr 1993.

    Google Scholar 

  2. D. Chu and K. Clark. I.C. Prolog II: a Multi-Threaded Prolog System. In Giancarlo Succi and Giancarlo Colla, editors, Procs. of the ICLP’93 workshop on Concurrent, Distributed, & Parallel Implementations of Logic Programming Systems, pages 115–136, Jun. 1993.

    Google Scholar 

  3. J.C. Cunha, P.D. Medeiros, M.B. Carvalhosa, and L.M. Pereira. Delta Prolog: A Distributed Programming Language and its Implementation on Distributed Memory Multiprocessors. In Peter Kacsuk and Michael J. Wyse, editors, Implementation of Distributed Prolog, pages 335–356. J. Wiley & Sons, 1992.

    Google Scholar 

  4. F. Cabestre, D. Plaindoux, C. Percebois, and J.-P. Bodeveix. SLOOP: Une extension de Prolog aux objets concurrents. In Equipe ArMen, editor, procs. des 5èmes rencontres sur le parallélisme, pages 115–119, May 1993.

    Google Scholar 

  5. Sz. Ferenczi and I. Futó. CS-Prolog: A Communicating Sequential Prolog. In Peter Kacsuk and Michael J. Wyse, editors, Implementation of Distributed Prolog, pages 357–378. J. Wiley & Sons, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Basel AG

About this paper

Cite this paper

Signès, N., Bodeveix, JP., Plaindoux, D., Cabestre, F., Percebois, C. (1994). Asynchronous Backtrackable Communications in the SLOOP Object-Oriented Language. In: Decker, K.M., Rehmann, R.M. (eds) Programming Environments for Massively Parallel Distributed Systems. Monte Verità. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8534-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8534-8_24

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9668-9

  • Online ISBN: 978-3-0348-8534-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics