Optimal Checkpoint Placement with Equality Constraints

In this paper we consider aperiodic checkpoint placement problems with equality constraints over an infinite time horizon and develop both exact and approximate algorithms to determine the optimal checkpoint sequences minimizing the relevant expected costs. More precisely, the problem is to minimize...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing : (DASC 2006) : proceedings : September 29-October 1, 2006, Indiana University-Purdue University, Indianapolis, USA s. 77 - 84
Hlavní autoři: Dohi, T., Ozaki, T., Kaio, N.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2006
Témata:
Checkpointing
Cost function
Distributed computing
Dynamic programming
Environmental economics
File systems
Heuristic algorithms
Memory management
Preventive maintenance
Processor scheduling
ISBN:9780769525396, 0769525393
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper we consider aperiodic checkpoint placement problems with equality constraints over an infinite time horizon and develop both exact and approximate algorithms to determine the optimal checkpoint sequences minimizing the relevant expected costs. More precisely, the problem is to minimize the expected recovery cost (expected checkpointing cost) subject to a given level of the expected checkpointing cost (expected recovery cost). First, we develop exact computation algorithms to derive the optimal aperiodic checkpoint sequence by applying the Lagrange multiplier. Second, we propose approximate algorithms based on the variational calculus approach. Numerical examples are devoted to compare two computation algorithms in terms of both accuracy of the resulting checkpoint sequences and their computation efficiency
AbstractList In this paper we consider aperiodic checkpoint placement problems with equality constraints over an infinite time horizon and develop both exact and approximate algorithms to determine the optimal checkpoint sequences minimizing the relevant expected costs. More precisely, the problem is to minimize the expected recovery cost (expected checkpointing cost) subject to a given level of the expected checkpointing cost (expected recovery cost). First, we develop exact computation algorithms to derive the optimal aperiodic checkpoint sequence by applying the Lagrange multiplier. Second, we propose approximate algorithms based on the variational calculus approach. Numerical examples are devoted to compare two computation algorithms in terms of both accuracy of the resulting checkpoint sequences and their computation efficiency
Author Dohi, T.
Kaio, N.
Ozaki, T.
Author_xml – sequence: 1
  givenname: T.
  surname: Dohi
  fullname: Dohi, T.
  organization: Dept. of Inf. Eng., Hiroshima Univ
– sequence: 2
  givenname: T.
  surname: Ozaki
  fullname: Ozaki, T.
  organization: Dept. of Inf. Eng., Hiroshima Univ
– sequence: 3
  givenname: N.
  surname: Kaio
  fullname: Kaio, N.
BookMark eNotjsFKw0AURQdUUGt27tzkBxLfy5vMZJYl1ioUKrSuy0zyQkfTJCYj0r83oHdzz-JyuLfisus7FuIeIUUE8_i03JVpBqBS0hciMroArUye5WTUtYim6QPmkJEo5Y1Q2yH4k23j8sjV59D7LsRvra34xDP9-HCMV1_ftvXhHJd9N4XRzpPpTlw1tp04-u-FeH9e7cuXZLNdv5bLTeJR5yGxhW1MXUNdOEkIgLKRVKFxSoLmBuvaEaN1yMpkBRtbKUcqd0CaNSpLC_Hw5_XMfBjG-ep4PkggKJShXzlUReM
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/DASC.2006.37
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 84
ExternalDocumentID 4030869
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i175t-a8af9dd0d8b4310014f43c19b6407ef1ddb3e1ab1e6928e9ac6b365b037e716a3
IEDL.DBID RIE
ISBN 9780769525396
0769525393
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000241699300010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 01:56:16 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-a8af9dd0d8b4310014f43c19b6407ef1ddb3e1ab1e6928e9ac6b365b037e716a3
PageCount 8
ParticipantIDs ieee_primary_4030869
PublicationCentury 2000
PublicationDate 2006-Sept.
PublicationDateYYYYMMDD 2006-09-01
PublicationDate_xml – month: 09
  year: 2006
  text: 2006-Sept.
