{"title":"用于复制对象和进程的耦合算法","authors":"Vittoria Gianuzzi","doi":"10.1016/0165-6074(94)90043-4","DOIUrl":null,"url":null,"abstract":"<div><p>The problem of defining a general scheme for interfacing replication for software fault tolerance (diverse software versions) and system replication techniques (distributed execution of process replicas) is investigated. An algorithm, called <em>Minimum Information Algorithm</em>, is defined in order to couple object copies and process replicas.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 799-802"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90043-4","citationCount":"0","resultStr":"{\"title\":\"Coupling algorithms for replicated objects and processes\",\"authors\":\"Vittoria Gianuzzi\",\"doi\":\"10.1016/0165-6074(94)90043-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The problem of defining a general scheme for interfacing replication for software fault tolerance (diverse software versions) and system replication techniques (distributed execution of process replicas) is investigated. An algorithm, called <em>Minimum Information Algorithm</em>, is defined in order to couple object copies and process replicas.</p></div>\",\"PeriodicalId\":100927,\"journal\":{\"name\":\"Microprocessing and Microprogramming\",\"volume\":\"40 10\",\"pages\":\"Pages 799-802\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0165-6074(94)90043-4\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Microprocessing and Microprogramming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0165607494900434\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Microprocessing and Microprogramming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0165607494900434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coupling algorithms for replicated objects and processes
The problem of defining a general scheme for interfacing replication for software fault tolerance (diverse software versions) and system replication techniques (distributed execution of process replicas) is investigated. An algorithm, called Minimum Information Algorithm, is defined in order to couple object copies and process replicas.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
