Zobrazeno 1 - 10
of 125
pro vyhledávání: '"Seth Gilbert"'
Publikováno v:
Journal of Computer and System Sciences. 126:1-20
Autor:
Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld
Publikováno v:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Publikováno v:
PODC
In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9d91189fd1ba6fe3316eb6b4b981c6c
http://arxiv.org/abs/2105.12706
http://arxiv.org/abs/2105.12706
Publikováno v:
SPAA
In the load balancing problem, each node in a network is assigned a load, and the goal is to equally distribute the loads among the nodes, by preforming local load exchanges. While load balancing was extensively studied in static networks, only recen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1dd33625c76198e76be6fdfade9ffcb7
Publikováno v:
ICDCS
We study the cost of distributed MST construction in the setting where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links of the communication network, while capacity captures their throughput
Publikováno v:
PODC
With the rise of dynamic reconfigurable networks such as Peer-to-Peer (P2P) networks, overlay networks, ad hoc wireless and mesh networks, it has become important to construct and maintain topologies with various desirable properties (such as connect
Autor:
Faith Ellen, Seth Gilbert
Publikováno v:
SPAA
In this paper, we consider the problem of broadcast from a specified source node in a known synchronous radio network. In 2019, Ellen, Gorain, Miller and Plc showed that this is possible if each node in the network only stores 2 (carefully chosen) bi
Autor:
Seth Gilbert, Lawrence Li Er Lu
Publikováno v:
SPAA
Imagine a large graph that is being processed by a cluster of computers, e.g., described by the k-machine model or the Massively Parallel Computation Model. The graph, however, is not static; instead it is receiving a constant stream of updates. How
Publikováno v:
SPAA
In the contention-resolution problem, multiple players contend for access to a shared resource. Contention resolution is used in wireless networks, where messages must be transmitted on a shared communication channel. When two or more messages are tr