Skip to main content
SpringerLink
Log in

Blackboard relations in the μLog coordination model

  • Regular Paper
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

This paper describescoordination relations, that are relations that induce the presence or absence of data on some dataspaces from the presence or absence of other data on other dataspaces.

To that end we build upon previous work on the μLog model and show that the coordination relations can be easily incorporated in it. This is achieved, on the one hand, by means of novel auxiliary operations, not classically used in Linda-like languages, and, on the other hand, by a translation technique reducing the extended μLog model to the core model augmented with the auxiliary operations. Among the most significant ones are multiple read and get operations on a blackboard, readall and getall operations, and tests for the absence of data on blackboards.

Although simple, the form of coordination relations we propose is quite powerful as evidenced by a few examples including relations coming from the object-oriented paradigm such as inheritance relations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Andreoli, J.-M., and Pareschi, R., “Linear Objects: Logical Processes with Built-in Inheritance,”New Generation Computing, 9, 3–4, pp. 445–473, 1991.

    Article  Google Scholar 

  2. Arbab, F., “Coordination of Massively Concurrent Activities,”Technical Report CS-9565, CWI, Amsterdam, The Netherlands, 1995.

    Google Scholar 

  3. Arbab, F., “Rule-Based Object Coordination,” inProc. of the Coordination Conference (Ciancarini, P. and Hankin, C., eds),1061 ofLecture Notes in Computer Science, pp. 1–13. Springer-Verlag, April 1996.

  4. Arbab, F., “The Influence of Coordination on Program Structure.” inProc. of the 30 th Annual Hawaii International Conference on System Sciences, (El-Rewini, H. and Patt, Y., eds),1, pp. 300–309, The IEEE Computer Society Press, 1997.

  5. Banâtre, J.-P. and Le Metayer, D., “Programming by Multiset Transformation,”Communications of the ACM, 36, 1, pp. 98–111, January 1993.

    Article  Google Scholar 

  6. Berry, G. and Boudol, G., “The Chemical Abstract Machine,”Theoretical Computer Science, 96, 1, pp. 217–248, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. Brogi, A., “And-Parallelism without Shared Variables,” inProc. of Seventh International Conference on Logic Programming (Wareren, D.H.D. and Szeredi, P., eds), pp. 306–321, Jerusalem, Israel, 1990. The MIT Press.

  8. Brogi, A. and Ciancarini, P., “The Concurrent Language Shared Prolog,”ACM Transactions on Programming Languages and Systems, 13, 1, pp. 99–123, January 1991.

    Article  Google Scholar 

  9. Carlsson, M., Widén, J., Andersson, J., Andersson, S., Boortz, K., Nilsson, H. and Sjöland, T., “SICStus Prolog User’s Manual,”SICS Technical Report, T91:11B, SICS, Kista, Sweden, 1991.

    Google Scholar 

  10. Ciancarini, P., “Parallel Logic Programming Using the Linda Model of Computation,” inProc. of Research Directions in High-Level Parallel Programming Languages (Banatre, J.-P. and Le Metayer, D., eds),574 ofLecture Notes in Computer Science, pp. 110–125. Springer-Verlag, Mont Saint-Michel, France, June 1991.

    Google Scholar 

  11. Ciancarini, P., “Coordinating Rule-based Software Processes with ESP,”ACM Transactions on Software Engineering and Methodology 2, 3, pp. 203–227, 1993.

    Article  MathSciNet  Google Scholar 

  12. De Bosschere, K. and Jacquet, J.-M., “Extending the μLog Framework with Local and Conditional Blackboard Operations,”Journal of Symbolic Computation, 21, 4, pp. 669–697, April 1996.

    Article  MATH  MathSciNet  Google Scholar 

  13. De Bosschere, K. and Jacquet, J.-M., “μ 2 log: Towards Remote Coordination,” inProc. of the Coordination Conference, (Ciancarini, P. and Hankin, C., eds),1061, ofLecture Notes in Computer Science, pp. 142–159. Springer-Verlag, April 1996.

  14. Futo, I. and Kacsuk, P., “Cs-prolog on Multitransputer Systems,”Microprocessors and Microsystems, 13, 2, pp. 103–112, March 1989.

    Article  Google Scholar 

  15. Gelernter, D., “Generative Communication in Linda,”ACM Transactions on Programming Languages and Systems, 7, 1, pp. 80–112, January 1985.

    Article  MATH  Google Scholar 

  16. Gelernter, D., “Multiple Tuple Spaces in Linda,” inProceedings of the PARLE’89 Conference (Odijk, E., Rem, M. and Syre, J.-C., eds),365 ofLecture Notes on Computer Science, pp. 20–27, 1989.

  17. Gutfreund, Y., Nicol, J., Sasnett, R. and Phuah, V., “WWWinda: An Orchestration Service for WWW Browsers and Accessories,” inElectronic Proc. of the 2nd Conference on the WWW: Mosaic and the Web, 1994.

  18. Jacquet, J.-M. and De Bosschere, K., “On the Semantics of μLog,” Future Generation Computer Systems, February 1994.

  19. Jacquet, J.-M. and de Bosschere, K., “On Relating Blackboards in the μLog Coordination Model,” inProc. of the 30th Annual Hawaii International Conference on System Sciences (El-Rewini, H. and Patt, Y., eds),1, pp. 359–368. The IEEE Computer Society Press, 1997.

  20. Jacquet, J.-M. and Monteiro, L., “Communicating Clauses: the Framework and its Semantics,” inProc. of Joint International Conference and Symposium on Logic Programming (Apt, K. R., ed), Series in Logic Programming, pp. 98–112, Washington, USA, November 1992. The MIT Press.

  21. Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, second edition, 1987.

  22. Mello, P. and Natali, A., “Programs as Collections of Communicating Prolog Units,” inProc. of the ESOP, 213 ofLecture Notes on Computer Science, 1986.

  23. Pereira, L. M., Monteiro, L., Cunha, J. and Aparicio, J. N., “Delta Prolog: A Distributed Backtracking Extension with Events,” inProc. of Third International Conference on Logic Programming (Shapiro, E. Y., ed),225 ofLecture Notes in Computer Science, London, July 1986. Springer Verlag.

  24. Pereira, L. M., Monteiro, L. F., Cunha, J. C. and Aparicio, “Concurrency and Communication in Delta-Prolog,” inthe Design and Application of Parallel Digital Processors, 298, pp. 94–104. IEEE, 1988.

  25. Schwartz, D. G., “Cooperating Heterogeneous Systems: A Blackboard-based Meta Approach,”PhD thesis, Department of Computer Engineering and Science, Case Western Reserve University, 1993.

  26. Sutcliffe, G. and Pinakis, J., “Prolog-D-Linda: An Embedding of Linda in SIC-Stus Prolog,”Technical Report 91/7, Department of Computer Science, University of Western Australia, 1991.

  27. Van Hentenryck, P., Saraswat, V. and Deville, Y., “Constraint Processing in cc(FD),”Technical Report, Brown University, Providence, USA, 1991.

    Google Scholar 

  28. Voronkov, A., “Logic Programming with Bounded Quantifiers,” inProc. of the Russian Conference on Logic Programming: Logic Programming and Automated Reasoning (Voronkov, A., ed),592 ofLecture Notes in Computer Science, pp. 486–514, St-Petersburg, Russia, 1992. Springer-Verlag.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Namur, Belgium

    Jean-Marie Jacquet

  2. Department of Electronics and Information Systems, Ghent University, Belgium

    Koen De Bosschere

Authors
  1. Jean-Marie Jacquet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koen De Bosschere
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Marie Jacquet.

Additional information

Jean-Marie Jacquet, Ph.D.: He is Professor at the Institute of Informatics at the University of Namur, Belgium, and, at an honorary title, Research Associate of the Belgian National Fund for Scientific Research. He obtained a Master in Mathematics from the University of Liège in 1982, a Master in Computer Science from the University of Namur in 1984 and a Ph.D. in Computer Science from the University of Namur in 1989. His research interest are in Programming Languages and Coordination models. He has served as a reviewer and program committee member of several conferences.

Koen de Bosschere, Ph.D.: He holds the degree of master of Science in Engineering of the Ghent University, and a Ph.D. from the same University. He is currently research associate with the Fund for Scientific Research — Flanders and senior lecturer at the Ghent University, where he teaches courses on computer architecture, operating systems and declarative programming languages. His research interests are coordination in parallel logic programming, computer architecture and systems software.

About this article

Cite this article

Jacquet, JM., De Bosschere, K. Blackboard relations in the μLog coordination model. New Gener Comput 19, 23–55 (2001). https://doi.org/10.1007/BF03037533

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037533

Keywords

Search

Navigation