ACM Home Page
Please provide us with feedback. Feedback
On checkpointing and heavy-tails in unreliable computing environments
Full text PdfPdf (458 KB)
Source ACM SIGMETRICS Performance Evaluation Review archive
Volume 34 ,  Issue 2  (September 2006) table of contents
SPECIAL ISSUE: Special issue on Performance 2005 posters table of contents
Pages: 13 - 15  
Year of Publication: 2006
ISSN:0163-5999
Authors
Craig Bossie  University of Southern Maine, Portland, ME
Pierre M. Fiorini  University of Southern Maine, Portland, ME
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 10,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1168134.1168142
What is a DOI?

ABSTRACT

In this paper, we discuss checkpointing issues that should be considered whenever jobs execute in unreliable computing environments. Specifically, we show that if proper check-pointing procedures are not properly implemented, then under certain conditions, job completion time distributions exhibit properties of heavy-tail or power-tail distributions (hereafter referred to as power-tail distributions (PT), which can lead to highly-variable and long completion times.



Collaborative Colleagues:
Craig Bossie: colleagues
Pierre M. Fiorini: colleagues