Achiya Bar-On
Adi Shamir
Abstract
The problem of online checkpointing is a classical problem with numerous applications that has been studied in various forms for almost 50 years. In the simplest version of this problem, a user has to maintain k memorized checkpoints during a long computation, where the only allowed operation is to move one of the checkpoints from its old time to the current time, and his goal is to keep the checkpoints as evenly spread out as possible at all times.
Bringmann, Doerr, Neumann, and Sliacan studied this problem as a special case of an online/offline optimization problem in which the deviation from uniformity is measured by the natural discrepancy metric of the worst case ratio between real and ideal segment lengths. They showed this discrepancy is smaller than 1.59-o(1) for all k and smaller than ln 4-o(1)≈ 1.39 for the sparse subset of k’s, which are powers of 2. In addition, they obtained upper bounds on the achievable discrepancy for some small values of k.
In this article, we solve the main problems left open in the above-mentioned paper by proving that ln 4 is a tight upper and lower bound on the asymptotic discrepancy for all large k and by providing tight upper and lower bounds (in the form of provably optimal checkpointing algorithms, some of which are in fact better than those of Bringmann et al.) for all the small values of k ≤ 10.
In the last part of the article, we describe some new applications of this online checkpointing problem.
- Lauri Ahlroth, Olli Pottonen, and André Schumacher. 2013. Approximately uniform online checkpointing with bounded memory. Algorithmica 67, 2 (2013), 234--246.Google Scholar
Cross Ref
- M. S. Andersen, J. Dahl, and L. Vandenberghe. 2016. CVXOPT: A Python package for convex optimization. version 1.1.9. Retrieved from http://cvxopt.org.Google Scholar
- Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, and Madhu Sudan. 1994. On-line algorithms for locating checkpoints. Algorithmica 11, 1 (1994), 33--52.Google ScholarDigital Library
- Richard P. Brent. 1980. An improved Monte-Carlo factorization algorithm. BIT Numer. Math. 20, 2 (1980), 176--184.Google ScholarCross Ref
- Karl Bringmann, Benjamin Doerr, Adrian Neumann, and Jakub Sliacan. 2013. Online checkpointing with improved worst-case guarantees. In Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP’13). 255--266.Google ScholarDigital Library
- K. Mani Chandy and Chittoor V. Ramamoorthy. 1972. Rollback and recovery strategies for computer programs. IEEE Trans. Comput. 21, 6 (1972), 546--556.Google ScholarDigital Library
- Robert W. Floyd. 1997. Cycle Finding Algorithm. Exercise 3.1–6 in The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, by Donald Knuth. Addison-Wesley.Google Scholar
- Free Software Foundation. 2012. GNU Linear Programming Kit. Version 4.61. Retrieved from http://www.gnu.org/software/glpk/.Google Scholar
- Erol Gelenbe. 1979. On the optimum checkpoint interval. J. ACM 26, 2 (1979), 259--270.Google ScholarDigital Library
- Sam Toueg and Özalp Babaoglu. 1984. On the optimum checkpoint selection problem. SIAM J. Comput. 13, 3 (1984), 630--649.Google ScholarDigital Library
Index Terms
- Tight Bounds on Online Checkpointing Algorithms
Recommendations
Tight bounds for online vector bin packing
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingIn the d-dimensional bin packing problem (VBP), one is given vectors x1,x2, ... ,xn ∈ Rd and the goal is to find a partition into a minimum number of feasible sets: {1,2 ... ,n} = ∪is Bi. A set Bi is feasible if ∑j ∈ Bi xj ≤ 1, where 1 denotes the all 1'...
Tight bounds for online stable sorting
Although many authors have considered how many ternary comparisons it takes to sort a multiset S of size n, the best known upper and lower bounds still differ by a term linear in n. In this paper we restrict our attention to online stable sorting and ...
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
The online Dial-a-Ride problem is a fundamental online problem in a metric space, where transportation requests appear over time and may be served in any order by a single server with unit speed. Restricted to the real line, online Dial-a-Ride captures ...
Comments