{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:31:41Z","timestamp":1740105101716,"version":"3.37.3"},"reference-count":28,"publisher":"Wiley","issue":"21","license":[{"start":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T00:00:00Z","timestamp":1507075200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2017,11,10]]},"abstract":"Summary<\/jats:title>Communication\u2010induced checkpointing (CIC) protocols aim at finding consistent global checkpoint from which a system can safely restart without the risk of domino effect. CIC class gives processes the maximum autonomy for taking their local checkpoints while directs them to take forced checkpoints when harm patterns are detected. Such patterns can constitute of non\u2010causally doubled Z\u2010paths that violate the causal relation and can cause checkpoints uselessness, which results in hidden dependencies between checkpoints. Ensuring the absence of hidden dependencies hence means the ensure of the Rollback\u2010Dependency Trackability (RDT) property.<\/jats:p>Reducing the control information overhead is the main aim of our proposals. Our first proposal is called CSFDAS (Constant Size Fixed Dependency After Send), and the second is called CSRDTParner (Constant Size RDTPartner). Unlike to the previous works, the new proposed protocols use direct dependency clocks instead of transitive dependency vectors while keeping only a constant size of control information on messages. Conducted simulations show that the new protocols achieve a good performance compared to the RDT protocols proposed so far in the literature.<\/jats:p>","DOI":"10.1002\/cpe.4271","type":"journal-article","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T12:45:07Z","timestamp":1507207507000},"source":"Crossref","is-referenced-by-count":3,"title":["Low overhead communication\u2010induced checkpointing protocols ensuring rollback\u2010dependency trackability property"],"prefix":"10.1002","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3846-5631","authenticated-orcid":false,"given":"Z.","family":"Abdelhafidi","sequence":"first","affiliation":[{"name":"Computer Science and Mathematics Laboratory Amar Telidji University Road of Ghardaa, BP 37G Laghouat 03000 Algeria"}]},{"given":"N.","family":"Lagraa","sequence":"additional","affiliation":[{"name":"Computer Science and Mathematics Laboratory Amar Telidji University Road of Ghardaa, BP 37G Laghouat 03000 Algeria"}]},{"given":"M. B.","family":"Yagoubi","sequence":"additional","affiliation":[{"name":"Computer Science and Mathematics Laboratory Amar Telidji University Road of Ghardaa, BP 37G Laghouat 03000 Algeria"}]},{"given":"M.","family":"Djoudi","sequence":"additional","affiliation":[{"name":"Computer Science and Mathematics Laboratory Amar Telidji University Road of Ghardaa, BP 37G Laghouat 03000 Algeria"}]}],"member":"311","published-online":{"date-parts":[[2017,10,4]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568525"},{"key":"e_1_2_9_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00038-7"},{"issue":"1","key":"e_1_2_9_4_1","first-page":"43","article-title":"Direct dependency\u2010based determination of consistent global checkpoints","volume":"16","author":"Baldoni R","year":"2001","journal-title":"Comput Syst Sci Eng"},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00566-2"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxk004"},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-014-9599-8"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.588059"},{"key":"e_1_2_9_9_1","unstructured":"BaldoniR H\u00e9laryJM MostefaouiA RaynalM.A communication\u2010induced checkpointing protocol that ensures rollback\u2010dependency trackability. In:27th IEEE Symp. Fault\u2010Tolerant Computing (FTCS '27) Seattle USA;1997:68\u201077."},{"key":"e_1_2_9_10_1","unstructured":"GarciaIC VieiraGM BuzatoLE.RDT\u2010Partner: An efficient checkpointing protocol that enforces rollback dependency trackability. In: Proceedings 19thBrazilian Symposium Computer Networks Santa Catarina Brazil;2001:162\u2010177."},{"key":"e_1_2_9_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2011.01.005"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050003"},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780865"},{"key":"e_1_2_9_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.730526"},{"key":"e_1_2_9_15_1","first-page":"239","article-title":"More properties of communication\u2010induced checkpointing protocols with rollback\u2010dependency trackability","volume":"21","author":"Tsai J","year":"2005","journal-title":"J Inf Sci Eng."},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2016.04.070"},{"key":"e_1_2_9_17_1","unstructured":"TsaiJ.Systematic comparisons of RDT communication\u2010induced checkpointing protocols. In: Proceedings. 10th IEEE Pacific Rim International Symposium on Dependable Computing Papeete Tahiti:FRENCH POLYNESIA IEEE;2004:66\u201075."},{"key":"e_1_2_9_18_1","unstructured":"VieiraGM BuzatoLE.Distributed checkpointing: Analysis and benchmarks. In: Proceedings of the 24th Brazilian Symposium on Computer Networks.Curitiba Paran\u00e1 Brazil;2006:1\u201016."},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.752783"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.342127"},{"key":"e_1_2_9_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2906"},{"key":"e_1_2_9_22_1","unstructured":"GarciaIC BuzzatoLE.On the minimal characterization of the rollback\u2010dependency trackability property. In: 21st International Conference on Distributed Computing Systems 2001.Mesa AZ USA:IEEE;2001:342\u2010349."},{"key":"e_1_2_9_23_1","doi-asserted-by":"crossref","unstructured":"GarciaIC BuzatoLE.An efficient checkpointing protocol for the minimal characterization of operational rollback\u2010dependency trackability. In: Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems Florianpolis Brazil:IEEE;2004:126\u2010135.","DOI":"10.1109\/RELDIS.2004.1353013"},{"key":"e_1_2_9_24_1","unstructured":"FowlerJ ZwaenepoelW.Causal distributed breakpoints. In: Proceedings of the 10th International Conference on Distributed Computing Systems 1990.Paris France:IEEE 1990:134\u2010141."},{"issue":"23","key":"e_1_2_9_25_1","first-page":"215","article-title":"Virtual time and global states of distributed systems","volume":"1","author":"Mattern F","year":"1989","journal-title":"Parallel Distrib Algorithms"},{"key":"e_1_2_9_26_1","unstructured":"FidgeCJ.Timestamps in message\u2010passing systems that preserve the partial ordering. In: Proceeding of 11th Australian comuter science conference 1988;55\u201066."},{"key":"e_1_2_9_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1225055"},{"key":"e_1_2_9_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2906"},{"key":"e_1_2_9_29_1","unstructured":"VieiraGM BuzatoLE.Chksim: a distributed checkpointing simulator. Technical Report IC\u201005\u2010034;2005."}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.4271","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.4271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T00:50:23Z","timestamp":1694825423000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.4271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,4]]},"references-count":28,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2017,11,10]]}},"alternative-id":["10.1002\/cpe.4271"],"URL":"https:\/\/doi.org\/10.1002\/cpe.4271","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"type":"print","value":"1532-0626"},{"type":"electronic","value":"1532-0634"}],"subject":[],"published":{"date-parts":[[2017,10,4]]}}}