PublicationDecade 2000
PublicationTitle 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing : (DASC 2006) : proceedings : September 29-October 1, 2006, Indiana University-Purdue University, Indianapolis, USA
PublicationTitleAbbrev ISDASC
PublicationYear 2006
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000394144
Score 1.3910595
Snippet In this paper we consider aperiodic checkpoint placement problems with equality constraints over an infinite time horizon and develop both exact and...
SourceID ieee
SourceType Publisher
StartPage 77
SubjectTerms Checkpointing
Cost function
Distributed computing
Dynamic programming
Environmental economics
File systems
Heuristic algorithms
Memory management
Preventive maintenance
Processor scheduling
Title Optimal Checkpoint Placement with Equality Constraints
URI https://ieeexplore.ieee.org/document/4030869
WOSCitedRecordID wos000241699300010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FQNTgRbxlgdGQpP4EXtEpRVTqQRI3So_LqIC0qpNkfj3xEkahMTCZnuwrLPs0313330A19KFIjXO4180DZjjNlCWYaBk6HxLM1S6EptIJhM5m6lpC24aLgwilsVneOuHZS7fLe3WQ2UD5purCNWGdpKIiqvV4CkhVawIDqrIXPGYU0XrBju7uWgK39Xg_u5pWKUi6G9hldKvjLv_O9EB9H8IemTauJ5DaGF2BN2dQgOpH2wPxGPxI3zodzJ8Rfu2Wi6ynEw9cO63JR6DJaOKVvlFvHRnKRiRb_rwMh49Dx-CWikhWBTuPw-01KlyLnTSMI_YRyxl1EbK-DQdppFzhmKkTYRCxbKwvxWGCm5CmmARMGl6DJ1smeEJEIZp4bFCabmMWcKNEZoZzi0We2qMk1PoeTPMV1UzjHltgbO_l89hv8IsfFHWBXTy9RYvYc9-5ovN-qq8wW8OR5kK
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61Cnqq2opvc_Do2t3NY5Oj1ErFWgtW6K3kMYtF3ZZ2K_jv3exuVwQv3pIchjAhmcw3jw-hS2F9Hmvr8C8Se9Qy40lDwZPCt66lGUhVkE1Eg4EYj-Wwhq6qWhgAyJPP4NoN81i-nZmVg8ra1DVX4XIDbTJKQ7-o1qoQFZ9ImrkHhW8uWciIJGWLnfWcV6nvsn1789wpghHkN7VKblnuGv_b0y5q_ZTo4WFlfPZQDZJ91FhzNODyyjYRf8rehA_1jjuvYN7ms2mS4qGDzp1Y7FBY3C0KK7-wI-_MKSPSZQu93HVHnZ5XciV40-wDkHpKqFha61uhqcPsAxpTYgKpXaAO4sBaTSBQOgAuQ5GdgOGacKZ9EkHmMilygOrJLIFDhCnEmc3yhWEipBHTmiuqGTOQyVQQRkeo6dQwmRftMCalBo7_Xr5A273RY3_Svx88nKCdAsFwKVqnqJ4uVnCGtsxnOl0uzvPT_AY4q5xR
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2nd+IEEE+International+Symposium+on+Dependable%2C+Autonomic+and+Secure+Computing+%3A+%28DASC+2006%29+%3A+proceedings+%3A+September+29-October+1%2C+2006%2C+Indiana+University-Purdue+University%2C+Indianapolis%2C+USA&rft.atitle=Optimal+Checkpoint+Placement+with+Equality+Constraints&rft.au=Dohi%2C+T.&rft.au=Ozaki%2C+T.&rft.au=Kaio%2C+N.&rft.date=2006-09-01&rft.pub=IEEE&rft.isbn=9780769525396&rft.spage=77&rft.epage=84&rft_id=info:doi/10.1109%2FDASC.2006.37&rft.externalDocID=4030869
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769525396/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769525396/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769525396/sc.gif&client=summon&freeimage=true