Approximately Uniform Online Checkpointing with Bounded Memory
作者： Lauri Ahlroth , Olli Pottonen , André Schumacher
DOI: 10.1007/S00453-013-9772-5
关键词:
摘要: In many complex computational processes one may want to store a sample of the process’ history for later use by placing checkpoints. this paper we consider problem maintaining, in an online fashion, collection k checkpoints as approximately uniformly spaced continuous-time process. We present deterministic algorithms tailored small values and general arbitrary k. The are proven be close optimum several different measures.
uq.edu.au
springer.com
core.ac.uk参考文章(16)
M. Berz, Christian Bischof, George Corliss, Andreas Griewank, Computational differentiation : techniques, applications, and tools Society for Industrial and Applied Mathematics. ,(1996)
Bernard Chazelle, The Discrepancy Method: Randomness and Complexity ,(2000)
Harald Niederreiter, Lauwerens Kuipers, Uniform Distribution of Sequences ,(2006)
S. Muthukrishnan, Data Streams: Algorithms and Applications ,(2005)
Philipp Stumm, Andrea Walther, New Algorithms for Optimal Online Checkpointing SIAM Journal on Scientific Computing. ,vol. 32, pp. 836- 854 ,(2010) , 10.1137/080742439
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr, Inserting Points Uniformly at Every Instance The IEICE transactions on information and systems. ,vol. 89, pp. 2348- 2356 ,(2006) , 10.1093/IETISY/E89-D.8.2348
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, Jennifer Widom, Models and issues in data stream systems symposium on principles of database systems. pp. 1- 16 ,(2002) , 10.1145/543613.543615
A. Walther, Bounding the Number of Processors and Checkpoints Needed in Time-minimal Parallel Reversal Schedules Computing. ,vol. 73, pp. 135- 154 ,(2004) , 10.1007/S00607-004-0075-1
Harald Niederreiter, Random number generation and quasi-Monte Carlo methods ,(1992)
Tetsuo Asano, Online uniformity of integer points on a line Information Processing Letters. ,vol. 109, pp. 57- 60 ,(2008) , 10.1016/J.IPL.2008.09.008