Filters








31,939 Hits in 4.0 sec

Space Bounds for Adaptive Renaming [article]

Maryam Helmi, Lisa Higham, Philipp Woelfel
2016 arXiv   pre-print
This implies a lower bound of n-c registers for long-lived (k+c)-adaptive renaming, which we observe is tight.  ...  We also prove a lower bound of 2(n - c)/c+2 registers for implementing any non-deterministic solo-terminating one-shot (k+c)-adaptive renaming.  ...  one-shot f -adaptive renaming algorithm that uses only min{n, x | f (x) ≥ 2n} + 1 registers. • A tight space lower bound of n − c registers for long-lived (k + c)-adaptive renaming for any integer constant  ... 
arXiv:1603.04067v6 fatcat:4sx5ezeqpzfpxi654zgwk4g4sa

From adaptive renaming to set agreement

Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers
2009 Theoretical Computer Science  
The adaptive M-renaming problem consists of providing processes with a new name taken from a name space whose size M depends only on the number p of processes that participate in the renaming (and not  ...  on the total number n of processes that could ask for a new name).  ...  Acknowledgments The authors would like to acknowledge the referees for their constructive comments that helped improve the presentation and the content of the paper.  ... 
doi:10.1016/j.tcs.2008.05.016 fatcat:3y5dkdhgdjhxncjniaqle2ho4i

The concurrency hierarchy, and algorithms for unbounded concurrency

Eli Gafni, Michael Merritt, Gadi Taubenfeld
2001 Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC '01  
A model in which concurrency is bounded in each run, but no bound holds for all runs, is shown to be weaker than a k-bounded model for any k.  ...  model in which concurrency is bounded by k + 1 is strictly weaker than the model in which concurrency is bounded by k, for all k > 1.  ...  The renaming problem was first solved for messagepassing systems [AB+90] , and then for shared memory systems [BD89] . There is a tight lower bound of 2k -1 for the renaming name space [HS99] .  ... 
doi:10.1145/383962.384008 dblp:conf/podc/GafniMT01 fatcat:5g7poiutiffbnaqxjfq5wwpsha

Randomized Renaming in Shared Memory Systems

Petra Berenbrink, Andre Brinkmann, Robert Elsasser, Tom Friedetzky, Lars Nagel
2015 2015 IEEE International Parallel and Distributed Processing Symposium  
Our algorithm for loose renaming maps n processes to a name space of size m = (1 + 2/(log n) ) · n = (1 + o(1)) · n performing O( · (log log n) 2 ) test-and-set operations.  ...  Please consult the full DRO policy for further details. Abstract-Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m.  ...  While there is a known matching lower bound for loose renaming, it remains open to show that the lower bound for tight renaming can be extended to the τ -register.  ... 
doi:10.1109/ipdps.2015.77 dblp:conf/ipps/BerenbrinkBEFN15 fatcat:qcwwm3wy6fdnhgrkhoizxggwd4

The renaming problem in shared memory systems: An introduction

Armando Castañeda, Sergio Rajsbaum, Michel Raynal
2011 Computer Science Review  
This paper presents an introduction to the renaming problem in shared memory systems, for non-expert readers. It describes both algorithms and lower bounds.  ...  Many algorithms for renaming and variants of renaming have been proposed, and sophisticated lower bounds have been proved, that have been a source of new ideas of general interest to distributed computing  ...  Non-adaptive renaming The lower bound for adaptive renaming may suggest that M = 2n − 1 is a lower bound for non-adaptive renaming.  ... 
doi:10.1016/j.cosrev.2011.04.001 fatcat:cqlq2dcagzcq7m65gvrheptoye

Fully-Adaptive Algorithms for Long-Lived Renaming [chapter]

Alex Brodsky, Faith Ellen, Philipp Woelfel
2006 Lecture Notes in Computer Science  
Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names.  ...  This paper presents two longlived renaming algorithms in which the name a process gets is bounded above by the number of processes currently occupying a name or performing one of these operations.  ...  Acknowledgements We are grateful to Hagit Attiya for helpful discussion.  ... 
doi:10.1007/11864219_29 fatcat:fpdajxbbdvbozblu2p6eia66km

Fully-adaptive algorithms for long-lived renaming

Alex Brodsky, Faith Ellen, Philipp Woelfel
2011 Distributed computing  
Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names.  ...  This paper presents two longlived renaming algorithms in which the name a process gets is bounded above by the number of processes currently occupying a name or performing one of these operations.  ...  Acknowledgements We are grateful to Hagit Attiya for helpful discussion.  ... 
doi:10.1007/s00446-011-0137-5 fatcat:tysokbaxhzc3tiul6phskbx5gy

Space- and Time-adaptive Nonblocking Algorithms

