Online Balancing Two Independent Criteria

Tse, Siu‐Keung

doi:10.1007/978-3-540-88140-7_22

Cited by 3 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As these bounds are not our aim in this paper, the reader can refer to the proof of Theorem 1 in [13]. For deletion, the server, which has a document deleted, will have load and storage space decreased; however, the other servers experience a relative "increase" of load and storage space.…”

Section: Our Resultsmentioning

confidence: 98%

“…In 2006, Bilǒ et al gave another O(log M )-time online algorithm, which bounds the load and storage space by 2M −k M −k+1 L and 1 to M [3]. This result can be rewritten as t l L and t s S, which are the bounds of load and storage space, respectively [13], where t l , t s > 1 are real numbers satisfying both…”

Section: A Related Workmentioning

confidence: 96%

“…The range of t l and t s will be [2 − 1 M , M] if we make Equation (1) an equality. Below, we borrow Lemma 1 from [13].…”

Section: Definitions and Modelsmentioning

confidence: 99%

“…In reality, there is often more than one parameter needed to be balanced. For example, execution time and memory utilization are two common parameters requiring simultaneous balancing, while both parameters determine the system performance [3], [12], [13], [14]. In this paper, we address the online bicriteria load balancing problem, and the two criteria are independent.…”

Section: Introductionmentioning

confidence: 98%

“…There are some different types of approximate solutions for load balancing. A common one is to bound the load of each entity by a limit [2], [3], [5], [7], [9], [12], [13], [14], [15]. Its variant is to set the limit according to the capacity of each individual entity [4].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Rotating Escalators upon Deletions for Improving Online Bicriteria Load Balancing

Tse

2012

2012 12th International Symposium on Pervasive Systems, Algorithms and Networks

View full text Add to dashboard Cite

We study the online load balancing problem for two independent criteria upon deletion in this paper. For convenience, we choose a system of distributed homogeneous file servers located in a cluster as the scenario, and propose a solution for balancing their loads and required storage spaces for any sequence of document placements and deletions. The upper bounds of load and storage space are extremely close to the best existing online result for sole placements which do not allow reallocation and replication.Upon deleting a document from a server, other servers experience relative increases in both criteria. However, our upper bound result can tolerate a certain number of deletions. Based on this buffer, for each criterion, we construct an escalator to model the numbers of deletions that the servers can withstand before violating the upper bound. The escalator moves down upon deletion, and the servers of the lowest group, which have the least tolerance, will go through reallocation and rotate back to the highest point. As long as the escalators are valid, the upper bounds are intact.

show abstract

Section: Our Resultsmentioning

confidence: 98%

Section: A Related Workmentioning

confidence: 96%

“…The range of t l and t s will be [2 − 1 M , M] if we make Equation (1) an equality. Below, we borrow Lemma 1 from [13].…”

Section: Definitions and Modelsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Rotating Escalators upon Deletions for Improving Online Bicriteria Load Balancing

Tse

2012

2012 12th International Symposium on Pervasive Systems, Algorithms and Networks

View full text Add to dashboard Cite

show abstract

Online Balancing Two Independent Criteria upon Placements and Deletions

Tse

2013

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

On the bicriteria k -server problem

Flammini

Nicosia

2010

ACM Trans. Algorithms

View full text Add to dashboard Cite

In this article we consider multicriteria formulations of classical online problems in which an algorithm must simultaneously perform well with respect to two different cost measures. Every strategy for serving a sequence of requests is characterized by a pair of costs and therefore there can be many different minimal or optimal incomparable solutions. The adversary is assumed to choose from one of these minimal strategies and the performance of the algorithm is measured with respect to the costs the adversary pays servicing the sequence according to its determined choice of strategy. We consider a parametric family of functions which includes all the possible selections for such strategies. Then, starting from a simple general method that combines any multicriteria instance into a single-criterion one, we provide a universal multicriteria algorithm that can be applied to different online problems. In the multicriteria k-server formulation with two different edge weightings, for each function class, such a universal algorithm achieves competitive ratios that are only an O(log W ) multiplicative factor away from the corresponding determined lower bounds, where W is the maximum ratio between the two weights associated to each edge. We then extend our results to two specific functions, for which nearly optimal competitive algorithms are obtained by exploiting more knowledge of the selection properties. Finally, we show how to apply our framework to other multicriteria online problems sharing similar properties.

show abstract

Online Balancing Two Independent Criteria

Cited by 3 publications

References 10 publications

Rotating Escalators upon Deletions for Improving Online Bicriteria Load Balancing

Rotating Escalators upon Deletions for Improving Online Bicriteria Load Balancing

Online Balancing Two Independent Criteria upon Placements and Deletions

On the bicriteria k -server problem

Contact Info

Product

Resources

About