Filters

51,395 Hits in 5.1 sec

### Online Balancing Two Independent Criteria [chapter]

Savio S. H. Tse
2008 Lecture Notes in Computer Science
We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing their loads and required storage spaces.  ...  The second algorithm bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively; and more importantly, for each server, the value of at least  ...  If succeed, it will then an important step towards the asymptotic latest known upper bound of 1.9201 [7] and the lower bound of 1.88 [13] for balancing a single parameter.  ...

### Deterministic load balancing for parallel joins

2016 Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond - BeyondMR '16
We first present some general lower bounds on the load for any dimension; these bounds depend not only on the size of the relation, but also on the maximum frequency of each value in the relation.  ...  We then construct an algorithm for the case of 1 dimension that is optimal within a constant factor, and an algorithm for the case of 2 dimensions that is optimal within a polylogarithmic factor.  ...  AN ALGORITHM FOR 2 DIMENSIONS In this section, we present a deterministic algorithm, which we call 2-Balance, that constructs a distribution strategy that approximates the optimal lower bound within a  ...

### Server Optimization Using Heuristic Algorithms for Dynamic-Split-and-Merge Scheme in Wireless Multicast

R. Sukumar, V. Vasudevan
2009 Journal of Computer Science
As the underlying traffic fluctuates, a split and merge scheme is implemented in a physical server to achieve load balancing.  ...  Approach: Minimizing the number of servers during the merge operation is NP hard and to achieve these two algorithms namely FFD bin packing algorithm and LL algorithm were proposed to find the near optimal  ...  The lower bound for the CPU is LB c Function LB ({s 1 ,.....s n }) returns the larger integer of the two lower bounds [CT01].  ...

### Online bottleneck matching

Barbara M. Anthony, Christine Chung
2012 Journal of combinatorial optimization
Because no algorithm can have a competitive ratio better than O(k) for this problem, we use resource augmentation analysis to examine the performance of three algorithms: the naive GREEDY algorithm, PERMUTATION  ...  The competitive ratio of BALANCE is also linear with an extra server at each server-vertex, even though it has been shown that an extra server makes it constant-competitive for the min-weight matching  ...  We begin with a lower bound on the halfOPT-competitive ratio of BALANCE.  ...

### Online Bottleneck Matching [chapter]

Barbara M. Anthony, Christine Chung
2012 Lecture Notes in Computer Science
Because no algorithm can have a competitive ratio better than O(k) for this problem, we use resource augmentation analysis to examine the performance of three algorithms: the naive GREEDY algorithm, PERMUTATION  ...  The competitive ratio of BALANCE is also linear with an extra server at each server-vertex, even though it has been shown that an extra server makes it constant-competitive for the min-weight matching  ...  We begin with a lower bound on the halfOPT-competitive ratio of BALANCE.  ...

### More on Weighted Servers or Fifo is Better than Lru [chapter]

Leah Epstein, Csanád Imreh, Rob van Stee
2002 Lecture Notes in Computer Science
We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the best possible trackless algorithm up to a constant factor for any cost ratio.  ...  The results are extended for the case where we have two sets of servers with di erent costs.  ...  Lower bounds for trackless algorithms In this part, we prove a lower bound for trackless algorithms which is linear in Äw. First, we prove the lower bound for the case Ä = 1, and then for general Ä.  ...

