Minimizing completion time of a program by checkpointing and rejuvenation
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Query restart strategies for Web agents
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Efficiency improvements for interactions of web-agents
Proceedings of the fifth international conference on Autonomous agents
Fine grained software degradation models for optimal rejuvenation policies
Performance Evaluation
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the Quality of Service of Failure Detectors
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Analysis and Algorithms for Restart
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
A measurement study of the interplay between application level restart and transport protocol
ISAS'04 Proceedings of the First international conference on Service Availability
Self-Management of systems through automatic restart
Self-star Properties in Complex Information Systems
M/G/1/MLPS compared to M/G/1/PS
Operations Research Letters
Adaptivity metric and performance for restart strategies in web services reliable messaging
WOSP '08 Proceedings of the 7th international workshop on Software and performance
ISAS '07 Proceedings of the 4th international symposium on Service Availability
Stochastic Models for Dependable Services
Electronic Notes in Theoretical Computer Science (ENTCS)
On universal restart strategies for backtracking search
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Analysis of a software system with rejuvenation, restoration and checkpointing
ISAS'08 Proceedings of the 5th international conference on Service availability
Evaluating the adaptivity of computing systems
Performance Evaluation
Analysis of service availability for time-triggered rejuvenation policies
Journal of Systems and Software
Journal of Systems and Software
On-line adaptive algorithms in autonomic restart control
ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
Efficient detection of errors in java components using random environment and restarts
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Phase-type distributions for realistic modelling in discrete-event simulation
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Multiple class G-networks with restart
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
| Hi-index | 0.00 |
Restarts or retries are a common phenomenon in computing systems, for instance, in preventive maintenance, software rejuvenation, or when a failure is suspected. Typically, one sets a time-out to trigger the restart. We analyze and optimize time-out strategies for scenarios in which the expected required remaining time of a task is not always decreasing with the time invested in it. Examples of such tasks include the download of Web pages, randomized algorithms, distributed queries, and jobs subject to network or other failures. Assuming the independence of the completion time of successive tries, we derive computationally attractive expressions for the moments of the completion time, as well as for the probability that a task is able to meet a deadline. These expressions facilitate efficient algorithms to compute optimal restart strategies and are promising candidates for pragmatic online optimization of restart timers.