Analysis and algorithms for restart

Proceedings - First International Conference on the Quantitative Evaluation of Systems, QEST 2004

Volumn , Issue , 2004, Pages 195-204

  Van Moorsel, Aad P A ^a   Woher, Katinka ^b  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETION TIME; INTERNET USER EXPERIENCES; MONOTONICITY; RESTART POLICY;

ALGORITHMS; INFORMATION RETRIEVAL; PROBABILITY DISTRIBUTIONS; QUERY LANGUAGES; THEOREM PROVING; WEB BROWSERS; WEBSITES;

INTERNET;

EID: 11244298788     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2004.1348034     Document Type: Conference Paper

References (16)

1. H. Alt, L. Guibas, K. Mehlhorn, R. Karp and A. Wigderson, A Method for Obtaining Randomized Algorithms with Small Tail Probabilities, Algorithmica, Vol. 16, Nr. 4/5, pp. 543-547, 1996.
2. A. Bobbio, A. Puliafito, M. Telek and K. Trivedi, "Recent Developments in Non-Markovian Stochastic Petri Nets," Journal of Systems Circuits and Computers, 8(1):119-158, 1998.
3. A. Bobbio, S. Garg, M. Gribaudo, A. Horvath, M. Sereno and M. Telek, "Modeling Software Systems with Rejuvenation, Restoration and Checkpointing through Fluid Stochastic Petri Nets," in Proceedings of PNPM '99, Zaragoza, Spain, pp. 82-91, IEEE CS Press, Sept 1999.
4. P. Chalasani, S. Jha, O. Shehory and K. Sycara, "Query Restart Strategies for Web Agents," in Proceedings of Agents98, AAAI Press, 1998.
5. W. Chen, S. Toueg and M. K. Aguilera, "On the Quality of Service of Failure Detectors," in Proceedings of the International Conference on Dependable Systems and Networks (DSN 2000), pp. 191-200, 2000.
6. S. Garg, Y. Huang, C. Kintala and K. S. Trivedi, "Minimizing Completion Time of a Program by Checkpointing and Rejuvenation," ACM SIGMETRICS 1996, May 1996.
7. I. Gertsbakh, Reliability Theory, With Applications to Preventive Maintenance, Springer Verlag, Berlin, 2000.
8. B. Haverkort, Performance of Computer Communication Systems: A Model-Based Approach, John Wiley, Chichester, 1999.
9. B. Krishnamurthy and J. Rexford, Web Protocols and Practice, Addison Wesley, 2001.
10. M. Luby, A. Sinclair and D. Zuckerman, "Optimal Speedup of Las Vegas Algorithms," Israel Symposium on Theory of Computing Systems, pp. 128-133, 1993.
11. S. M. Maurer and B. A. Huberman, "Restart strategies and Internet congestion," in Journal of Economic Dynamics and Control, vol. 25, pp. 641-654, 2001.
12. A. van Moorsel and K. Wolter, "Optimal Restart Times for Moments of Completion Times," in UK Performance Engineering Workshop, Bradford, UK, July 2004.
13. V. F. Nicola, "Checkpointing and the Modeling of Program Execution Time," in Trends in Software 3: Software Fault Tolerance, M. R. Lyu (Ed.), Wiley & Sons, Chichester, UK, Chapter 7, pp. 167-188, 1995.
14. P. Reinecke, A. van Moorsel and K. Wolter, "A Measurement Study of the Interplay between Application Level Restart and Transport Protocol," in Service Availability Forum, Munich, May 2004.
15. Y. Ruan, E. Horvitz and H. Kautz, "Restart Policies with Dependence among Runs: A Dynamic Programming Approach," in Proceedings of the Eight International Conference on Principles and Practice of Constraint Programming, Ithaca, NY, Sept. 2002.
16. M. Schroeder and L. Buro, "Does the Restart Method Work? Preliminary Results on Efficiency Improvements for Interactions of Web-Agents," in T. Wagner and O. Rana, editors, Proceedings of the Workshop on Infrastructure for Agents, MAS, and Scalable MAS at the Conference Autonomous Agents 2001, Springer Verlag, Montreal, Canada, 2001.