The splay-list: a distribution-adaptive concurrent skip-list

Συγγραφείς: Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami

Συνεισφορές: Vitaly Aksenov and Dan Alistarh and Alexandra Drozdova and Amirkeivan Mohtashami, Attiya, Hagit

Πηγή: Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020)

Θεματικοί όροι: FOS: Computer and information sciences, Data structures, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, self-adjusting, Computer Science - Distributed, Parallel, and Cluster Computing, Theory of computation → Concurrent algorithms, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, concurrency, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, Theory of computation → Data structures design and analysis

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2008.01009
https://drops.dagstuhl.de/opus/volltexte/2020/13081/pdf/LIPIcs-DISC-2020-3.pdf/
https://arxiv.org/pdf/2008.01009
https://drops.dagstuhl.de/opus/volltexte/2020/13081/
https://dblp.uni-trier.de/db/journals/corr/corr2008.html#abs-2008-01009
https://arxiv.org/abs/2008.01009
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.3

Towards Concurrent Quantitative Separation Logic

Συγγραφείς: Fesefeldt, Ira Justus, Katoen, Joost-Pieter, Noll, Thomas

Πηγή: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs - Leibniz International Proceedings in Informatics 243, 25:1-25:24 (2022). doi:10.4230/LIPICS.CONCUR.2022.25 ; 33rd International Conference on Concurrency Theory (CONCUR 2022) / Herausgeber: Bartek Klin, Sławomir Lasota, Anca Muscholl ; 33rd International Conference on Concurrency Theory (CONCUR 2022) / Herausgeber: Bartek Klin, Sławomir Lasota, Anca Muscholl 33. International Conference on Concurrency Theory, CONCUR 2022, Warsaw, Poland, 2022-09-13 - 2022-09-16

Θεματικοί όροι: Concurrency, Heap-Manipulating, Mathematics of computing → Probabilistic reasoning algorithms, Pointers, Randomization, Separation Logic, Theory of computation → Concurrent algorithms, Theory of computation → Program verification

Θέμα γεωγραφικό: DE

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-246-4

Διαθεσιμότητα: https://publications.rwth-aachen.de/record/853299
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2022-08746%22

Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers

Συγγραφείς: Attiya, Hagit, Enea, Constantin, Welch, Jennifer L.

Συνεισφορές: Hagit Attiya and Constantin Enea and Jennifer L. Welch, Gilbert, Seth

Θεματικοί όροι: FOS: Computer and information sciences, Impossibility proofs, Computing methodologies → Concurrent algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, Concurrent Objects, Computer Science - Distributed, Parallel, and Cluster Computing, Computing methodologies → Distributed algorithms, Shared registers, Theory of computation → Distributed computing models, Theory of computation → Concurrent algorithms, Message-passing systems, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004, Strong linearizability, BG simulation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2105.06614
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.7

Brief Announcement: Persistent Software Combining

Συγγραφείς: Fatourou, Panagiota, Kallimanis, Nikolaos D., Kosmas, Eleftherios

Συνεισφορές: Panagiota Fatourou and Nikolaos D. Kallimanis and Eleftherios Kosmas, Gilbert, Seth

Θεματικοί όροι: wait-freedom, stacks, queues, recoverable algorithms, software combining, Theory of computation → Concurrent algorithms, Persistent objects, universal constructions, durability, ddc:004, synchronization protocols, Theory of computation → Data structures design and analysis

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.56

Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity

Συγγραφείς: Mirza, Ahad, Hendler, Danny, Milani, Alessia, Travers, Corentin

Συνεισφορές: Institute of Science and Technology Austria (IST Austria), Ben-Gurion University of the Negev (BGU), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)

Πηγή: https://hal.archives-ouvertes.fr/hal-02860087 ; 2020.

Θεματικοί όροι: CCS Concepts: • Theory of computation → Concurrent algorithms Additional Key Words and Phrases: shared memory, atomic snapshot, max array, amortized step complexity, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Relation: hal-02860087; https://hal.archives-ouvertes.fr/hal-02860087; https://hal.archives-ouvertes.fr/hal-02860087/document; https://hal.archives-ouvertes.fr/hal-02860087/file/LongLivedSnapshot.pdf

Διαθεσιμότητα: https://hal.archives-ouvertes.fr/hal-02860087
https://hal.archives-ouvertes.fr/hal-02860087/document
https://hal.archives-ouvertes.fr/hal-02860087/file/LongLivedSnapshot.pdf