Abstract
By means of two simple data structures, namely the "cell" and the "interrupt", increasingly complex structures are defined. The specification of these structures is given in a novel extension of the path notation which allows to study the synchronic characteristics of the types we define. These structures are shown to be sufficient to specify a non-algorithmic solution to dynamic — Banker's like allocation problems.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
P.R. Torrigiani, P.E. Lauer: An object oriented notation for path expressions, in AICA 77, Vol. 3, pp. 349, 371, Pisa, 1977.
P.E. Lauer, P.R. Torrigiani: Towards a system specification language based on paths and processes, Computing Laboratory, University of Newcastle upon Tyne, Technical Report Series, N., 1976.
R. Campbell: Path Expressions: a techniques for specifying process synchronization, Ph.D. Thesis, University of Newcastle upon Tyne, August, 1976.
P.E. Lauer, R. Campbell: Formal semantics for a class of high-level primitives for coordinating concurrent processes, acta informatica 5, 1975, pp. 247, 332.
R. Devillers: Non starving solutions for the Dining Philosophers problem, ASM/30, Computing Laboratory, University of Newcastle upon Tyne, 1977.
R. Devillers, P.E. Lauer: Some solutions for the Reader/Writer problem, ASM/31, Computing Laboratory, University of Newcastle upon Tyne, 1977.
P.E. Lauer, M.W. Shields: Abstract specification of resource accessing disciplines: adequacy, starvation, priority and interrupts, Workshop on Global description methods for synchronization in real-time applications, AFCET Paris, 1977.
K. Lautenbach: Ein kombinatorischer Ansatz zur Beschreibung und Erreichung von Fairness in Scheduling-Problemen, in Applied Computer Science, Hanser-Verlag, München, 1977.
C.A. Petri: Modelling as a communication discipline, in 3rd international Symposium on Modelling and Performance Evaluation of Computer Systems, Bonn, Oct. 1877.
R. Devillers, P.E. Lauer: A general mechanism for the local control of starvation: application to the dining philosophers and to the reader/writer problem, ASM/32, Computing Laboratory, University of Newcastle upon Tyne, 1977.
A. Silberschatz, R.B. Kieburtz, A. Bernstein: Extending Concurrent Pascal to allow dynamic resouree management, in Proceedings of the 2nd international conference on Software Engineering, San Francisco, 1976.
P. Ancillotti, M. Boari, N. Lijtmaer: Dynamic management in a language for real time programming, in AICA 77, Vol. 1, pp. 335–348, Pisa, Oct. 1977.
E.W. Dijkstra: De Bankiers Algorithme, EWD116, Math. Dep. Technological u., Eindhoven, The Netherlands, 1965.
A.N. Habermann: Prevention of system deadlocks, in CACM 12, N.7, 1969.
P. Brinch Hansen: Operating System Principles, Prentice Hall Series in Automatic Computation, Englewood Cliffs, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Torrigiani, P.R. (1978). Synchronic aspects of data types : Construction of a non-algorithmic solution of the Banker's problem. In: Bracchi, G., Lockemann, P.C. (eds) Information Systems Methodology. ECI 1978. Lecture Notes in Computer Science, vol 65. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08934-9_99
Download citation
DOI: https://doi.org/10.1007/3-540-08934-9_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08934-6
Online ISBN: 978-3-540-35731-5
eBook Packages: Springer Book Archive