Distributed backup placement in one round and its applications to maximum matching approximation and self-stabilization
L Barenboim, G Oren - Symposium on Simplicity in Algorithms, 2020 - SIAM
In the distributed backup-placement problem [9] each node of a network has to select one
neighbor, such that the maximum number of nodes that make the same selection is …
neighbor, such that the maximum number of nodes that make the same selection is …
Improved bounds for distributed load balancing
In the load balancing problem, the input is an $ n $-vertex bipartite graph $ G=(C\cup S, E) $
and a positive weight for each client $ c\in C $. The algorithm must assign each client $ c\in …
and a positive weight for each client $ c\in C $. The algorithm must assign each client $ c\in …
Fast distributed backup placement in sparse and dense networks
L Barenboim, G Oren - Symposium on Algorithmic Principles of Computer …, 2020 - SIAM
We consider the Backup Placement problem in networks in the distributed setting. Given a
network graph G=(V, E), the goal of each vertex υ∊ V is selecting a neighbor, such that the …
network graph G=(V, E), the goal of each vertex υ∊ V is selecting a neighbor, such that the …
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method
In the weighted load balancing problem, the input is an $ n $-vertex bipartite graph between
a set of clients and a set of servers, and each client comes with some nonnegative real …
a set of clients and a set of servers, and each client comes with some nonnegative real …
Distributed backup k-placement and applications to virtual memory in wireless networks
G Oren, L Barenboim - Adjunct Proceedings of the 2021 International …, 2021 - dl.acm.org
The Backup Placement problem in networks in the distributed setting considers a network
graph G=(V, E), in which the goal of each vertex v∈ V is selecting a neighbor, such that the …
graph G=(V, E), in which the goal of each vertex v∈ V is selecting a neighbor, such that the …
Distributed and Streaming Algorithms for All-Norm Load Balancing
ZB Langley - 2024 - search.proquest.com
© 2024 Zachary Blake Langley ALL RIGHTS RESERVED. Page 1 © 2024 Zachary Blake
Langley ALL RIGHTS RESERVED. Page 2 Page 3 DISTRIBUTED AND STREAMING …
Langley ALL RIGHTS RESERVED. Page 2 Page 3 DISTRIBUTED AND STREAMING …
Distributed backup placement: for networks of bounded neighborhood independence and networks of bounded arboricity
L Barenboim, G Oren - Distributed Computing, 2022 - Springer
Abstract We consider the Backup Placement problem in networks in the CONGEST
distributed setting. Given a network graph G=(V, E), the goal of each vertex v∈ V is selecting …
distributed setting. Given a network graph G=(V, E), the goal of each vertex v∈ V is selecting …
Backup placement in wsns in the network management distributed setting
G Oren, L Barenboim - 2021 IEEE 41st International …, 2021 - ieeexplore.ieee.org
Sensor nodes are inherently a cheap piece of hardware–due to the common need to use
many of them over a large area–and usually contain a small amount of RAM and flash …
many of them over a large area–and usually contain a small amount of RAM and flash …
[PDF][PDF] Distributed Management Algorithms for Heterogeneous Computing Systems and Networks
G Oren - 2020 - researchgate.net
∨ The scientific materials included in this Thesis are products of my own research, culled
from the period during which I was a research student.∨ This Thesis incorporates research …
from the period during which I was a research student.∨ This Thesis incorporates research …
Distributed K-Backup Placement and Applications to Virtual Memory in Real-World Wireless Networks
G Oren, L Barenboim - arXiv preprint arXiv:2005.04198, 2020 - arxiv.org
The Backup Placement problem in networks in the $\mathcal {CONGEST} $ distributed
setting considers a network graph $ G=(V, E) $, in which the goal of each vertex $ v\in V $ is …
setting considers a network graph $ G=(V, E) $, in which the goal of each vertex $ v\in V $ is …