Yossi Azar, Andrei Z. Broder, Anna R. Karlin
1994 Theoretical Computer Science
In this paper we derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely, [(3n)*"/2](1 + o(l)), and derive a lower bound, Q@r/*), for any  ...  Karlin, On-line load balancing, Theoretical Computer Science 130 (1994) 73-84. The setup for our problem consists of n servers that must complete a set of tasks.  ...  E For a general deterministic algorithm, we can simplify this proof and obtain a lower bound of [a].  ...

### More on weighted servers or FIFO is better than LRU

Leah Epstein, Csanád Imreh, Rob van Stee
2003 Theoretical Computer Science
We present a general lower bound for trackless algorithms depending on the cost ratio, proving that our algorithm is the best possible trackless algorithm up to a constant factor for any cost ratio.  ...  The results are extended for the case where we have two sets of servers with di erent costs.  ...  Lower bounds for trackless algorithms In this part, we prove a lower bound for trackless algorithms which is linear in Äw. First, we prove the lower bound for the case Ä = 1, and then for general Ä.  ...

Y. Azar, A.Z. Broder, A.R. Karlin
1992 Proceedings., 33rd Annual Symposium on Foundations of Computer Science
In this paper we derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely, [(3n)*"/2](1 + o(l)), and derive a lower bound, Q@r/*), for any  ...  Karlin, On-line load balancing, Theoretical Computer Science 130 (1994) 73-84. The setup for our problem consists of n servers that must complete a set of tasks.  ...  E For a general deterministic algorithm, we can simplify this proof and obtain a lower bound of [a].  ...

Yossi Azar
1998 Lecture Notes in Computer Science
In this paper we derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely, [(3n)*"/2](1 + o(l)), and derive a lower bound, Q@r/*), for any  ...  Karlin, On-line load balancing, Theoretical Computer Science 130 (1994) 73-84. The setup for our problem consists of n servers that must complete a set of tasks.  ...  E For a general deterministic algorithm, we can simplify this proof and obtain a lower bound of [a].  ...

### On the remote server problem or more about TCP acknowledgments

Leah Epstein, Alex Kesselman
2006 Theoretical Computer Science
For the on-line version of the Remote Server Problem (RSP), we present algorithms for the general case and for a special casef of two customers that achieve competitive ratios of exactly 4 and 3, respectively  ...  For the off-line version of the RSP, we derive an optimal algorithm with a polynomial running time for a constant number of customers.  ...  Acknowledgments We would like to thank two anonymous referees for many helpful suggestions.  ...

### Dimensioning server access bandwidth and multicast routing in overlay networks

Sherlia Y. Shi, Jonathan S. Turner, Marcel Waldvogel
2001 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video - NOSSDAV '01
We present these differences and formulate them as a network design problem consisting of two parts: one is bandwidth assignment in the overlay network, the other is load-balancing multicast routing with  ...  Application-level multicast is a new mechanism for enabling multicast in the Internet.  ...  Although this lower bound is not very tight, it gives an indication of the best achievable utilization for any routing algorithm.  ...

### Page 2937 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews
“We give an O(,/loglog NV)-competitive algorithm for on-line scheduling on a two-dimensional mesh of N processors and we prove a matching lower bound of Q(,/loglog N) on the competitive ratio.  ...  If the servers are limited to having one of two possible weights then there exist two such weights such that the competitive ratio has a lower bound of 2%“).  ...

### Tight Bounds for Selfish and Greedy Load Balancing

Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
2010 Algorithmica
We study the load balancing problem in the context of a set of clients each wishing to run a job on a server selected among a subset of permissible servers for the particular client.  ...  of selfish load balancing as well as on the competitiveness of the greedy algorithm for online load balancing when the objective is to minimize the total latency of all clients on servers with linear latency  ...  For selfish load balancing of weighted clients on identical servers, we can show a lower bound of 5/2 on the price of anarchy.  ...

### Tight Bounds for Selfish and Greedy Load Balancing [chapter]

Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
2006 Lecture Notes in Computer Science
We study the load balancing problem in the context of a set of clients each wishing to run a job on a server selected among a subset of permissible servers for the particular client.  ...  of selfish load balancing as well as on the competitiveness of the greedy algorithm for online load balancing when the objective is to minimize the total latency of all clients on servers with linear latency  ...  For selfish load balancing of weighted clients on identical servers, we can show a lower bound of 5/2 on the price of anarchy.  ...
« Previous Showing results 1 — 15 out of 51,395 results