Filter your results
- 28
- 20
- 22
- 18
- 5
- 2
- 1
- 18
- 38
- 2
- 3
- 1
- 5
- 2
- 1
- 3
- 10
- 9
- 8
- 4
- 47
- 1
- 47
- 47
- 8
- 6
- 5
- 4
- 4
- 3
- 1
- 1
- 1
- 1
- 48
- 37
- 6
- 5
- 5
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
48 Results
|
|
sorted by
|
|
Visiting Gafni's Reduction Land: from the BG Simulation to the Extended BG Simulation[Research Report] PI 1931, 2009, pp.12
Reports
inria-00389682v1
|
||
On Asymmetric Progress Conditions29th ACM Symposium on Principles of Distributed Computing (PODC'10), Jul 2010, Zurich, Switzerland. pp.55-64
Conference papers
inria-00543131v1
|
|||
|
On Asymmetric Progress Conditions[Research Report] PI-1952, 2010, pp.15
Reports
inria-00486977v1
|
||
|
Calculabilité et conditions de progression des objets partagés en présence de défaillancesCalcul parallèle, distribué et partagé [cs.DC]. Université Rennes 1, 2012. Français. ⟨NNT : ⟩
Theses
tel-00722855v1
|
||
|
A Lock-based Protocol for Software Transactional Memory[Research Report] PI 1893, 2008, pp.26
Reports
inria-00277378v1
|
||
|
Generalized Symmetry Breaking Tasks2013
Preprints, Working Papers, ...
hal-00862230v2
|
||
On Adaptive Renaming under Eventually Limited ContentionProc. 12th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), 2010, New York, United States. pp.377-387
Conference papers
inria-00543135v1
|
|||
|
A Simple Snapshot Algorithm for Multicore Systems[Research Report] PI 1955, 2010
Reports
inria-00505233v1
|
||
|
Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort[Research Report] PI 1894, 2008, pp.20
Reports
inria-00281550v1
|
||
Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible11th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP'11), 2011, Melbourne, Australia. pp.244-257
Conference papers
hal-00646902v1
|
|||
Software transactional memories: an approach for multicore programmingJournal of Supercomputing, 2011, 57 (2), pp.203-215
Journal articles
hal-00646909v1
|
|||
Help when needed, but no more: Efficient read/write partial snapshotJournal of Parallel and Distributed Computing, 2012, 72 (1), pp.1-12. ⟨10.1016/j.jpdc.2011.08.005⟩
Journal articles
istex
hal-00646906v1
|
|||
|
Which Broadcast Abstraction Captures $k$-Set Agreement?2017
Preprints, Working Papers, ...
hal-01660664v1
|
||
|
Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems[Research Report] PI-2018, 2014
Reports
hal-00993400v1
|
||
|
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version)[Research Report] IRISA, Inria Rennes; LS2N-University of Nantes; Technion - Israel Institute of Technology. 2017
Reports
hal-01476201v1
|
||
|
Which Broadcast Abstraction Captures k-Set Agreement?31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria. pp.1-16, ⟨10.4230/LIPIcs.DISC.2017.27⟩
Conference papers
hal-01787801v1
|
||
|
The x-Wait-freedom Progress Condition[Research Report] PI 1944, 2010, pp.11
Reports
inria-00454386v1
|
||
|
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), Nov 2009, lyon, France. ⟨10.1007/978-3-642-05118-0_26⟩
Conference papers
inria-00440398v1
|
||
|
From Bezout's Identity to Space-Optimal Election in Anonymous Memory SystemsPODC '20 - ACM 39th Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, Italy. pp.41-50, ⟨10.1145/3382734.3405727⟩
Conference papers
hal-03148627v1
|
||
|
Read invisibility, virtual world consistency and permissiveness are compatible[Research Report] PI-1958, 2010, pp.21
Reports
inria-00533620v1
|
||
|
The Multiplicative Power of Consensus Numbers[Research Report] PI 1949, 2010, pp.17
Reports
inria-00454399v2
|
||
|
The Universe of Symmetry Breaking Tasks[Research Report] PI-1965, 2011, pp.16
Reports
inria-00560453v1
|
||
A Simple Snapshot Algorithm for Multicore Systems5th Latin-American Symposium on Dependable Computing (LADC'11), 2011, São José dos Campos, Brazil. pp.17-24
Conference papers
hal-00646903v1
|
|||
Towards a universal construction for transaction-based multiprocess programs13th International Conference on Distributed Computing and Networking (ICDCN'12), 2012, Hong Kong, Hong Kong SAR China
Conference papers
hal-00646911v1
|
|||
|
Enriching the reduction map of sub-consensus tasks[Research Report] PI-1976, 2011, pp.14
Reports
inria-00591526v1
|
||
Help when needed, but no more: Efficient Read/Write Partial Snapshot23rd International Symposium on Distributed Computing (DISC'09), Sep 2009, Elche, Spain. ⟨10.1007/978-3-642-04355-0_16⟩
Conference papers
istex
inria-00440392v1
|
|||
Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early AbortInternational Conference on Distributed Computing and Networking (ICDCN'09), Jan 2009, Hyderabad, India. ⟨10.1007/978-3-540-92295-7_11⟩
Conference papers
istex
inria-00440361v1
|
|||
|
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits[Research Report] LIF, Université Aix-Marseille; LINA-University of Nantes; IMDEA Software Institute; Institut Universitaire de France; IRISA, Université de Rennes. 2017
Reports
hal-01540010v1
|
||
|
The weakest failure detector to implement a register in asynchronous systems with hybrid communication[Research Report] PI-1972, 2011, pp.11
Reports
inria-00583155v1
|
||
The x-Wait-freedom Progress ConditionProc. 16th Int'l European Parallel Computing Conference (EUROPAR'10), 2010, Ischia - Naples, Italy. pp.584-595
Conference papers
inria-00543134v1
|
- 1
- 2