Learn More
Memory exclusion is a powerful tool for optimizing the performance of checkpointing, however it has not been automated completely with low enough overhead. In this paper we present compiler-assisted memory exclusion (CAME), a technique that uses static program analysis to optimize the performance of checkpoint-ing. With the assistance of user-placed(More)
The percentage of elderly people in European countries is increasing. Such conjuncture affects socio-economic structures and creates demands for resourceful solutions, such as Ambient Assisted Living (AAL), which is a possible methodology to foster health care for elderly people. In this context, sensor-based devices play a leading role in surveying, e.g.,(More)
  • S. Plank, Michael G. ThomasonNovember
  • 1998
Performance prediction of checkpointing systems in the presence of failures is a well-studied research area. The average availability is deened as a useful metric for uniprocessor checkpointing systems in a previous Technical Report PT98]. This report introduces a discrete-parameter, nite-state Markov chain Mtocompute the availability for multiprocessor(More)
References 1] distributed.net home page. normally a loop consists of multiple function calls. However, the OCaml optimizer can in-line functions, which might mean that even for pure functional programs, function boundaries might not always serve as good safe points. Finally, even if we solve the problem of safe points, this is still not suucient, since we(More)
Preface We like to say thank you to all that supported us and without them this thesis would not have become real. First of all we like to state our highest gratitude to our supervisors Edison Pignaton de Freitas and Professor Tony Larsson, as well as Wagner Ourique de Morais. Their experience, advice, help and encouragement have made this thesis possible.(More)
The precursor to this work (where diskless checkpointing was rst described) was presented at FTCS-24 27]. Abstract Diskless Checkpointing is a technique for checkpointing the state of a long-running computation on a distributed system without relying on stable storage. As such, it eliminates the performance bottleneck of traditional checkpointing on(More)
In the past twenty years, there has been a wealth of theoretical research on minimizing the expected running time of a program in the presence of failures by employing checkpointing and rollback recovery. In the same time period, there has been little experimental research to corroborate these results. In this paper, we study the results of three separate(More)
  • 1