Abstract
The serializability condition is usually considered in order to maintain the consistency of a Database in the presence of conflicting accesses to the Database performed by concurrent transactions. The transactions considered in this paper may be infinitely often repeated and a synchronization algorithm is proposed which controls the serializability condition for such transactions. This algorithm, based upon the use of FIFO-Nets, provides the maximal amount of parallelism among the transactions and guaranties fairness, i.e., every transaction is actually performed infinitely often. As an application, the synchronization algorithm is shown to give also a fair solution to the classical dining philosophers problem. The size of the memory needed by the algorithm cannot be bounded, however a particular case is pointed out for which memory boundedness can be achieved. This particular case covers the problem of updating multiple copies of a Database.
Preview
Unable to display preview. Download preview PDF.
References
Bernstein P.A.; Goodman N.: Concurrency Control and Distributed Database Systems. Computing Surveys 13, No 2, 185–221 (1981).
Dijskstra E.W.: Hierarchical ordering of sequential process. Acta Inf. 1, No 2, 115–138 (1971).
Eswaran K.P.; Gray J.N.; Lorie R.A.; Traiger J.L.: The Notions of Consistency and Predicate Locks in Database Systems. Commun. ACM 19, No 11, 624–633 (1976).
Finkel A.; Memmi G.: FIFO-nets: a new model of parallel computation. Proc. of the 6th G.I. Conf. on Theoretical Computer Science, Dortmund, Pays-Bas, Lect. Notes Comput. Sci. 150 (1983).
Flé M.P.; Roucairol G.: On Serializability of Iterated Transactions. ACM SIGACT-SIGOPS Symp. on Princ. of Distributed Computing, Ottawa, Canada, 194–200 (1982).
Karp R.M.; Miller R.E.: Parallel Program Schemata. J. Comput. System Sci. 3, 147–195 (1969).
Keller R.M.: Parallel Program Schemata and Maximal Parallelism. J. Assoc. Comp. Mach. 20, No3, 514–537 (1973).
Kwong Y.: On the absence of Livelocks in Parallel Programs. Semantics of Concurrent Computations. Proceedings, Evian, France, Lect. Notes Comput. Sci. 70, 172–190 (1979).
Mazurkiewicz A.: Concurrent Program Schemes and their Interpretation. Proceedings, Aarhus Workshop on Verification of Parallel Processes (1977).
Papadimitriou C.H.; Bernstein P.A.; Rothnie J.B.: Some computational problems related to Database Concurrency Control. Proc. Conf. Theoretical Computer Science, Waterloo, Canada, 275–282 (1977).
Roucairol G.: Mots de synchronisation. RAIRO, Informatique/Computer 12, No4, 277–290 (1978).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flé, M.P., Roucairol, G. (1985). Fair serializability of iterated transactions using fifo-nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-15204-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15204-0
Online ISBN: 978-3-540-39320-7
eBook Packages: Springer Book Archive