Programming 1980: International Symposium on Programming pp 223-239 | Cite as

Specification of highly parallel and distributed resource management

  • P. E. Lauer
  • P. R. Torrigiani
  • R. Devillers
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 83)

Abstract

A highly parallel strategy is described for the well known banker's problem. Efficiency is reached by distributing the tasks to be performed between a set of parallel activities and by avoiding whenever possible the time consuming conflict situations and choice problems, which otherwise could slow down the parallel processes.

The solution is described in the COSY notation, a macro notation designed to express long, parametric path programs in an easy, compact and structured way.

Keywords

Priority Constraint Choice Problem COncurrent SYstem Computing Laboratory Path Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. [1]
    -DIJKSTRA, E.W. — Co-operating Sequential Processes, in Programming Languages, ed. Genuys, Academic Press, N.Y. (1968).Google Scholar
  2. [2]
    -HABERMANN, A.N. — Prevention of System Deadlocks, CACM, vol. 12, No. 7, (1969).Google Scholar
  3. [3]
    -HABERMANN, A.N. — A New Approach to Avoidance of System Deadlocks, RAIRO, ed. Dunod, vol. 9, No. B-3 (1975).Google Scholar
  4. [4]
    -TORRIGIANI, P.R. and LAUER, P.E. — An Object Oriented Notation for Path Expressions, AICA Annual Conference, Pisa, vol. 3, pp 349–371 (1977).Google Scholar
  5. [5]
    LAUER, P.E., and TORRIGIANI, P.R. — Toward a System Specification Language Based on Paths and Processes; TR120, University of Newcastle upon Tyne. Computing Laboratory (1978).Google Scholar
  6. [6]
    TORRIGIANI, P.R. — Synchronic Aspects of Data Types; Construction of a Non-Algorithmic Solution of the Banker's Problem, ECI 78, Information System Methodology, Lecture Notes in Computer Science, Springer-Verlag (1978).Google Scholar
  7. [7]
    LAUER, P.E., TORRIGIANI, P.R., SHIELDS, M.W. — COSY — a System Specification Language Based on Paths and Processes. Acta Informatica 12, 109–158 (1979).Google Scholar
  8. [8]
    LAUER, P.E., and CAMPBELL, R. — Formal Semantics for a Class of High-Level Primitives for Coordinating Concurrent Processes, Acta Informatica, vol. 5, pp. 247–332 (1975).Google Scholar
  9. [9]
    CAMPBELL R. — Path Expressions: a Technique for Specifying Process Synchronization, Ph.D. Thesis, University of Newcastle upon Tyne (1976).Google Scholar
  10. [10]
    HAVENDER J.W. — Avoiding Deadlock in Multitasking Systems, IBM System Journal, vol. 7, no. 2, pp. 74–84 (1968).Google Scholar
  11. [11]
    HABERMANN A.N. — Path Expressions, Technical Report, Carnegie-Mellon University, Pittsburgh, PA USA (1975).Google Scholar
  12. [12]
    DEVILLERS R. — Non Starving Solutions for the Dining Philosophers Problem, ASM/30, University of Newcastle upon Tyne, Computing Laboratory (1977).Google Scholar
  13. [13]
    DEVILLERS R. and LAUER P.E. — Some Solutions for the Reader/Writer Problem, ASM/31, University of Newcastle upon Tyne, Computing Laboratory (1977).Google Scholar
  14. [14]
    DEVILLERS R. and LAUER P.E. — A General Mechanism for the Local Control of Starvation: Application to the Dining Philosophers and to the Reader/Writer Problem, ASM/32, University of Newcastle upon Tyne, Computing Laboratory (1977).Google Scholar
  15. [15]
    LAUER P.E., TORRIGIANI P.R. and DEVILLERS R. — The Hyperfast Banker, ASM/55, University of Newcastle upon Tyne, Computing Laboratory (1979).Google Scholar
  16. [16]
    DEVILLERS R. — A simplified Hyperfast Banker, ASM/56, University of Newcastle upon Tyne, Computing Laboratory (1979).Google Scholar
  17. [17]
    DEVILLERS R. — On the Banker with Several Currencies, ASM/57, University of Newcastle upon Tyne, Computing Laboratory (1979).Google Scholar
  18. [18]
    CAMPBELL, R.H., and HABERMANN, A.N. — The Specification of Process Synchronization by Path Expressions. Lecture Notes in Computer Science (Ed. G. Goos and J. Hartmanis) pp. 89–102, V16 Springer Verlag, 1974.Google Scholar
  19. [19]
    LAUER, P.E, SHIELDS, M.W., BEST, E. — The design and certification of asynchronous systems of processes. Proc. of EEC Advanced Course on Abstract Software Specification, Lyngby, Jan. 22 — Feb. 2, 1979. Lecture Notes in Computer Science (to appear)Google Scholar
  20. [20]
    SHIELDS, M.W., — Adequate Path Expressions. Proc. Symp. on the Semantics of Concurrent Computation, Evian — Les — Bains, July 2–4, 1979. Springer Lecture Notes in Computer Science Vol. 70, 1979.Google Scholar
  21. [21]
    LAUER P.E., SHIELDS, M.W., BEST, E. — Formal Theory of the Basic COSY Notation. The Computing Laboratory, University of Newcastle upon Tyne, Tech. Rep. Series No. 143, Nov. 1979.Google Scholar
  22. [22]
    SHIELDS, M.W., LAUER, P.E. — Programming and Verifying Concurrent Systems In COSY. The Computing Laboratory, University of Newcastle upon Tyne, Asynchronous System Memo 68, 31 January, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • P. E. Lauer
    • 1
  • P. R. Torrigiani
    • 2
  • R. Devillers
    • 3
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneNewcastle upon TyneEngland
  2. 2.Institut für Informationssystemforschung, Gesellschaft für Mathematik und Datenverarbeitung MBH BonnWest Germany
  3. 3.Universite Libre de BruxellesBrusselsBelgium

Personalised recommendations