Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
A new protocol using vectors of global timestamps for mutual exclusion in systems with Distributed Shared Memory (DSM) is described and some of its properties are proved.
Wydawca
Czasopismo
Rocznik
Tom
Strony
359--370
Opis fizyczny
Bibliogr. 8 poz., rys.
Twórcy
autor
- Vistula University, Warsaw, Poland
- Institute of Informatics, The University of Warsaw, Poland
Bibliografia
- [1] Czaja L. Remarks on Memory Consistency Description, Fundamenta Informaticae 2016;147(2-3):209-221 doi:10.3233/FI-2016-1405.
- [2] Dijkstra EW. Cooperating sequential processes, in F. Genuys, ed., Programming Languages: NATO Advanced Study Institute. Academic Press, 1968 pp. 43-112.
- [3] Dijkstra EW. The Origin of Concurrent Programming,. Cooperating Sequential Processes. Springer Verlag New York, 2002 pp. 65-138. doi:10.1007/978-1-4757-3472-0.
- [4] Kuz I, Chakravarty MMT, and Heiser G. A course on distributed systems COMP 9243, 2016.
- [5] Lamport L. Time, Clocks and the Ordering of Events in Distributed Systems, Communications of the ACM 21, 7 (July 1978), pp. 558-565. doi:10.1145/359545.359563.
- [6] Lamport L. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs, IEEE Transactions on Computers C-28, 1979 pp. 690-691. doi:10.1109/TC.1979.1675439.
- [7] Ricart G, and Agrawala AK. An Optimal Algorithm For Mutual Exclusion in Computer Networks, Communications of the ACM, 1981:24(1):9-17. doi:10.1145/358527.358537.
- [8] Saxena PC, and Rai J. A survey of permission-based distributed mutual exclusion algorithms, in Computer Standards & Interfaces, 2003;25(2):159-181. URL https://doi.org/10.1016/S0920-5489(02)00105-8.
Uwagi
Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-2eae9a61-d283-4efb-8111-1bc51913a973