Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9664
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Devesh-
dc.date.accessioned2014-11-20T05:18:43Z-
dc.date.available2014-11-20T05:18:43Z-
dc.date.issued2000-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9664-
dc.guideMishra, Manoj-
dc.description.abstractThis dissertation presents a comparative study of two Communication-Induced Checkpointing Protocols with Rollback-Dependency Trackability. Rollback-Dependency Trackability (RDT) is a property that states that all rollback dependencies between local checkpoints are on-line trackable by using a transitive dependency vector. These protocols are proposed for improving the fault-tolerance in distributed systems. Theoretically it can be proved that the common intuition "If a protocol forces a checkpoint only at a stronger condition, then it should take less number of forced checkpoints than a protocol based on a weaker condition", is false. This has already been proved by taking a few counterexamples [1]. Our simulation study implies that such examples are very rare and for most of the time the intuition holds true. Thus, a protocol taking checkpoints at stronger condition outperforms the protocol taking checkpoints at weaker condition as the checkpointing overhead in former protocol is less.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectCOMMUNICATION-INDUCED CHECKPOINTING PROTOCOLSen_US
dc.subjectROLLBACK-DEPENDENCY TRACKABILITYen_US
dc.subjectON-LINE TRACKABLEen_US
dc.titleA COMPARATIVE STUDY OF COMMUNICATION-INDUCED CHECKPOINTING PROTOCOLSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG10072en_US
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECDG10072.pdf3.31 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.