Efficient, strongly consistent implementations of shared memory (English)
National licence
Extended abstract
- New search for: Mavronicolas, Marios
- New search for: Roth, Dan
- New search for: Mavronicolas, Marios
- New search for: Roth, Dan
In:
Distributed Algorithms
;
346-361
;
1992
- Article/Chapter (Book) / Electronic Resource
-
Title:Efficient, strongly consistent implementations of shared memory
-
Subtitle:Extended abstract
-
Contributors:Mavronicolas, Marios ( author ) / Roth, Dan ( author )
-
Published in:Distributed Algorithms ; 346-361Lecture Notes in Computer Science ; 647 ; 346-361
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1992-01-01
-
Size:16 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Sparser: A paradigm for running distributed algorithmsAfek, Yehuda / Ricklin, Moty et al. | 1992
- 11
-
Closed schedulers: Constructions and applications to consensus protocolsLubitch, Ronit / Moran, Shlomo et al. | 1992
- 35
-
Efficient atomic snapshots using lattice agreementAttiya, Hagit / Herlihy, Maurice / Rachman, Ophir et al. | 1992
- 54
-
Choice coordination with multiple alternatives (preliminary version)Greenberg, David S. / Taubenfeld, Gadi / Wang, Da-Wei et al. | 1992
- 69
-
Some results on the impossibility, universality, and decidability of consensusJayanti, Prasad / Toueg, Sam et al. | 1992
- 85
-
Wait-free test-and-setAfek, Yehuda / Gafni, Eli / Tromp, John / Vitanyi, Paul M. B. et al. | 1992
- 95
-
A concurrent time-stamp scheme which is linear in time and spaceIsraeli, Amos / Pinhasov, Meir et al. | 1992
- 110
-
Tentative and definite distributed computations: An optimistic approach to network synchronizationGarofalakis, J. / Rajsbaum, S. / Spirakis, P. / Tampakas, B. et al. | 1992
- 120
-
Semisynchrony and real timePonzio, Stephen / Strong, Ray et al. | 1992
- 136
-
Optimal time Byzantine agreement for t < n/8 with linear messagesZamsky, Arkady / Israeli, Amos / Pinter, Shlomit S. et al. | 1992
- 153
-
A continuum of failure models for distributed computingGaray, Juan A. / Perry, Kenneth J. et al. | 1992
- 166
-
Simulating crash failures with many faulty processors (extended abstract)Bazzi, Rida / Neiger, Gil et al. | 1992
- 185
-
An efficient topology update protocol for dynamic networksAwerbuch, Baruch / Mansour, Yishay et al. | 1992
- 203
-
Memory adaptive self-stabilizing protocols (extended abstract)Anagnostou, Efthymios / El-Yaniv, Ran / Hadzilacos, Vassos et al. | 1992
- 221
-
Optimal early stopping in distributed consensusBerman, Piotr / Garay, Juan A. / Perry, Kenneth J. et al. | 1992
- 238
-
Traffic-light scheduling on the gridKortsarz, Guy / Peleg, David et al. | 1992
- 253
-
Distributed computing on anonymous hypercubes with faulty componentsKranakis, Evangelos / Santoro, Nicola et al. | 1992
- 264
-
Message terminate algorithms for anonymous rings of unknown sizeCidon, Israel / Shavitt, Yuval et al. | 1992
- 277
-
Distributed resource allocation algorithmsBar-Ilan, Judit / Peleg, David et al. | 1992
- 292
-
Membership algorithms for multicast communication groupsAmir, Yair / Dolev, Danny / Kramer, Shlomo / Malki, Dalia et al. | 1992
- 313
-
The granularity of waiting (extended Abstract)Anderson, James H. / Yang, Jae-Heon / Gouda, Mohamed G. et al. | 1992
- 329
-
The cost of order in asynchronous systemsRicciardi, Aleta / Birman, Kenneth / Stephenson, Patrick et al. | 1992
- 346
-
Efficient, strongly consistent implementations of shared memoryMavronicolas, Marios / Roth, Dan et al. | 1992
- 362
-
Optimal primary-backup protocolsBudhiraja, Navin / Marzullo, Keith / Schneider, Fred B. / Toueg, Sam et al. | 1992