首页/论文/1908.09135

arXiv 1908.091352019-08-24cs.DS

Subadditive Load Balancing

Kiyohito Nagano, Akihiro Kishimoto

备注：: 17 pages, 3 figures

英文摘要：

Set function optimization is essential in AI and machine learning. We focus on a subadditive set function that generalizes submodularity, and examine the subadditivity of non-submodular functions. We also deal with a minimax subadditive load balancing problem, and present a modularization-minimization algorithm that theoretically guarantees a worst-case approximation factor. In addition, we give a lower bound computation technique for the problem. We apply these methods to the multi-robot routing problem for an empirical performance evaluation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Simpler and Better Algorithms for Minimum-Norm Load Balancing

Recently, Chakrabarty and Swamy (STOC 2019) introduced the {\em minimum-norm load-balancing} problem on unrelated machines, wherein we are given a set $J$ of jobs that need to be scheduled on a set of $m$ unrelated machines, and a monotone, symmetric norm; We seek an assignment $\sg:J\mapsto[m]$ that minimizes the norm of the resulting load vector $\lvec_\sg\in\R_+^m$, where $\lvec_\sg(i)$ is the load on machine $i$ under the assignment $\sg$. Besides capturing all $\ell_p$ norms, symmetric norms also capture other norms of interest including top-$\ell$ norms, and ordered norms. Chakrabarty an…

2019-04-30cs.DS

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 weight. The output is an assignment that maps each client to one of its adjacent servers, and the load of a server is then the sum of the weights of the clients assigned to it. The goal is to find an assignment that is well-balanced, typically captured by (approximately) minimizing either the $\ell_\infty$- or $\ell_2$-norm of the server loads. Generalizing both of these objectives, the all-norm load balancing problem…

2023-01-17cs.DS

Configuration Balancing for Stochastic Requests

The configuration balancing problem with stochastic requests generalizes many well-studied resource allocation problems such as load balancing and virtual circuit routing. In it, we have $m$ resources and $n$ requests. Each request has multiple possible configurations, each of which increases the load of each resource by some amount. The goal is to select one configuration for each request to minimize the makespan: the load of the most-loaded resource. In our work, we focus on a stochastic setting, where we only know the distribution for how each configuration increases the resource loads, lea…

2022-08-29cs.DS

A unified framework for designing EPTAS's for load balancing on parallel machines

We consider a general load balancing problem on parallel machines. Our machine environment in particular generalizes the standard models of identical machines, and the model of uniformly related machines, as well as machines with a constant number of types, and machines with activation costs. The objective functions that we consider contain in particular the makespan objective and the minimization of the $\ell_p$-norm of the vector of loads of the machines both with possibly job rejection. We consider this general model and design an efficient polynomial time approximation scheme (EPTAS) that …

2018-02-27cs.DS

Improved Analysis of Deterministic Load-Balancing Schemes

We consider the problem of deterministic load balancing of tokens in the discrete model. A set of $n$ processors is connected into a $d$-regular undirected network. In every time step, each processor exchanges some of its tokens with each of its neighbors in the network. The goal is to minimize the discrepancy between the number of tokens on the most-loaded and the least-loaded processor as quickly as possible. Rabani et al. (1998) present a general technique for the analysis of a wide class of discrete load balancing algorithms. Their approach is to characterize the deviation between the actu…

2015-02-22cs.DS

通过匹配承包商实现负载均衡的流式与通信复杂度

Streaming and Communication Complexity of Load-Balancing via Matching Contractors

本文研究单向通信模型下的负载均衡问题，证明其通信复杂度等价于负载均衡稀疏化问题，并引入新极值图族Matching-Contractors建立图论刻画；进一步通过组合构造得到强通信下界，排除单遍半流式算法获得n^{1/4-o(1)}近似比。

2024-10-21cs.DS

更多相关论文收起更多论文

GPU Load Balancing

