Remarks on Memory Consistency Description

• Autorzy: Czaja L.

Identyfikatory

DOI

10.3233/FI-2016-1405

• Konferencja: International Workshop on CONCURRENCY, SPECIFICATION, and PROGRAMMING (CS&P 2015), (24; 28-30.09.2015, Rzeszów, Poland).
• Języki publikacji: EN

Abstrakty

EN

Two observations in the matter of pictorial as well as formal presentation of some consistency in distributed shared memory are made. The first concerns geometric transformation of line segments and points picturing read/write operations, the second - converting partial order of the operations into linear order of their initiations and terminations. This allows to reduce serialization of the read/write operations as a whole to permutations of their beginnings and ends. Some draft proposals are introduced.

Słowa kluczowe

EN

cognitive consistency; permutations; memory; transformations; geometric analysis

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2016
• Tom: Vol. 147, nr 2/3
• Strony: 209--221
• Opis fizyczny: Bibliogr. 7 poz., rys., wykr.

Twórcy

autor

Czaja L.

• Vistula University, Warsaw, Poland
• Institute of Informatics, The University of Warsaw, Poland

Bibliografia

• [1] The Book of Traces, edited by: V. Diekert and G. Rozenberg, Singapore; River Edge, N.J.: World Scientific Publ. Co. 1995. ISBN: 978-981-02-2058-7.
• [2] Kuratowski K, Mostowski A. Set Theory, with an Introduction to Descriptive Set Theory, Studies in Logic and the Foundations of Mathematics - Vol 86, Hardcover – February 26, 1976, second edition. ISBN-13:978-0720404708, 10: 0720404703.
• [3] Marczewski (Spilrajn) K. Sur l’extension de l’ordre partiel, FM 16 (1930), in: Marczewski E. and Hartman S. Collected Mathematical Papers, Polish Academy of Sciences, Institute of Mathematics 1996, pp. 386-389. Available from: https://books.google.pl/books?id=eOvuAAAAMAAJ.
• [4] Mazurkiewicz A. Trace theory, in: W. Brauer et al. Editors, Petri Nets, Application and Relationship to other Models of Concurrency, Lecture Notes in Computer Sciences 255, 1987 pp. 279–324. http://dl.acm.org/citation.cfm?id=25542.25553. doi:10.1007/3-540-17906-2_30.
• [5] Gibbons PB, Korach E. The complexity of sequential consistency, in: Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on Date of Conference, 1-4 Dec 1992 pp. 317–325. doi:10.1109/SPDP.1992.242728.
• [6] Cantin JF, Lipasti MH, Smith JE. The complexity of verifying memory coherence and consistency, IEEE Transactions Parallel and Distributed Systems, 2005;16(7):663–671. http://dx.doi.org/10.1109/TPDS.2005.86, doi:10.1109/TPDS.2005.86.
• [7] Weiwu Hu, Yunji Chen, Tianshi Chen, Cheng Qian, Lei Li. Linear Time Memory Consistency Verification, Computers, IEEE Transactions on, 2011;61(4):502–516. http://dx.doi.org/10.1109/TC.2011.41, doi:10.1109/TC.2011.41.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).