Zobrazeno 1 - 10
of 14
pro vyhledávání: '"David Yu Cheng Chan"'
Autor:
David Yu Cheng Chan, Philipp Woelfel
Publikováno v:
PODC
We present a tight RMR complexity lower bound for the recoverable mutual exclusion (RME) problem, defined by Golab and Ramaraju [9]. In particular, we show that any n-process RME algorithm using only atomic read, write, fetch-and-store, fetch-and-inc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17e560303fede2ef7e06be856e9d56bb
https://doi.org/10.1145/3465084.3467938
https://doi.org/10.1145/3465084.3467938
Autor:
David Yu Cheng Chan, Philipp Woelfel
Publikováno v:
PODC
Motivated by advances in non-volatile memory technology, recent research in mutual exclusion has focused on algorithms for a shared memory model, in which failed processes can recover from crashes. Golab and Ramaraju [9] defined the recoverable mutua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0dff69530801289d984700ae2b62c0f4
https://doi.org/10.1145/3382734.3405736
https://doi.org/10.1145/3382734.3405736
Publikováno v:
PODC
Since the early days of the shared memory model for distributed computing, researchers have sought a simple and precise characterization of an object's ability to implement other objects in a wait-free manner.The first candidate for such a characteri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad623ba21b4291ef2037ca4e2efbc04c
https://doi.org/10.1145/3212734.3212775
https://doi.org/10.1145/3212734.3212775
Publikováno v:
PODC
The set agreement power of a shared object O describes O’s ability to solve set agreement problems: it is the sequence $$(n_1, n_2, {\ldots }, n_k, {\ldots })$$ such that, for every $$k\ge 1$$, using O and registers one can solve the k-set agreemen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8da76180639e4e1a123d8c7ae8858cc
https://doi.org/10.1145/3087801.3087822
https://doi.org/10.1145/3087801.3087822
Publikováno v:
Theoretical Computer Science. 553:74-90
Let G be a graph with zero or more colours assigned to its vertices, and let v s and v t be two vertices of G. The minimum-colour path problem is to determine the minimum over all v s - v t paths of the number of colours used, where a colour is consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6245dde63ffd3305ed8d7ac9288b6416
https://doi.org/10.1016/j.tcs.2014.04.009
https://doi.org/10.1016/j.tcs.2014.04.009
Publikováno v:
Algorithms for Sensor Systems ISBN: 9783642360916
ALGOSENSORS
ALGOSENSORS
Let \(\mathcal{A}\) be an arrangement of n sensors constituting a barrier between two regions S and T. The resilience of \(\mathcal{A}\) with respect to S and T, denoted \(\rho (\mathcal{A},S,T)\), is defined as the number of sensors in \(\mathcal{A}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c475ba8160dbfa90e49bcba98dd9e143
https://doi.org/10.1007/978-3-642-36092-3_6
https://doi.org/10.1007/978-3-642-36092-3_6
Autor:
Chan, David Yu Cheng1 (AUTHOR), Hadzilacos, Vassos1 (AUTHOR) vassos@cs.toronto.edu, Toueg, Sam1 (AUTHOR)
Publikováno v:
Distributed Computing. Jun2020, Vol. 33 Issue 3/4, p255-277. 23p.
Publikováno v:
Synthesis Lectures on Distributed Computing Theory; 2023, preceding pvii-126, 129p
Publikováno v:
Distributed Computing (9783662534250); 2016, pI-XXIV, 24p
A recent work showed that, for all n and k, there is a linearizable (n,k)-set agreement object O_L that is equivalent to the (n,k)-set agreement task [David Yu Cheng Chan et al., 2017]: given O_L, it is possible to solve the (n,k)-set agreement task,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d37026fb9113cc0723c6abcbca62134