dc.creatorAlberto Calixto Simón
dc.creatorSAUL EDUARDO POMARES HERNANDEZ
dc.creatorJOSE ROBERTO PEREZ CRUZ
dc.creatorMaría del Pilar Gómez Gil
dc.date2013
dc.date.accessioned2023-07-25T16:25:32Z
dc.date.available2023-07-25T16:25:32Z
dc.identifierhttp://inaoe.repositorioinstitucional.mx/jspui/handle/1009/2400
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7807576
dc.descriptionCommunication-induced checkpointing (CIC) has two main advantages: first, it allows processes in a distributed computation to take asynchronous checkpoints, and secondly, it avoids the domino effect. To achieve these, CIC algorithms piggyback information on the application messages and take forced local checkpoints when they recognize potentially dangerous patterns. The main disadvantages of CIC algorithms are the amount of overhead per message and the induced storage overhead. In this paper we present a communication-induced checkpointing algorithm called Scalable Fully-Informed (S-FI) that attacks the problem of message overhead. For this, our algorithm modifies the Fully-Informed algorithm by integrating it with the immediate dependency principle. The S-FI algorithm was simulated and the result shows that the algorithm is scalable since the message overhead presents an under-linear growth as the number of processes and/or the message density increase.
dc.formatapplication/pdf
dc.languageeng
dc.publisherIEICE Transactions on Information and Systems
dc.relationcitation:Calixto, A., et al., (2013). A Scalable Communication-Induced Checkpointing Algorithm for Distributed Systems, IEICE Transactions on Information and Systems, Vol. E96.D (4): 886-896
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectinfo:eu-repo/classification/cti/1
dc.subjectinfo:eu-repo/classification/cti/12
dc.subjectinfo:eu-repo/classification/cti/1203
dc.subjectinfo:eu-repo/classification/cti/1203
dc.titleA Scalable Communication-Induced Checkpointing Algorithm for Distributed Systems
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/acceptedVersion
dc.audiencestudents
dc.audienceresearchers
dc.audiencegeneralPublic


Este ítem pertenece a la siguiente institución