Fine-grained workload and resource balancing is the key to high performance for regular and irregular computations on the GPUs. In this dissertation, we conduct an extensive survey of existing load-balancing techniques to build an abstraction that addresses the difficulty of scheduling computations on the GPU. We propose a GPU fine-grained load-balancing abstraction that decouples load balancing from work processing and aims to support both static and dynamic schedules with a programmable interface to implement new load-balancing schedules. Prior to our work, the only way to unleash the GPU's …

2022-12-17cs.DCcs.DS

Dynamic Averaging Load Balancing on Arbitrary Graphs

In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to randomly chosen nodes. A matching is chosen, and the load is averaged over the edges of that matching. We analyze the discrete case where load items are indivisible, moreover our results also carry over to the continuous case where load items can be split arbitrarily. For the choice of the matchings we consider three different models, random matchings of linear size, random matchings containing only single edges, and dete…

2023-02-23cs.DCcs.DSmath.PR

Randomized Load Balancing on Networks with Stochastic Inputs

Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past. Complementing previous worst-case analyses, we study an average-case scenario where the load inputs are drawn from a fixed probability distribution. For cycles, tori, hypercubes and expanders, we obtain almost matching upper and lower bounds on the discrepancy, the difference between the maximum and the minimum load. Our bounds hold for a variety of probability distributions including the uniform and binomial distribution but also distributions with unbounded range such as the Poisson and geom…

2017-03-25cs.DCcs.DS

Benchmarking Hashing Algorithms for Load Balancing in a Distributed Database Environment

Modern high load applications store data using multiple database instances. Such an architecture requires data consistency, and it is important to ensure even distribution of data among nodes. Load balancing is used to achieve these goals. Hashing is the backbone of virtually all load balancing systems. Since the introduction of classic Consistent Hashing, many algorithms have been devised for this purpose. One of the purposes of the load balancer is to ensure storage cluster scalability. It is crucial for the performance of the whole system to transfer as few data records as possible during n…

2022-11-01cs.DBcs.DCcs.DS

智能电网中高光伏渗透率下的最优网载平衡

Optimal Net-Load Balancing in Smart Grids with High PV Penetration

University of Southern California（南加州大学）；US Army Research Lab（美国陆军研究实验室）

本文提出一种统一的最优网载平衡框架，结合负载和太阳能削减，解决高光伏渗透率下供需不匹配问题，通过近似算法和公平性机制实现高效平衡。

2018-04-03cs.DScs.SYeess.SY

Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies

We consider the problem of balancing load items (tokens) in networks. Starting with an arbitrary load distribution, we allow nodes to exchange tokens with their neighbors in each round. The goal is to achieve a distribution where all nodes have nearly the same number of tokens. For the continuous case where tokens are arbitrarily divisible, most load balancing schemes correspond to Markov chains, whose convergence is fairly well-understood in terms of their spectral gap. However, in many applications, load items cannot be divided arbitrarily, and we need to deal with the discrete case where th…

2014-11-10cs.DCcs.DMcs.DS

Coded Load Balancing in Cache Networks

We consider load balancing problem in a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Previously proposed load balancing solutions cannot perfectly balance out requests among servers, which is a critical issue in practical networks. Therefore, in this paper, we investigate a coded cache content placement where coded chunks of original files are stored in servers based on the files popularity distribution. In our scheme, upon each request arrival at the delivery phase, by dispatching enough coded chunks to the request origin from the neares…

2019-08-04cs.DScs.ITcs.NI

Storage, Communication, and Load Balancing Trade-off in Distributed Cache Networks

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems. In this framework, we investigate the tension between storage resources, communication cost, and load balancing performance. To this end, we propose a randomized load balancing scheme which simultaneously considers cache size limitation and proximity in the server redirection process. In contrast to the classical power of two choices setup, since the memory limitation and the p…

2017-06-30cs.DCcs.DScs.IT