Maurice Herlihy, Victor Luchangco, Mark Moir
2003 Electronical Notes in Theoretical Computer Science  
We explore techniques for designing nonblocking algorithms that do not require advance knowledge of the number of threads that participate, whose time complexity and space consumption both adapt to various  ...  We also explain how our techniques can be exploited to achieve other results with similar properties, such as long-lived renaming and dynamic memory management for nonblocking data structures.  ...  Space consumption for each of the read/write-based adaptive long-lived renaming and Collect algorithms is at least cubic in N , and in some cases is exponential in N or even unbounded.  ... 
doi:10.1016/s1571-0661(04)81017-x fatcat:rrpfgg2xgzettlfx7qther3rye

The Complexity of Renaming

Dan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui
2011 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science  
We complement our individual bound with a global lower bound of Ω(k log(k/c)) on the total step complexity of renaming into a namespace of size ck, for any c ≥ 1.  ...  We prove an individual lower bound of Ω(k) process steps for deterministic renaming into any namespace of size sub-exponential in k, where k is the number of participants.  ...  ACKNOWLEDGEMENTS The authors would like to thank Hagit Attiya and Keren Censor-Hillel for discussions and feedback on earlier versions of this paper, and the anonymous reviewers for their very useful suggestions  ... 
doi:10.1109/focs.2011.66 dblp:conf/focs/AlistarhAGG11 fatcat:y3wlivhgsne2xolrxf3gtnrvwu

Randomized loose renaming ino(log logn) time

Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel
2013 Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13  
We complement the algorithms with an Ω(log log n) expected time lower bound on the complexity of randomized renaming using test-and-set operations and linear space.  ...  We also present a variant of the adaptive algorithm which requires O(k log log k) total process steps. All upper bounds hold with high probability against a strong adaptive adversary.  ...  Our lower bound is the first to apply to non-adaptive randomized renaming, and exhibits a new trade-off between space and expected running time for this problem.  ... 
doi:10.1145/2484239.2484240 dblp:conf/podc/AlistarhAGW13 fatcat:cxablzpxlvbxzo5b7n5vmmontu

Locks Considered Harmful: A Look at Non-traditional Synchronization [chapter]

Michel Raynal
2008 Lecture Notes in Computer Science  
Then, considering the adaptive renaming problem as a paradigm of coordination and synchronization problems, the paper investigates wait-free implementations of an adaptive renaming object (wait-free means  ...  An algorithm providing such an optimal renaming space is described.  ...  Adaptive renaming as a paradigm for non-traditional synchronization.  ... 
doi:10.1007/978-3-540-87785-1_33 fatcat:5334i7ywwbfxxafa3lzgi74she

Tight Bounds for Asynchronous Renaming

Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui
2014 Journal of the ACM  
We complement this individual bound with a global lower bound of (k log(k/c)) on the total step complexity of renaming into a namespace of size ck, for any c ≥ 1.  ...  We first prove an individual lower bound of (k) process steps for deterministic renaming into any namespace of size subexponential in k, where k is the number of participants.  ...  We first prove the lower bound for adaptive deterministic renaming, and then extend it to nonadaptive renaming by reduction.  ... 
doi:10.1145/2597630 fatcat:gt7j4fblafgwlmghg7psymbhfi

Optimal-time adaptive strong renaming, with applications to counting

Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
We give two new randomized algorithms for strong renaming, both of which work against an adaptive adversary in asynchronous shared memory.  ...  We show this to be optimal based on a classic lower bound of Jayanti.  ...  We would also like to thank the anonymous reviewers for many useful comments.  ... 
doi:10.1145/1993806.1993850 dblp:conf/podc/AlistarhACGZ11 fatcat:llann4tsvfeq7dfwza7fkaiccq

Brief Announcement

Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio instituto de Matemáticas Rajsbaum, Matthieu Roy
2016 Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16  
A typical example of an adaptive task is adaptive renaming [3] : processes acquire distinct output names in the space [1, r] , where r depends only on the number k of participating processes.  ...  A quite intriguing fact is that the wait-free algorithm derived from an adaptation of an optimal algorithm for classical renaming run on a maximum independent set of Cn does not match the lower bound,  ... 
doi:10.1145/2933057.2933081 dblp:conf/podc/CastanedaFGRR16 fatcat:lowpsu3xmbe4nipau3i5vsljjq

Waiting in Concurrent Algorithms [chapter]

Gadi Taubenfeld
2016 Lecture Notes in Computer Science  
To illustrate the utility of the new conditions, they are used to derive new lower and upper bounds, and impossibility results for well-known basic problems such as consensus, election, renaming and mutual  ...  New progress conditions, called k-waiting, for k ≥ 0, which are intended to capture the "amount of waiting" of processes in asynchronous concurrent algorithms, are introduced.  ...  Is the upper bound of Theorem 5, on the name space for k-waiting starvation-free adaptive renaming, tight? It would also be interesting to look at various variants of k-waiting.  ... 
doi:10.1007/978-3-319-46140-3_29 fatcat:ioimbkv7wnez3hudfrndqwr7zy
« Previous Showing results 1 — 15 out of 31,939 results