Lecture 2: Paging and AdWords
|
|
- Nickolas Phillips
- 5 years ago
- Views:
Transcription
1 Algoritmos e Incerteza (PUC-Rio INF2979, ) Lecture 2: Paging and AdWords March Lecturer: Marco Molinaro Scribe: Gabriel Homsi In this class we had a brief recap of the Ski Rental Problem and its applications. Then, we studied two other classical online algorithm problems: the Paging Problem and the AdWords Problem. 1 Ski Rental Problem (recap) The ski rental problem belongs to a rent-or-buy class of problems. In these problems, we have to decide between keep paying a recurring cost (rent) or finally paying a high one time cost (buy). A wide range of problems belong to this class. Next, we describe two of them. 1.1 Wait for elevator or take the stairs In this problem we have to decide between waiting for an elevator (rent) or taking the stairs (buy). The arrival time of the elevator l is unknown. The more we wait for the elevator, the more we lose time (1 unit of time per turn). We stop waiting for the elevator if we decide to take the stairs. However, if we take the stairs, we lose b units of time. 1.2 Energy states An idle computer system has two energy states: high and low energy. The system starts at the high energy state. Each turn, the system pays 1 if it resides in the high energy state and 0 if it resides in the low energy state. Transitioning from the high to the low energy state costs b. The time l that the computer system will remain idle is unknown. Therefore, the decision of when to put the system in the low energy state must be made. 2 Paging Problem In the paging problem, we have a small cache memory composed of k pages and a big main memory composed of n pages (k < n). A sequence of reads r 1,..., r m happen over time. If a page b is read at time t, two things can happen: If b is already cached, then we have a cache hit and b is read with no additional cost. Otherwise, we have a cache miss: b is copied from the main memory to the cache and is read. This has a cost of 1. 1
2 Our goal is to minimize the number of cache misses. We consider a simplification of the problem where n = k+1. An algorithm for the paging problem must decide which page to remove if the cache memory is full and an uncached page is read. One possible strategy is to remove a random cached page, other possible strategy is to remove the oldest cached page. We show that no matter the strategy, there is no online deterministic algorithm better than k-competitive. 2.1 Example We now consider an example where pages are read in the following order: 1, 2, 3, 4, 1, 2, 3, with n = 4, k = 3 and see how an online algorithm compares with the optimal solution. First, we consider the LRU online algorithm (least recently used): Whenever the cache is full, the page that LRU selects for removal is the oldest in cache. The execution of LRU is shown in Table 1. Time Cache Read Removed Cost , , 2, , 3, , 4, , 1, , 2, Table 1: LRU execution, cost = 7 Next, we show the optimal offline algorithm OP T execution for the same instance (Table 2). Time Cache Read Removed Cost , , 2, , 2, , 2, , 2, , 2, Table 2: Optimal execution, cost = 5 LRU performed worse than OPT. Next, we discuss how the cost of online algorithms compare to the cost of OPT. 2
3 2.2 Phases First, we formalize the concept of phases. An instance is a sequence of reads r 1, r 2,... r m and can be partitioned into phases as follows: the first phase p 1 is the biggest sequence of reads such that the number of pages that are different in p 1 is k. A direct implication of this definition is that a phase fits in cache. The subsequent phases p 2,... p z are defined in the same way. Take the following example: 1, 2, 3, 4, 1, 2, 3, with n = 4, k = 3. It is partitioned into phases as follows: [1, 2, 3], [4, 1, 2], [3]. The idea behind phases is that every time we switch a phase, we have a cache miss. We will analyze paging algorithms based on the maximum number of cache misses inside a phase. 2.3 Optimal offline algorithm Now we analyze the number of cache misses per phase in an optimal offline algorithm. We later use this to compare the competitiveness of online deterministic and randomized algorithms. Theorem 2.1. The optimal offline algorithm has a number of cache misses that is at least the number of phases divided by two (rounded down). Proof. Divide any instance I into a list of phases p 1, p 2,..., p z. We denote d(p) as the number of distinct pages in a sequence p. We pair up the consecutive phases without overlap (i.e. we consider only {(p 1, p 2 ), (p 3, p 4 ),...}). For any such pair (p i, p i+1 ) we have that d(p i p i+1 ) k + 1. Thus, while reading the sequence p i p i+1, at least one cache miss must happen (one of these pages will be missing in the cache in the beginning of this sequence). Since the number of these pairs of adjacent phases is # phases/2, the result follows. Actually the same argument but handling the overlaps more carefully gives that every algorithm must incur a cache miss per phase (i.e. we can consider the second read in a phase until the first read of the next phase and argue there is a miss in this interval). Theorem 2.2. The optimal offline algorithm has one cache miss per phase. 2.4 Online algorithms Now we discuss the competitiveness of online algorithms looking at the maximum number of cache misses inside a phase. Recap An algorithm Algo is α-competitive if, for every instance I, Algo(I) α OP T (I). Therefore, if an algorithm is α-competitive, then it makes at most α cache misses per phase AlgoPhases AlgoPhases is a simple online paging algorithm that removes every page in cache when a phase is over (notice that an online algorithm can indeed detect the beginning of a new phase by counting the number of distinct pages in the current phase). 3
4 Theorem 2.3. AlgoPhases is k-competitive. Proof. Consider any pair of consecutive phases p i, p i+1. By the end of p i, the cache is full. This leads AlgoPhases to empty the whole cache. As the number of pages that are different in p i+1 equals to k, AlgoPhases makes exactly k cache misses during a phase p i+1. As this is valid for any phase, Theorem 2.2 implies that AlgoPhases is k-competitive LRU Besides the simplicity of AlgoPhases, we show that LRU is no better than AlgoPhases in the worst case. Theorem 2.4. LRU is k-competitive Proof. Due to the page removal policy of LRU, if an uncached page b is read during a phase p, then b will be kept in cache until k other different pages are read. This implies that b will remain in cache until the end of p. As the number of pages that are different in p equals to k, the number of cache misses in p is at most k. Therefore, according to Theorem 2.2, LRU is k-competitive MRU Consider now the MRU online algorithm (most recently used). Whenever the cache is full, the page that MRU selects for removal is the youngest in cache. Theorem 2.5. MRU is not α-competitive for any α 1. Proof. Consider k = 2. Create an instance with an arbitrarily large phase [1, 2], [3, 2, 3, 2,..., 3, 2]. In the second phase, reading 3 will always remove 2, and reading 2 will always remove 3. Therefore, the number of cache misses inside a phase is proportional to the phase size An upper bound Our main question now is: can we do better than k-competitive? For online deterministic algorithms, the answer is no and we prove it next. Theorem 2.6. Let I be any instance made up of reads 1, 2,..., k, k + 1, in any order. The number of cache misses of the optimal offline algorithm is at most I k. Proof. Consider the longest forward distance (LFD) offline algorithm: whenever the cache is full, LFD selects a cached page p for removal if the next read for p is the farthest in the future. By the definition of LFD, all k cached pages will be read before p. Therefore, during any sequence of k requests, LFD causes at most one cache miss and the number of cache misses in I is at most I. k The same property holds for the optimal offline algorithm, as OP T (I ) LF D(I ) (note: LFD is optimal, but knowing this is not necessary for this proof). Theorem 2.7. No deterministic online algorithm is better than k-competitive 4
5 Proof. Select any deterministic online algorithm Algo. Such algorithm has a specific page removal strategy. We create an adversary instance I for Algo that causes one cache miss on every read. This is done by creating an arbitrarily long sequence requests for pages 1 through k + 1, always requesting the page that the algorithm removed on the previous iteration. Therefore, the number of cache misses by the algorithm is the length of the sequence, and from Theorem 2.6 the number of misses in this sequence by OP T is only only [length of sequence/k]. Thus, the algorithm is no better than k-competitive. 2.5 Nondeterministic online algorithm The marking algorithm (randomized 1-bit LRU) of [2] is approximately ln(k)-competitive and is the best possible α-competitive online algorithm for the paging problem. The behavior of the algorithm is sketched next. If a cache miss happens: If all pages are marked, unmark all pages. Chose an unmarked cached page randomly and remove it. Place current read page in cache, marked. Otherwise, read page with cost zero. We do not provide a formal proof for this algorithm, but the general idea is as follows: consider an instance with two phases p 1, p 2 : [1, 2,..., k][k + 1, 1, 2,..., k 1]. At the beginning of p 2, the cache is full with the elements from p 1. A cache miss happens because an uncached k + 1 must be read. As all pages in cache are marked, we unmark all of them and remove a random unmarked page. This could be any of the unmarked pages 1, 2,..., k. The probability that the first read of p 2 (k + 1) causes a cache miss is always 1 (k + 1 is not in cache). The second read (for page 1) may cause a cache miss if 1 was the page selected for removal during the previous read; as the number of unmarked pages at this point in time is k, the probability that page 1 was removed is at most 1, so this is the probability we have a miss while k reading 1. Now consider the read for 2. The probability of a miss is 1 (it was evicted while reading k k + 1 ) plus 1 1 ( 1 was evicted while reading k + 1 and 2 was evicted when reading k k ), which equals. This goes on until the number of unmarked pages is zero, leading to at k 1 most H k = ln(k) cache misses in p k k 1 k AdWords Problem A search engine receives a series of keyword searches. For each search, the engine must show a single ad. Ads belong to businesses that place bids b(k, i) between ads and keywords. Additionally, each ad has a daily budget B i. Whenever an ad i is shown on a search for keyword k, the engine 5
6 earns ˆb(k, i) = min{b(k, i), B i } and the same amount is decreased from the ad budget B i. The goal is to maximize the engine profits, given that the full list of keyword searches over time is unknown. Observation The offline version of the AdWords problem is NP-Hard, and the best known approximation algorithm is (1 1 )-competitive [1]. e 3.1 Greedy online algorithm We define a greedy algorithm as follows: whenever a new keyword k arrives, we assign it to the highest paying ad, i.e. the ad where ˆb(k, i) is maximum Example Consider an instance with two keywords k 1 and k 2 and two ads 1 and 2 with unit budgets. The relationships between keywords and ads are detailed in Table 3. Table 4 illustrates the execution of the greedy algorithm and Table 5 illustrates the execution of the optimal offline algorithm. i = 1 i = 2 k 1 b(k 1, 1) = 0.8 b(k 1, 2) = 0.7 k 2 b(k 2, 1) = 0.4 b(k 2, 2) = 0.1 Table 3: Relationships between keywords and ads Time Keyword Ad Revenue B 1 B k k Table 4: Greedy algorithm has a revenue of 1.0 Time Keyword Ad Revenue B 1 B k k Table 5: Optimal offline algorithm has a revenue of 1.1 6
7 3.1.2 Competitiveness Recap In a maximization problem, an algorithm Algo is α-competitive if, for every instance I, Algo(I) α OP T (I). The AdWords problem is a maximization problem. Theorem 3.1. The greedy algorithm is 1 2 competitive. Proof. (Local-ratio argument.) For the greedy algorithm to be 1 competitive, for any instance 2 I we need Greedy(I) 1 OP T (I), or OP T (I) 2 Greedy(I). We prove this by induction 2 on the size of the instance I. The first step of the greedy algorithm assigns for a keyword k the ad i that maximizes ˆb(i, k). Therefore, the revenue of Greedy(I) equals to ˆb(i, k) plus the revenue of the rest of the instance, named I ; more precisely, I is obtained from I by removing k and reducing B i by ˆb(i, k) units. So we need to show OP T (I) 2 (ˆb(i, k) + Greedy(I )). (1) We make the observation that reducing a budget B i to B i reduces the value of a solution by at most B i B i. As the budget of an ad was reduced by ˆb(i, k) in instance I, the cost of the optimal offline algorithm in I is bounded as follows: OP T (I ) OP T (I) ˆb(i, k) ˆb(ī, k), where ī is the ad assigned to k in OP T (I) (the last term come from the fact the keyword k was removed and so OP T may lose the value associated to the assignment it made to this keyword). Moreover, by the greedy construction, ˆb(ī, k) is at most ˆb(i, k) and so we get the lower bound OP T (I ) OP T (I) 2ˆb(i, k). (2) By induction we have OP T (I ) 2 Greedy(I ). Employing this in the bound (2) above gives the desired inequality (1), which concludes the proof. This analysis is also tight: Table 7 and Table 8 illustrate with an adversary instance why the greedy algorithm to the AdWords problem is not better than 1 competitive. There are two 2 keywords k 1 and k 2 and two ads 1 and 2 with unit budgets. The relationships between keywords and ads are detailed in Table 6. i = 1 i = 2 k 1 b(k 1, 1) = 1.0 b(k 1, 2) = 1.0 k 2 b(k 2, 1) = 1.0 ɛ b(k 2, 2) = 0.0 Table 6: Relationships between keywords and ads (ɛ is a very small number). 3.2 Better online algorithms In [4] two algorithms for the AdWords problem are proposed (based on [3]). The first is deterministic and the second is randomized. Both are (1 1 )-competitive, but this is only the case if e budgets are much larger than the bids (the proof is beyond the scope of the lecture notes). Both algorithms depend on a tradeoff function ψ(f) = 1 e (1 f) defined by [4]. 7
8 Time Keyword Ad Revenue B 1 B k k Table 7: Greedy algorithm has a revenue of 1.0. Time Keyword Ad Revenue B 1 B k ɛ 1.0 ɛ 2 k ɛ Table 8: Optimal offline algorithm has a revenue of 2.0 ɛ Deterministic algorithm Whenever a keyword k arrives, we assign it to the ad that maximizes ˆb(k, i) ψ(t (i)), where T (i) is the remaining fraction of the ad budget Randomized algorithm Randomly shuffle ads. Whenever a keyword k arrives, assign it to the ad that maximizes ˆb(k, i) ψ( r ), where r is the shuffled position of the ad i and n is the total number of ads. n References [1] N. Andelman and Y. Mansour. Auctions with Budget Constraints, pages Springer Berlin Heidelberg, Berlin, Heidelberg, [2] A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young. Competitive paging algorithms. Journal of Algorithms, 12(4): , [3] R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, STOC 90, pages , New York, NY, USA, ACM. [4] A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized on-line matching. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 05), pages , Oct
CS612 Algorithm Design and Analysis
CS612 Algorithm Design and Analysis Lecture 16. Paging problem 1 Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 The slides are made based on Algorithm Design, Randomized
More informationOnline algorithms December 13, 2007
Sanders/van Stee: Approximations- und Online-Algorithmen 1 Online algorithms December 13, 2007 Information is revealed to the algorithm in parts Algorithm needs to process each part before receiving the
More informationLecture 4: Random-order model for the k-secretary problem
Algoritmos e Incerteza PUC-Rio INF2979, 2017.1 Lecture 4: Random-order model for the k-secretary problem Lecturer: Marco Molinaro April 3 rd Scribe: Joaquim Dias Garcia In this lecture we continue with
More informationA Primal-Dual Randomized Algorithm for Weighted Paging
A Primal-Dual Randomized Algorithm for Weighted Paging Nikhil Bansal Niv Buchbinder Joseph (Seffi) Naor April 2, 2012 Abstract The study the weighted version of classic online paging problem where there
More informationthe Diffuse Adversary
Bounding the Diffuse Adversary Neal E. Young* Abstract 1.1 Results Koutsoupias and Papadimitriou recently raised the question of how well deterministic on-line paging algorithms can do against a certain
More informationAlternatives to competitive analysis Georgios D Amanatidis
Alternatives to competitive analysis Georgios D Amanatidis 1 Introduction Competitive analysis allows us to make strong theoretical statements about the performance of an algorithm without making probabilistic
More informationA lower bound for scheduling of unit jobs with immediate decision on parallel machines
A lower bound for scheduling of unit jobs with immediate decision on parallel machines Tomáš Ebenlendr Jiří Sgall Abstract Consider scheduling of unit jobs with release times and deadlines on m identical
More informationarxiv: v1 [cs.ds] 12 Oct 2015
On the Smoothness of Paging Algorithms Jan Reineke and Alejandro Salinger 2 Department of Computer Science, Saarland University, Saarbrücken, Germany reineke@cs.uni-saarland.de 2 SAP SE, Walldorf, Germany
More informationThe Relative Worst Order Ratio Applied to Paging
The Relative Worst Order Ratio Applied to Paging Joan Boyar, Lene M. Favrholdt, and Kim S. Larsen Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark, {joan,lenem,kslarsen}@imada.sdu.dk
More informationSIGACT News Online Algorithms Column 25
SIGACT News Online Algorithms Column 25 Rob van Stee University of Leicester Leicester, United Kingdom For this last column of 2014, Zhiyi Huang agreed to write about the primal-dual framework for online
More informationBudgeted Allocations in the Full-Information Setting
Budgeted Allocations in the Full-Information Setting Aravind Srinivasan 1 Dept. of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742. Abstract.
More informationScheduling Online Algorithms. Tim Nieberg
Scheduling Online Algorithms Tim Nieberg General Introduction on-line scheduling can be seen as scheduling with incomplete information at certain points, decisions have to be made without knowing the complete
More informationChapter 4. Greedy Algorithms. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 4 Greedy Algorithms Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 4.1 Interval Scheduling Interval Scheduling Interval scheduling. Job j starts at s j and
More informationTheoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem Joan Boyar, Martin R. Ehmsen, and Kim S. Larsen Department of Mathematics and Computer Science University of Southern Denmark,
More informationCS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging
CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging Tim Roughgarden January 19, 2017 1 Preamble Recall our three goals for the mathematical analysis of algorithms: the
More informationA Robust APTAS for the Classical Bin Packing Problem
A Robust APTAS for the Classical Bin Packing Problem Leah Epstein 1 and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il 2 Department of Statistics,
More informationRandomized Competitive Algorithms for Generalized Caching
Randomized Competitive Algorithms for Generalized Caching Nikhil Bansal IBM T. J. Watson Research Yorktown Heights, USA nikhil@us.ibm.com Niv Buchbinder Computer Science Dept. Technion, Haifa, Israel nivb@cs.technion.ac.il
More informationDesigning Competitive Online Algorithms via a Primal-Dual Approach. Niv Buchbinder
Designing Competitive Online Algorithms via a Primal-Dual Approach Niv Buchbinder Designing Competitive Online Algorithms via a Primal-Dual Approach Research Thesis Submitted in Partial Fulfillment of
More informationCS 580: Algorithm Design and Analysis
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Announcement: Homework 1 due soon! Due: January 25 th at midnight (Blackboard) Recap: Graphs Bipartite Graphs Definition
More information0.1 Motivating example: weighted majority algorithm
princeton univ. F 16 cos 521: Advanced Algorithm Design Lecture 8: Decision-making under total uncertainty: the multiplicative weight algorithm Lecturer: Sanjeev Arora Scribe: Sanjeev Arora (Today s notes
More informationOn-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm
On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm Christoph Ambühl and Monaldo Mastrolilli IDSIA Galleria 2, CH-6928 Manno, Switzerland October 22, 2004 Abstract We investigate
More informationI would like to thank BRICS and, in particular, Erik Meineche Schmidt for giving me the opportunity to teach this mini-course at Aarhus University. Le
BRICS Mini-Course on Competitive Online Algorithms Susanne Albers MPI, Saarbrucken Aarhus University August 27 {29, 1996 I would like to thank BRICS and, in particular, Erik Meineche Schmidt for giving
More informationA robust APTAS for the classical bin packing problem
A robust APTAS for the classical bin packing problem Leah Epstein Asaf Levin Abstract Bin packing is a well studied problem which has many applications. In this paper we design a robust APTAS for the problem.
More informationLecture 8: Decision-making under total uncertainty: the multiplicative weight algorithm. Lecturer: Sanjeev Arora
princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 8: Decision-making under total uncertainty: the multiplicative weight algorithm Lecturer: Sanjeev Arora Scribe: (Today s notes below are
More informationOnline Packet Routing on Linear Arrays and Rings
Proc. 28th ICALP, LNCS 2076, pp. 773-784, 2001 Online Packet Routing on Linear Arrays and Rings Jessen T. Havill Department of Mathematics and Computer Science Denison University Granville, OH 43023 USA
More informationarxiv: v1 [cs.ds] 30 Jun 2016
Online Packet Scheduling with Bounded Delay and Lookahead Martin Böhm 1, Marek Chrobak 2, Lukasz Jeż 3, Fei Li 4, Jiří Sgall 1, and Pavel Veselý 1 1 Computer Science Institute of Charles University, Prague,
More informationCompetitive Management of Non-Preemptive Queues with Multiple Values
Competitive Management of Non-Preemptive Queues with Multiple Values Nir Andelman and Yishay Mansour School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel Abstract. We consider the online problem
More information3 Some Generalizations of the Ski Rental Problem
CS 655 Design and Analysis of Algorithms November 6, 27 If It Looks Like the Ski Rental Problem, It Probably Has an e/(e 1)-Competitive Algorithm 1 Introduction In this lecture, we will show that Certain
More informationCSC 8301 Design & Analysis of Algorithms: Lower Bounds
CSC 8301 Design & Analysis of Algorithms: Lower Bounds Professor Henry Carter Fall 2016 Recap Iterative improvement algorithms take a feasible solution and iteratively improve it until optimized Simplex
More informationElastic Caching. Anupam Gupta Ravishankar Krishnaswamy Amit Kumar Debmalya Panigrahi. Abstract
Elastic Caching Anupam Gupta Ravishankar Krishnaswamy Amit Kumar Debmalya Panigrahi Abstract Motivated by applications in cloud computing, we study the classical online caching problem for a cache of variable
More informationOnline algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J.
Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J. Published: 01/01/007 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue
More informationAditya Bhaskara CS 5968/6968, Lecture 1: Introduction and Review 12 January 2016
Lecture 1: Introduction and Review We begin with a short introduction to the course, and logistics. We then survey some basics about approximation algorithms and probability. We also introduce some of
More informationCS 580: Algorithm Design and Analysis
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Reminder: Homework 1 due tonight at 11:59PM! Recap: Greedy Algorithms Interval Scheduling Goal: Maximize number of meeting
More informationTight Competitive Ratios for Parallel Disk Prefetching and Caching
Tight Competitive Ratios for Parallel Disk Prefetching and Caching Wing-Kai Hon Dept. of Computer Science National Tsing-Hua University wkhon@cs.nthu.edu.tw Peter J. Varman Dept. of ECE Rice University
More informationThe Parking Permit Problem
The Parking Permit Problem Adam Meyerson November 3, 2004 Abstract We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking
More informationOpen Problems in Throughput Scheduling
Open Problems in Throughput Scheduling Jiří Sgall Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Malostranské nám. 25, CZ-11800 Praha 1, Czech Republic. sgall@iuuk.mff.cuni.cz
More informationAsymptotic redundancy and prolixity
Asymptotic redundancy and prolixity Yuval Dagan, Yuval Filmus, and Shay Moran April 6, 2017 Abstract Gallager (1978) considered the worst-case redundancy of Huffman codes as the maximum probability tends
More informationCombining Shared Coin Algorithms
Combining Shared Coin Algorithms James Aspnes Hagit Attiya Keren Censor Abstract This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence
More informationOptimal Auctions with Correlated Bidders are Easy
Optimal Auctions with Correlated Bidders are Easy Shahar Dobzinski Department of Computer Science Cornell Unversity shahar@cs.cornell.edu Robert Kleinberg Department of Computer Science Cornell Unversity
More informationOn Random Sampling Auctions for Digital Goods
On Random Sampling Auctions for Digital Goods Saeed Alaei Azarakhsh Malekian Aravind Srinivasan February 8, 2009 Abstract In the context of auctions for digital goods, an interesting Random Sampling Optimal
More informationLecture 2 14 February, 2007
6.851: Advanced Data Structures Spring 2007 Prof. Erik Demaine Lecture 2 14 February, 2007 Scribes: Christopher Moh, Aditya Rathnam 1 Overview In the last lecture we covered linked lists and some results
More information2 Irani [8] recently studied special cases of this problem the Bit Model and the Fault Model (dened below) and Young [17] studied deterministic online
Page Replacement for General Caching Problems Susanne Albers Sanjeev Arora y Sanjeev Khanna z Abstract Caching (paging) is a well-studied problem in online algorithms, usually studied under the assumption
More informationOn the Competitive Ratio of the Work Function Algorithm for the k-server Problem
On the Competitive Ratio of the Work Function Algorithm for the k-server Problem Yair Bartal 1 Computer Science School, Hebrew University, Jerusalem, Israel Elias Koutsoupias 2 Department of Informatics,
More informationAlgorithms and Data Structures
Algorithms and Data Structures Amortized Analysis Ulf Leser Two Examples Two Analysis Methods Dynamic Tables SOL - Analysis This lecture is not covered in [OW93] but, for instance, in [Cor03] Ulf Leser:
More informationThe Online Metric Matching Problem for Doubling Metrics
The Online Metric Matching Problem for Doubling Metrics Anupam Gupta Kevin Lewi Abstract In the online minimum-cost metric matching problem, we are given a metric space with k servers. Requests arrive
More informationOnline Interval Coloring and Variants
Online Interval Coloring and Variants Leah Epstein 1, and Meital Levy 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il School of Computer Science, Tel-Aviv
More informationCS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves
CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves Tim Roughgarden November 5, 2014 1 Pareto Curves and a Knapsack Algorithm Our next application of smoothed analysis is
More informationSemi-Online Bipartite Matching
Semi-Online Bipartite Matching Ravi Kumar Google, Mountain View, CA, USA ravi.k53@gmail.com Manish Purohit Google, Mountain View, CA, USA mpurohit@google.com Aaron Schild University of California, Berkeley,
More informationLecture 13: Lower Bounds using the Adversary Method. 2 The Super-Basic Adversary Method [Amb02]
Quantum Computation (CMU 18-859BB, Fall 015) Lecture 13: Lower Bounds using the Adversary Method October 1, 015 Lecturer: Ryan O Donnell Scribe: Kumail Jaffer 1 Introduction There are a number of known
More informationOn the Competitive Ratio of the Random Sampling Auction
On the Competitive Ratio of the Random Sampling Auction Uriel Feige 1, Abraham Flaxman 2, Jason D. Hartline 3, and Robert Kleinberg 4 1 Microsoft Research, Redmond, WA 98052. urifeige@microsoft.com 2 Carnegie
More informationColored Bin Packing: Online Algorithms and Lower Bounds
Noname manuscript No. (will be inserted by the editor) Colored Bin Packing: Online Algorithms and Lower Bounds Martin Böhm György Dósa Leah Epstein Jiří Sgall Pavel Veselý Received: date / Accepted: date
More informationWeighted Activity Selection
Weighted Activity Selection Problem This problem is a generalization of the activity selection problem that we solvd with a greedy algorithm. Given a set of activities A = {[l, r ], [l, r ],..., [l n,
More informationAlmost Tight Bounds for Reordering Buffer Management *
Almost Tight Bounds for Reordering Buffer Management * Anna Adamaszek Artur Czumaj Matthias Englert Harald Räcke ABSTRACT We give almost tight bounds for the online reordering buffer management problem
More informationCS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality
CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality Tim Roughgarden December 3, 2014 1 Preamble This lecture closes the loop on the course s circle of
More informationCaches in WCET Analysis
Caches in WCET Analysis Jan Reineke Department of Computer Science Saarland University Saarbrücken, Germany ARTIST Summer School in Europe 2009 Autrans, France September 7-11, 2009 Jan Reineke Caches in
More informationarxiv: v1 [cs.ds] 26 Mar 2015
Analyzing Adaptive Cache Replacement Strategies Leo Shao 1, Mario E. Consuegra 2, Raju Rangaswami 1, and Giri Narasimhan 1 1 School of Computing and Information Sciences, Florida International University,
More informationToward Precise PLRU Cache Analysis
Toward Precise PLRU Cache Analysis Daniel Grund Jan Reineke 2 Saarland University, Saarbrücken, Germany 2 University of California, Berkeley, USA Workshop on Worst-Case Execution-Time Analysis 2 Outline
More informationCMSC 858F: Algorithmic Lower Bounds: Fun with Hardness Proofs Fall 2014 Introduction to Streaming Algorithms
CMSC 858F: Algorithmic Lower Bounds: Fun with Hardness Proofs Fall 2014 Introduction to Streaming Algorithms Instructor: Mohammad T. Hajiaghayi Scribe: Huijing Gong November 11, 2014 1 Overview In the
More informationRecap & Interval Scheduling
Lecture 2 Recap & Interval Scheduling Supplemental reading in CLRS: Section 6.; Section 4.4 2. Recap of Median Finding Like MERGE-SORT, the median-of-medians algorithm SELECT calls itself recursively,
More informationLecture notes for Analysis of Algorithms : Markov decision processes
Lecture notes for Analysis of Algorithms : Markov decision processes Lecturer: Thomas Dueholm Hansen June 6, 013 Abstract We give an introduction to infinite-horizon Markov decision processes (MDPs) with
More informationUncertain Prospects. How do you model this, so you can make a sensible choice?
Uncertain Prospects Suppose you have to eat at a restaurant and your choices are: chicken quiche Normally you prefer chicken to quiche, but... Now you re uncertain as to whether the chicken has salmonella.
More informationA note on semi-online machine covering
A note on semi-online machine covering Tomáš Ebenlendr 1, John Noga 2, Jiří Sgall 1, and Gerhard Woeginger 3 1 Mathematical Institute, AS CR, Žitná 25, CZ-11567 Praha 1, The Czech Republic. Email: ebik,sgall@math.cas.cz.
More informationarxiv: v2 [cs.ds] 11 Apr 2017
The (h, k)-server Problem on Bounded Depth Trees Nikhil Bansal, Marek Eliáš, Łukasz Jeż, Grigorios Koumoutsos April 12, 2017 Abstract arxiv:1608.08527v2 [cs.ds] 11 Apr 2017 We study the k-server problem
More informationDispatching Equal-length Jobs to Parallel Machines to Maximize Throughput
Dispatching Equal-length Jobs to Parallel Machines to Maximize Throughput David P. Bunde 1 and Michael H. Goldwasser 2 1 Dept. of Computer Science, Knox College email: dbunde@knox.edu 2 Dept. of Mathematics
More informationCS261: Problem Set #3
CS261: Problem Set #3 Due by 11:59 PM on Tuesday, February 23, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions:
More informationCompetitive Weighted Matching in Transversal Matroids
Competitive Weighted Matching in Transversal Matroids Nedialko B. Dimitrov C. Greg Plaxton Abstract Consider a bipartite graph with a set of left-vertices and a set of right-vertices. All the edges adjacent
More informationThe Adwords Problem with Strict Capacity Constraints
The Adwords Problem with Strict Capacity Constraints Umang Bhaskar 1, Ajil Jalal 2, and Rahul Vaze 3 1 School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India vaze@tcs.tifr.res.in
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More informationLecture 13 March 7, 2017
CS 224: Advanced Algorithms Spring 2017 Prof. Jelani Nelson Lecture 13 March 7, 2017 Scribe: Hongyao Ma Today PTAS/FPTAS/FPRAS examples PTAS: knapsack FPTAS: knapsack FPRAS: DNF counting Approximation
More informationCMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017
CMSC CMSC : Lecture Greedy Algorithms for Scheduling Tuesday, Sep 9, 0 Reading: Sects.. and. of KT. (Not covered in DPV.) Interval Scheduling: We continue our discussion of greedy algorithms with a number
More informationFebruary 10, Abstract. We deal with the problem of making capital investments in machines
On Capital Investment Yossi Azar y Yair Bartal z Esteban Feuerstein x Amos Fiat y Stefano Leonardi { Adi Rosen k February 10, 1997 Abstract We deal with the problem of making capital investments in machines
More information1 Matchings in Non-Bipartite Graphs
CS 598CSC: Combinatorial Optimization Lecture date: Feb 9, 010 Instructor: Chandra Chekuri Scribe: Matthew Yancey 1 Matchings in Non-Bipartite Graphs We discuss matching in general undirected graphs. Given
More informationLecture 6: Greedy Algorithms I
COMPSCI 330: Design and Analysis of Algorithms September 14 Lecturer: Rong Ge Lecture 6: Greedy Algorithms I Scribe: Fred Zhang 1 Overview In this lecture, we introduce a new algorithm design technique
More informationFirst Come First Served for Online Slot Allocation and Huffman Coding
Abstract First Come First Served for Online Slot Allocation and Huffman Coding Monik Khare Claire Mathieu Neal E. Young Can one choose a good Huffman code on the fly, without knowing the underlying distribution?
More informationPaging with Multiple Caches
Paging with Multiple Caches Rahul Vaze School of Technology and Computer Science Tata Institute of Fundamental Research Email: vaze@tcs.tifr.res.in Sharayu Moharir Department of Electrical Engineering
More informationONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS
ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS Richard A. Dutton and Weizhen Mao Department of Computer Science The College of William and Mary P.O. Box 795 Williamsburg, VA 2317-795, USA email: {radutt,wm}@cs.wm.edu
More informationServe or Skip: The Power of Rejection in Online Bottleneck Matching
Noname manuscript No. (will be inserted by the editor) Serve or Skip: The Power of Rejection in Online Bottleneck Matching Barbara M. Anthony Christine Chung August 3, 205 Abstract We consider the online
More informationNetwork Design and Game Theory Spring 2008 Lecture 6
Network Design and Game Theory Spring 2008 Lecture 6 Guest Lecturer: Aaron Archer Instructor: Mohammad T. Hajiaghayi Scribe: Fengming Wang March 3, 2008 1 Overview We study the Primal-dual, Lagrangian
More informationUpper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139
Upper and Lower Bounds on the Number of Faults a System Can Withstand Without Repairs Michel Goemans y Nancy Lynch z Isaac Saias x Laboratory for Computer Science Massachusetts Institute of Technology
More informationImproved On-line Broadcast Scheduling with Deadlines
Improved On-line Broadcast Scheduling with Deadlines Feifeng Zheng 1, Stanley P. Y. Fung 2, Wun-Tat Chan 3, Francis Y. L. Chin 3, Chung Keung Poon 4, and Prudence W. H. Wong 5 1 School of Management, Xi
More informationOnline Packet Buffering
Online Packet Buffering Dissertation zur Erlangung des Doktorgrades der Fakultät für Angewandte Wissenschaften der Albert-Ludwigs-Universität Freiburg im Breisgau Markus Schmidt Freiburg im Breisgau Februar
More informationOnline Scheduling of Parallel Jobs on Two Machines is 2-Competitive
Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive J.L. Hurink and J.J. Paulus University of Twente, P.O. box 217, 7500AE Enschede, The Netherlands Abstract We consider online scheduling
More informationCS264: Beyond Worst-Case Analysis Lecture #18: Smoothed Complexity and Pseudopolynomial-Time Algorithms
CS264: Beyond Worst-Case Analysis Lecture #18: Smoothed Complexity and Pseudopolynomial-Time Algorithms Tim Roughgarden March 9, 2017 1 Preamble Our first lecture on smoothed analysis sought a better theoretical
More informationOptimization under Uncertainty: An Introduction through Approximation. Kamesh Munagala
Optimization under Uncertainty: An Introduction through Approximation Kamesh Munagala Contents I Stochastic Optimization 5 1 Weakly Coupled LP Relaxations 6 1.1 A Gentle Introduction: The Maximum Value
More informationTiming analysis and timing predictability
Timing analysis and timing predictability Caches in WCET Analysis Reinhard Wilhelm 1 Jan Reineke 2 1 Saarland University, Saarbrücken, Germany 2 University of California, Berkeley, USA ArtistDesign Summer
More informationA Greedy Approximation Algorithm for Minimum-Gap Scheduling
A Greedy Approximation Algorithm for Minimum-Gap Scheduling Marek Chrobak 1, Uriel Feige 2, Mohammad Taghi Hajiaghayi 3, Sanjeev Khanna 4, Fei Li 5, and Seffi Naor 6 1 Department of Computer Science, Univ.
More informationFaculty of Computer Science, Electrical Engineering and Mathematics Algorithms and Complexity research group Jun.-Prof. Dr. Alexander Skopalik
Faculty of Computer Science, Electrical Engineering and Mathematics Algorithms and Complexity research group Jun.-Prof. Dr. Alexander Skopalik Online Algorithms Notes of the lecture SS3 by Vanessa Petrausch
More informationCS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms
CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms Tim Roughgarden November 5, 2014 1 Preamble Previous lectures on smoothed analysis sought a better
More informationAnswering Many Queries with Differential Privacy
6.889 New Developments in Cryptography May 6, 2011 Answering Many Queries with Differential Privacy Instructors: Shafi Goldwasser, Yael Kalai, Leo Reyzin, Boaz Barak, and Salil Vadhan Lecturer: Jonathan
More informationCO759: Algorithmic Game Theory Spring 2015
CO759: Algorithmic Game Theory Spring 2015 Instructor: Chaitanya Swamy Assignment 1 Due: By Jun 25, 2015 You may use anything proved in class directly. I will maintain a FAQ about the assignment on the
More informationNon-clairvoyant Scheduling for Minimizing Mean Slowdown
Non-clairvoyant Scheduling for Minimizing Mean Slowdown N. Bansal K. Dhamdhere J. Könemann A. Sinha April 2, 2003 Abstract We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant
More informationThe canadian traveller problem and its competitive analysis
J Comb Optim (2009) 18: 195 205 DOI 10.1007/s10878-008-9156-y The canadian traveller problem and its competitive analysis Yinfeng Xu Maolin Hu Bing Su Binhai Zhu Zhijun Zhu Published online: 9 April 2008
More informationK-Lists. Anindya Sen and Corrie Scalisi. June 11, University of California, Santa Cruz. Anindya Sen and Corrie Scalisi (UCSC) K-Lists 1 / 25
K-Lists Anindya Sen and Corrie Scalisi University of California, Santa Cruz June 11, 2007 Anindya Sen and Corrie Scalisi (UCSC) K-Lists 1 / 25 Outline 1 Introduction 2 Experts 3 Noise-Free Case Deterministic
More informationLecture 11 February 28, Recap of Approximate Complementary Slackness Result
CS 224: Advanced Algorithms Spring 207 Prof Jelani Nelson Lecture February 28, 207 Scribe: Meena Jagadeesan Overview In this lecture, we look at covering LPs A, b, c 0 under the setting where constraints
More informationMachine Minimization for Scheduling Jobs with Interval Constraints
Machine Minimization for Scheduling Jobs with Interval Constraints Julia Chuzhoy Sudipto Guha Sanjeev Khanna Joseph (Seffi) Naor Abstract The problem of scheduling jobs with interval constraints is a well-studied
More informationarxiv: v1 [cs.ds] 14 Dec 2017
SIAM J. COMPUT. Vol. xx, No. x, pp. x x c xxxx Society for Industrial and Applied Mathematics ONLINE SUBMODULAR WELFARE MAXIMIZATION: GREEDY BEATS 1 2 IN RANDOM ORDER NITISH KORULA, VAHAB MIRROKNI, AND
More informationAn Online Algorithm for Maximizing Submodular Functions
An Online Algorithm for Maximizing Submodular Functions Matthew Streeter December 20, 2007 CMU-CS-07-171 Daniel Golovin School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 This research
More informationCompetitive k-server Algorithms
Competitive k-server Algorithms Amos Fiat Yuval Rabani Yiftach Ravid Abstract In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server
More informationLow-Regret for Online Decision-Making
Siddhartha Banerjee and Alberto Vera November 6, 2018 1/17 Introduction Compensated Coupling Bayes Selector Conclusion Motivation 2/17 Introduction Compensated Coupling Bayes Selector Conclusion Motivation
More informationDesigning smoothing functions for improved worst-case competitive ratio in online optimization
Designing smoothing functions for improved worst-case competitive ratio in online optimization Reza Eghbali Department of Electrical Engineering University of Washington Seattle, WA 9895 eghbali@uw.edu
More information